Sciweavers

2465 search results - page 5 / 493
» Automata on Linear Orderings
Sort
View
BANFF
1995
15 years 3 months ago
An Automata-Theoretic Approach to Linear Temporal Logic
The automata-theoretic approach to linear temporal logic uses the theory of automata as a unifying paradigm for program specification, verification, and synthesis. Both programs ...
Moshe Y. Vardi
ICTAC
2007
Springer
15 years 5 months ago
Linear Context Free Languages
Abstract. In this paper, I present the class of linear context free languages (LCFLs) with a class of non-deterministic one-way two-head (read only) automata, called non-determinis...
Roussanka Loukanova
JAC
2008
15 years 1 months ago
Quantization of cellular automata
Take a cellular automaton, consider that each configuration is a basis vector in some vector space, and linearize the global evolution function. If lucky, the result could actually...
Pablo Arrighi, Vincent Nesme
78
Voted
MFCS
2009
Springer
15 years 6 months ago
Bounds on Non-surjective Cellular Automata
Abstract. Cellular automata (CA) are discrete, homogeneous dynamical systems. Non-surjective one-dimensional CA have nite words with no preimage (called orphans), pairs of dieren...
Jarkko Kari, Pascal Vanier, Thomas Zeume
AAAI
2008
15 years 2 months ago
Optimal Metric Planning with State Sets in Automata Representation
This paper proposes an optimal approach to infinite-state action planning exploiting automata theory. State sets and actions are characterized by Presburger formulas and represent...
Björn Ulrich Borowsky, Stefan Edelkamp