3229 search results - page 182 / 646 » The Theory of Timed Automata |
196
click to vote
LATA
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Motivated by strong Karp-Lipton collapse results in bounded arithmetic, Cook and Kraj´ıˇcek [7] have recently introduced the notion of propositional proof systems with...
178
click to vote
WIA
2009
Springer
16 years 1 months ago
2009
Springer
FAdo is an ongoing project which aims to provide a set of tools for symbolic manipulation of formal languages. To allow highlevel programming with complex data structures, easy pro...
185
click to vote
ATVA
2009
Springer
16 years 1 months ago
2009
Springer
Parity games are 2-player games of perfect information and infinite duration that have important applications in automata theory and decision procedures (validity as well as model...
182
click to vote
LATA
2010
Springer
16 years 1 months ago
2010
Springer
We extend stochastic context-free grammars such that the probability of applying a production can depend on the length of the subword that is generated from the application and sho...
169
click to vote
IPPS
2007
IEEE
16 years 25 days ago
2007
IEEE
The GCA (Global Cellular Automata) model consists of a collection of cells which change their states synchronously depending on the states of their neighbors like in the classical...