Controlled bidirectional grammars

References

• Asveld , P. R. J. 1977 . Controlled iteration grammars and full hyper-AFL's . Inform. and Contr. , 34 : 248 – 269 .
   Google Scholar
• Asveld , P. R. J. 1980 . Space-bounded complexity classes and iterated deterministic substitution . Inform. and Contr. , 44 : 282 – 299 .
   Google Scholar
• Asveld , P. R. J. and Engelfriet , J. 1977 . Iterated deterministic substitution . Acta Inform. , 8 : 285 – 302 .
   Google Scholar
• Asveld , P. R. J. and Van Leeuwen , J. 1975 . Infinite chains of hyper-AFL's , Enschede, , The Netherlands : Twente University of Technology . TW-memorandum No. 99
   Google Scholar
• Autebert , J. M. , Boasson , L. and Sénizergues , G. 1984 . Langages de parenthèses, langages N.T.S. et homomorphismes inverses . R.A.I.R.O. Inform. théor./Theor. Inform. , 18 : 327 – 344 .
   Google Scholar
• Boasson , L. 1980 . “ Dérivations et réductions dans les grammaires algébriques ” . In 7th International Colloquium on Automata Languages and Programming , Edited by: de Bakker , J. W. and van Leeuwen , J. Vol. 85 , 109 – 118 . Berlin, Heidelberg, New York : Springer-Verlag . Lect. Notes Comp. Sci.
   Google Scholar
• Boasson , L. and Sénizergues , G. 1985 . NTS languages are deterministic and congruential . J. Comput. System Sci. , 31 : 332 – 342 .
   Web of Science ®Google Scholar
• Frougny , Ch. 1981 . Simple deterministic NTS languages . Inform. Process. Lett. , 12 : 174 – 178 .
   Google Scholar
• Ginsburg , S. 1975 . Algebraic and Automata-Theoretic Properties of Formal Languages , Amsterdam : North-Holland .
   Google Scholar
• Ginsburg , S. and Spanier , E. H. 1968 . Control sets on grammars . Math. Systems Theory , 2 : 159 – 177 .
   Google Scholar
• Harrison , M. A. 1978 . Introduction to Formal Language Theory , Reading, MA : Addison-Wesley .
   Google Scholar
• Harrison , M. A. 1987 . Nonterminal separating macro grammars. In:Essays on Concepts, Formalisms, and Tools , Edited by: Asveld , P. R. J. and Nijholt , A. Vol. 42 , 77 – 87 . Amsterdam : Centre for Mathematics and Computer Science .
   Google Scholar
• Rosenkrantz , D. J. 1969 . Programmed grammars and classes of formal languages . J. Assoc. Comput. Mach. , 16 : 107 – 131 .
   Web of Science ®Google Scholar
• Salomaa , A. 1969 . On grammars with restricted use of productions . Ann. Acad. Sci. Fennicae Ser. AI. , 454
   Google Scholar
• Salomaa , A. 1970 . On some families of formal languages obtained by regulated derivations . Ann. Acad. Sci. Fennicae Ser. AI. , 479
   Google Scholar
• Salomaa , A. 1973 . Formal Languages , New York : Academic Press .
   Google Scholar
• Sénizergues , G. 1981 . A new class of C.F.L. for which the equivalence is decidable . Inform. Process. Lett. , 13 : 30 – 34 .
   Google Scholar
• Sénizergues , G. 1985 . The equivalence and inclusion problems for NTS languages . J. Comput. System Sci. , 31 : 303 – 331 .
   Google Scholar
• van Leeuwen J. Rule-labeled programs—A study of a generalization of context-free and some classes of formal languages Doctoral Dissertation University of Utrecht 1972
   Google Scholar