×
Brzozowski, J. A.; Leiss, E.

On equations for regular languages, finite automata, and sequential networks. (English) Zbl 0415.68023

Theor. Comput. Sci. 10, 19-35 (1980).
Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page
scan of Zbl 0415.68023

Cited in 68 Documents

MSC:

68Q45 Formal languages and automata
94C10 Switching theory, application of Boolean algebra; Boolean functions (MSC2010)

Keywords:

Boolean automaton; language equations; representing regular languages; nondeterministic automaton representation; sequential networks
Cite Review PDF
Full Text: DOI

References:

[1] Arden, D. N., Delayed logic and finite state machines, Proc. 2nd Ann. Symp. on Switching Circuit Theory and Logical Design, 133-151 (1961), Detroit
[2] Bodnarchuk, K., Sistemy uravnenij v algebre sobytij, Z. Vyčisl. Mat. i Fiz., 3, 1077-1088 (1963)
[3] Brzozowski, J. A., Canonical regular expressions and minimal state graphs for definite events, (Mathematical Theory of Automata (1963), Polytechnic Institute of Brooklyn: Polytechnic Institute of Brooklyn New York), 529-561 · Zbl 0116.33605
[4] Brzozowski, J. A., Regular expressions from sequential circuits, IEEE Trans., EC-13, 6, 741-744 (1964)
[5] Brzozowski, J. A.; Yoeli, M., Digital Networks (1976), Prentice Hall: Prentice Hall Englewoods Cliffs, NJ · Zbl 0595.94021
[6] Kozen, D., On Parallelism in Turing machines, (Proc. 17th Ann. Symp. on Foundations of Computer Science (1976), Polytechnic Institute of Brooklyn), 89-97
[7] Salomaa, A., Theory of Automata (1969), Pergamon Press: Pergamon Press Oxford · Zbl 0193.32901
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.