Sufficient conditions of deterministic implementation of finite-state automata with retention of the numbers of their states
The following three conditions for nondeterministic finite-state automata are defined: input embeddability, output embeddability, and input decomposability. Automata satisfying these conditions are called nondeterministic automata with embeddability. A method for deterministic implementation of such automata with retention of the numbers of their states is proposed. These automata correspond to block-procedural high-level programming languages.
Keywordsfinite-state automata or finite state machines (FSMs) deterministic automata nondeterministic automata nondeterministic automata with embeddability conditions of embeddability and decomposability of nondeterministic automata method for deterministic implementation of nondeterministic automata
Unable to display preview. Download preview PDF.
- 1.B. A. Trakhtenbrot and Ya. M. Barzdin, Finite-State Automata (Behavior and Synthesis)[in Russian], Nauka, Moscow (1970).Google Scholar