Name
Abstract | ||
|---|---|---|
With every rational language we associate a canonical non-deterministicautomaton, that subsumes all possible "minimal" automata recognizingthis language.1 IntroductionThe minimal deterministic automaton associated with a rational language isnot, in general, "minimal" with respect to the number of states: for instance,rr?rfflffififl?rfflffififl?\Theta\Theta\ThetaflBBBNab cb chas more states thanrrfflffififl?rfflffififl?\Theta\Theta... |
Year | Venue | Field |
|---|---|---|
1992 | Bulletin of the EATCS | Quantum finite automata,Mobile automaton,Automaton,Theoretical computer science,Regular language,Mathematics,ω-automaton |
DocType | Volume | Citations |
Journal | 47 | 25 |
PageRank | References | Authors |
2.88 | 1 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| André Arnold | 1 | 274 | 49.76 |
| Anne Dicky | 2 | 51 | 5.74 |
| Maurice Nivat | 3 | 1261 | 277.74 |