The generalization of generalized automata: Expression automata

Lecture Notes in Computer Science

Volumn 3317, Issue , 2005, Pages 156-166

  Han, Yo Sub ^a   Wood, Derick ^a  

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

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; CONTEXT FREE LANGUAGES; FORMAL LANGUAGES;

EXPRESSION AUTOMATA; GENERALIZED AUTOMATA; PREFIX-FREENESS;

AUTOMATA THEORY;

EID: 23944454840     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-30500-2_15     Document Type: Conference Paper

References (12)

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. J. Czyzowicz, W. Fraczak, A. Pelc, and W. Rytter. Linear-time prime decomposition of regular prefix codes. International Journal of Foundations of Computer Science, 14:1019-1032, 2003.
3. S. Eilenberg. Automata, Languages, and Machines, volume A. Academic Press, New York, NY, 1974.
4. D. Giammarresi and R. Montalbano. Deterministic generalized automata. Theoretical Comput. Sci., 215:191-208, 1999.
5. 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, pages 189-196, New York, NY, 1971. Academic Press.
6. J. Hopcroft and J. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading, MA, 2 edition, 1979.
7. A. Mateescu, A. Salomaa, and S. Yu. Factorizations of languages and commutativity conditions. Acta Cybernetica, 15(3):339-351, 2002.
8. E. Moore. Gedanken experiments on sequential machines. In C. Shannon and J. McCarthy, editors, Automata Studies, pages 129-153, Princeton, NJ, 1956. Princeton University Press.
9. D. Perrin. Finite automata. In J. van Leeuwen, editor, Formal Models and Semantics, volume B of Handbook of Theoretical Computer Science, pages 1-57. The MIT Press, Cambridge, MA, 1990.
10. A. Salomaa and S. Yu. On the decomposition of finite languages. In G. Rozenberg and W. Thomas, editors, Developments in Language Theory (DLT) 99, pages 22-31. World Scientific, 2000.
11. L. Stockmeyer and A. Meyer. Word problems requiring exponential time. In Proceedings of the Fifth Annual ACM Symposium on Theory of Computing, pages 1-9, 1973.
12. D. Wood. Theory of Computation. John Wiley &: Sons, Inc., New York, NY, 1987.