Traditional nondeterministic nite automata allow for a nondeterministic choice of one particular path from the union of all possible sets of paths at a certain point. Selective nondeterministic automata, on the other hand, perform a given associative binary operation? on
|
2770
|
Introduction to Automata Theory, Language, and Computation
– Hopcroft, Ullman
- 1979
|
|
1713
|
Statecharts: A Visual Formalism for Complex Systems
– Harel
- 1987
|
|
204
|
Formal Languages and their Relation to Automata
– Hopcroft, Ullman
- 1969
|
|
183
|
Graphical Enumeration
– Harary, Palmer
- 1973
|
|
141
|
Finite automata and their decision problems
– Rabin, Scott
- 1959
|
|
45
|
Extending state transition diagrams for the specification of human-computer interaction
– Wasserman
- 1985
|
|
38
|
Economy of description by automata, grammars, and formal systems
– Meyer, Fischer
- 1971
|
|
34
|
Canonical regular expressions and minimal state graphs for definite events
– Brzozowski
|
|
32
|
Protocol Description and Analysis based on a State Transition Model with Channel Expressions
– Pachl
- 1987
|
|
30
|
On Equations for Regular Languages, Finite Automata, and Sequential Networks: Theoret
– Brzozowski, Leiss
- 1980
|
|
29
|
The reduction of two-way automata to one-way automata
– Shepherdson
- 1959
|
|
20
|
A note on the reduction of two-way automata to one-way automata. Information Processing Letters 30(5):261–264. (p. 54) Moshe Y. Vardi (1997): Alternating automata: Unifying truth and validity checking for temporal logics
– Vardi
- 1989
|
|
18
|
Finite automata and unary languages
– Chrobak
- 1986
|
|
18
|
Leeuwen (Ed.), Handbook of Theoretical Computer Science, vol. A: Algorithms and Complexity
– van
- 1990
|
|
15
|
Succinct Representation of Regular Languages by Boolean automata II: Theoret
– Leiss
- 1985
|
|
9
|
Applied Modern Algebra
– Dornhoff, Hohn
- 1978
|
|
9
|
Amounts of nondeterminism in finite automata
– Kintala, Wotschke
- 1980
|
|
9
|
Discrete Mathematical Structures and their Applications
– Stone
- 1973
|
|
9
|
On the Degree of Ambiguity of Finite Automata
– Weber, Seidl
- 1991
|
|
7
|
On Synchronized Statecharts
– Drusinsky
- 1988
|
|
7
|
On the power of cooperative concurrency
– Drusinsky, Harel
- 1988
|
|
6
|
bounds on the size of sweeping automata
– Sipser
- 1980
|
|
6
|
On the maximal order
– Szalay
- 1980
|
|
5
|
Relating the type of ambiguity of finite automata to the succinctness of their representation
– Ravikumar, Ibarra
- 1989
|
|
4
|
On the Finite-valuedness Problem for Sequential Machines
– Chan, Ibarra
- 1983
|
|
4
|
The User's Guide to Grail
– Raymond, Wood
- 1995
|
|
3
|
On the Succinctness Gained by Bounded Cooperating Concurrency. MSc thesis, Dept
– ARMONI
- 1991
|
|
3
|
Concatenation of inputs in a two-way automaton
– Birget
- 1989
|
|
2
|
Concise Reperesentations of Regular Languages by Degree and Probabilistic Automata
– Kintala, Pun, et al.
- 1993
|
|
2
|
Ueber die Maximalordung der Permutationen gegebenen Grades
– Landau
|
|
2
|
der Zanden, FADELA: Finite Automata DEbugging LAnguage
– van
- 1990
|
|
2
|
A Distributed Alternative to Finite-State Machine Specifications
– Zave
- 1985
|
|
1
|
State-complexity of state devices, state compressibility and incompressibility
– Birget
|
|
