1728 search results - page 129 / 346 » The Size of Power Automata |
190
click to vote
MFCS
2007
Springer
16 years 25 days ago
2007
Springer
In formal language theory, many families of languages are defined using grammars or finite acceptors like pushdown automata and Turing machines. For instance, context-sensitive l...
164
click to vote
ICPPW
2006
IEEE
16 years 22 days ago
2006
IEEE
This paper presents an analysis on the performance of a parallel implementation of a discrete model of laser dynamics, which is based on cellular automata. The performance of a 2D...
195
click to vote
ICSOC
2004
Springer
16 years 1 days ago
2004
Springer
The e-services paradigm promises to enable rich, flexible, and dynamic inter-operation of highly distributed, heterogeneous networkenabled services. Among the challenges, a funda...
134
click to vote
PPSN
2004
Springer
16 years 1 days ago
2004
Springer
Evolving large phenotypes remains nowadays a problem due to the combinatorial explosion of the search space. Seeking better scalability and inspired by the development of biologica...
169
click to vote
CAV
2004
Springer
15 years 10 months ago
2004
Springer
Model checking algorithms can report a property as being true for reasons that may be considered vacuous. Current algorithms for detecting vacuity require either checking a quadrat...