Finite automata and non-self-embedding grammars

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2608, Issue , 2003, Pages 47-56

  Anselmo, Marcella ^a   Giammarresi, Dora ^b   Varricchio, Stefano ^b  

^a UNIVERSITY OF SALERNO   (Italy)

^b UNIVERSITY OF ROME TOR VERGATA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

EMBEDDINGS; FINITE AUTOMATA; ROBOTS;

CLASSICAL REPRESENTATION; POLYNOMIAL ALGORITHM; PUSH-DOWN AUTOMATA; RATIONAL OPERATION; REGULAR GRAMMAR; REGULAR SETS; SELF EMBEDDING;

CONTEXT FREE GRAMMARS;

EID: 35248869775     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44977-9_4     Document Type: Article

References (4)

1. M. Anselmo, D. Giammarresi, S. Varicchio. Non-Self-Embedding Grammars as representation for Regular Languages. Full paper available at www.mat.uniroma2.it/∼giammarr/Papers/nse.ps
2. N. Chomsky. A note on phrase-structure grammars, Information and Control. Vol 2, pp. 393-395, 1959b.
3. M. A. Harrison. Introduction to Formal Language Theory. Addison-Wesley, Reading, MA, 1978.
4. J. E. Hopcroft, R. Motwani and J. D. Ullman. Introduction to Automata Theory, Languages and Computation - 2nd Edition. Addison-Wesley, 2001.