R. A. Trakhtenbrot and Y. M. Barzdin. Finite Automata: Behavior and Sythesis. North-Holland, 1973. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
The Size of Power Automata - Sutner (1994) (2 citations) (Correct)
....is a word w such that w (A) B. Now suppose we reverse all transitions in A. In rev(A) for any B [n] there is a word w such that w (f1g) B. Indeed, if we augment the semiautomaton rev(A) 1 by selecting 1 as initial and nal state, the corresponding power automaton has size 2 n , see [19, 3], and this power automaton turns out to be reduced. The same is true if we select all states to be initial and nal. However, the semiautomaton rev(A) is transitive (i.e. the underlying digraph is strongly connected) whereas its power automaton has 3 strongly connected components: n] and the ....
R. A. Trakhtenbrot and Y. M. Barzdin. Finite Automata: Behavior and Sythesis. North-Holland, 1973.
The Size of Power Automata - Sutner Computer Science (1994) (2 citations) (Correct)
No context found.
R. A. Trakhtenbrot and Y. M. Barzdin. Finite Automata: Behavior and Sythesis. North-Holland, 1973.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC