Ultimate-Definite and Symmetric-Definite Events and Automata
- 1 July 1965
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 12 (3) , 399-410
- https://doi.org/10.1145/321281.321292
Abstract
New classes of events and finite automata which generalize the noninitial definite class are introduced. These events, called “ultimate definite” (u.d.), “reverse u.d.” and “symmetric definite,” are investigated as to algebraic and closure properties. Effective decision procedures whereby it can be decided whether a given finite automata defines such an event are given and unique canonical representations for these events are derived.Keywords
This publication has 5 references indexed in Scilit:
- Derivatives of Regular ExpressionsJournal of the ACM, 1964
- The Theory of Definite AutomataIEEE Transactions on Electronic Computers, 1963
- A class of convolution codesInformation and Control, 1963
- Regular Expressions and State Graphs for AutomataIEEE Transactions on Electronic Computers, 1960
- Finite Automata and Their Decision ProblemsIBM Journal of Research and Development, 1959