Some more on the finite automata

Journal of Applied Mathematics and Computing

Volumn 5, Issue 3, 1998, Pages 495-505

  Melnikov, B F ^a   Vakhitova, A A ^b  

^a ULYANOVSK STATE UNIVERSITY   (Russian Federation)

^b Department of Applied Mathematics Branch of Simbirsk Polytekhnik University   (Russian Federation)

Author keywords

Finite automata; Star height problem

Indexed keywords

FORMAL LANGUAGES; STARS;

KLEENE'S THEOREM; REGULAR EXPRESSIONS; STAR HEIGHT; STAR HEIGHT PROBLEM;

FINITE AUTOMATA;

EID: 0346658209     PISSN: 15985865     EISSN: None     Source Type: Journal    
DOI: 10.1007/bf03008877     Document Type: Article

References (8)

1. A. V. Aho, R. Sethi and J. D. Ullman. Compilers: principles, techniques and tools, N. J., Addison-Wesley, 1985.
2. A. Aho and J. Ullman. The theory of parsing, translation and compiling. V. 1: Parsing, N. J., Prentice-Hall, Inc., Englewod Cliffs, 1972.
3. W. Brauer. Automatentheorie. Eine Einführung in die Theorie endlicher Automaten, B. G.Teubner Stuttgart, 1984.
4. K. Hashiguchi : Algorithms for determining relative star height and star height. - Inform. Comput., 78 (1987) 124-169.
5. B. Melnikov. On the classification of sequential context-free languages and grammars, Vestnik Moskovskogo Universiteta, ser. 15, Vol. 3 (1993) 64-69 (in Russian).
6. D.Perrin. Finite Automata. Handbook of Theoret. Comput. Sci., Elsevier Sci. Publ., 1990.
7. Salomaa. Jewels of the formal languages theory, 1979.
8. N. Wirth. Algorithmes + data structures = programs, 1979.