Refining the nonterminal complexity of graph-controlled grammars

7th International Workshop on Descriptional Complexity of Formal Systems, DCFS 2005 - Proceedings

Volumn , Issue , 2005, Pages 110-121

  Fernau, Henning ^a,b   Freund, Rudolf ^c   Oswald, Marion ^c   Reinhardt, Klaus ^a  

^a UNIVERSITY OF TÜBINGEN   (Germany)

^b NEWCASTLE UNIVERSITY   (United Kingdom)

^c UNIVERSITY OF VIENNA   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

DISPERSION COMPENSATION;

ARBITRARY NUMBER; COMPUTATIONAL COMPLETENESS; MATRIX GRAMMARS; NON-TERMINAL SYMBOLS; RECURSIVELY ENUMERABLE LANGUAGES; UNARY LANGUAGES;

MATRIX ALGEBRA;

EID: 84876521124     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)

1. J. Dassow and Gh. Paun. Further remarks on the complexity of regulated rewriting. Kybernetika, 21, pp. 213-227.
2. J. Dassow and Gh. Paun. Regulated Rewriting in Formal Language Theory. Volume 18 of EATCS Monographs in Theoretical Computer Science. Springer, 1989.
3. H. Fernau. Graph-controlled grammars as language acceptors. Journal of Automata, Lan-guages and Combinatorics, 2 (2) (1997), pp. 79-91.
4. H. Fernau. Unconditional transfer in regulated rewriting. Acta Informatica, 3 (1997), pp. 837-857.
5. H. Fernau. Nonterminal complexity of programmed grammars. In: M. Margenstern and Y. Ro- gozhin (editors): Machines, Computations, and Universality; 3rd MCU. Lecture Notes in Computer Science 2055, Springer, 2001, pp. 202-213.
6. H. Fernau. Nonterminal complexity of programmed grammars. Theoretical Computer Science, 296 (2003), pp. 225-251.
7. R. Ereund. Asynchronous P systems on arrays and strings. In: C. Calude, E. Calude, M. Dinneen (editors): Developments in Language Theory, 8th International Conference, DLT 2004. Lecture Notes in Computer Science 3340, Springer, 2005, pp. 188-199.
8. R. Freund and Gh. Paun. On the number of non-terminal symbols in graph-controlled, pro-grammed and matrix grammars. In: M. Margenstern and Y. Rogozhin (editors). Machines, Computations, and Universality. 3rd MCU. Lecture Notes in Computer Science 2055, Springer, 2001, pp. 214-225.
9. R. Freund and Gh. Paun. From regulated rewriting to computing with membranes: collapsing hierarchies. Theoretical Computer Science 312 (2004), pp. 143-188.
10. D. Hauschildt and M. Jantzen. Petri net algorithms in the theory of matrix grammars. Acta Informatica, 31 (1994), pp. 719-728.
11. M. L. Minsky. Computation: Finite and Infinite Machines. Prentice Hall, 1971.
12. Gh. Paun. Six nonterminals are enough for generating each r.e. language by a matrix grammar. International Journal of Computer Mathematics, 15 (1984), pp. 23-37.
13. K. Reinhardt. Counting as Method, Model and Task in Theoretical Computer Science. Habilitationsschrift, Universitat Tubingen, 2005.
14. G. Rozenberg and A. K. Salomaa. Context-free grammars with graph-controlled tables. JCSS, 13 (1976), pp. 90-99.