On the number of non-terminal symbols in graph-controlled, programmed and matrix grammars

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

Volumn 2055 LNCS, Issue , 2001, Pages 214-225

  Freund, Rudolf ^a   Pǎun, Gheorghe ^b  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

^b ACADEMY OF ROMANIAN SCIENTISTS   (Romania)

Author keywords

[No Author keywords available]

Indexed keywords

MICROCONTROLLERS;

MATRIX GRAMMARS; NON-TERMINAL SYMBOLS; RECURSIVELY ENUMERABLE LANGUAGES;

MATRIX ALGEBRA;

EID: 84898882516     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45132-3_14     Document Type: Conference Paper

References (9)

1. C. Calude and Gh. Pǎun. Computing with Cells and Atoms. Taylor and Francis, London, 2000.
2. J. Dassow and Gh. Pǎun. Regulated Rewriting in Formal Language Theory. Springer-Verlag, Berlin, 1989.
3. H. Fernau. Nonterminal complexity of programmed grammars. This volume.
4. R. Freund and Gh. Pǎun. Computing with Membranes: Three More Collapsing Hierarchies. Submitted, 2000
5. rd, 2000).
6. M. L. Minsky. Computation: Finite and Infinite Machines. Prentice Hall, Englewood Cliffs, New Jersey, USA.
7. Gh. Pǎun. Six Nonterminals are Enough for Generating Each R. E. Language by a Matrix Grammar. Intern. J. Computer Math. 15(1984), pp. 23-37.
8. Gh. Pǎun. Computing with Membranes. Journal of Computer and System Sciences 1, 1(2000), pp. 108-143.
9. G. Rozenberg and A. Salomaa (eds.). Handbook of Formal Languages, 3 volumes. Springer-Verlag, Berlin, 1997.