The generalization of generalized automata: Expression automata

International Journal of Foundations of Computer Science

Volumn 16, Issue 3, 2005, Pages 499-510

  Han, Yo Sub ^a   Wood, Derick ^a  

^a HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

Author keywords

Expression automata; Prefix freeness; State elimination

Indexed keywords

EID: 33646414953     PISSN: 01290541     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0129054105003121     Document Type: Conference Paper

References (9)

1. J. Brzozowski and E. McCluskey, Jr. Signal flow graph techniques for sequential circuit state diagrams. IEEE Transactions on Electronic Computers, EC-12:67-76, 1963.
2. S. Eilenberg. Automata, Languages, and Machines, volume A. Academic Press, New York, NY, 1974.
3. D. Giammarresi and R. Montalbano. Deterministic generalized automata. Theoretical Computer Science, 215:191-208, 1999.
4. J. Hopcroft. An n log n algorithm for minimizing the states in a finite automaton. In Z. Kohavi and A. Paz, editors, Theory of Machines and Computations, 189-196, New York, NY, 1971. Academic Press.
5. J. Hopcroft and J. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading, MA, 2 edition, 1979.
6. E. Moore. Gedanken experiments on sequential machines. In C. Shannon and J. McCarthy, editors, Automata Studies, 129-153, Princeton, NJ, 1956. Princeton University Press.
7. D. Perrin. Finite automata. In J. van Leeuwen, editor, Formal Models and Seman tics, volume B of Handbook of Theoretical Computer Science, 1-57. The MIT Press, Cambridge, MA, 1990.
8. L. Stockmeyer and A. Meyer. Word problems requiring exponential time. In Proceedings of the Fifth Annual ACM Symposium on Theory of Computing, 1-9, 1973.
9. D. Wood. Theory of Computation. John Wiley & Sons, Inc., New York, NY, 1987.