On the generating power of regularly controlled bidirectional grammars

References

• Asveld , P.R.J. 1986 . Complete symmetry in D2L systems and cellular automata . Internat. J. Comput. Math , 19 : 211 – 223 .
   Web of Science ®Google Scholar
• Baker , B.S. and Book , R.V. 1974 . Reversal-bounded multipushdown machines . J. Comput. System. Sci , 8 : 315 – 332 .
   Google Scholar
• Boasson , L. . 7th International Colloquium on Automata, Languages and Programming . Edited by: de Bakker , J.W. and van Leeuwen , J. Vol. 85 , 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
• Book , R.V. 1971 . Time-bounded grammars and their languages . J. Comput. System. Sc , 5 : 397 – 429 .
   Google Scholar
• Book , R.V. 1978 . Simple representation of certain classes of languages . J. Assoc. Comput. Mach , 25 : 23 – 31 .
   Google Scholar
• Book , R.V. 1981 . NTS grammars and Church-Rosser systems . Inform. Process. Lett , 13 : 73 – 76 .
   Google Scholar
• Culik II , K. 1979 . A purely homomorphic characterization of recursively enumerable sets . J. Assoc. Comput. Mach , 26 : 345 – 350 .
   Google Scholar
• Engelfriet , J. and Rozenberg , G. 1980 . Fixed point languages, equality languages, and representation of recursively enumerable languages . J. Assoc. Comput. Mach , 27 : 499 – 518 .
   Web of Science ®Google Scholar
• Gladkil , A.V. 1964 . On the complexity of derivations in phrase-structure grammar . Algebri i Logika Sem , 3 : 29 – 44 . in Russian
   Google Scholar
• Harrison , M.A. 1978 . Introduction to Formal Language Theory , Reading, Mass : Addison-Wesley .
   Google Scholar
• Hogendorp , J.A. 1989 . Controlled bidirectional grammars . Internat. J. Comput. Math , 27 : 159 – 180 .
   Web of Science ®Google Scholar
• Hogendorp , J.A. Controlled rewriting using productions and reductions . Proceeding of Computing Science in Netherlands—1988 . pp. 479 – 494 .
   Google Scholar
• Hogendorp , J.A. 1990 . Time-bounded controlled bidirectional grammars . Internat. J. Comput. Math , 35 : 93 – 115 .
   Web of Science ®Google Scholar
• Hogendorp , J.A. 1990 . “ Controlled Bidirectional Grammars ” . In Doctoral Dissertation , Enschede, , Netherlands : University of Twente . Department of Computer Science
   Google Scholar
• Hopcroft , J.E. and Ullman , J.D. 1979 . Introduction to Automata Theory, Languages, and Computation , Reading, Mass : Addison-Wesley .
   Google Scholar
• Kasai , T. 1970 . An hierarchy between context-free and context-sensitive languages . J. Comput. System Sci , 4 : 492 – 508 .
   Google Scholar
• Salomaa , A. 1973 . Formal Languages , New York : Academic Press .
   Google Scholar
• Savitch , W.J. 1973 . How to make arbitrary grammars look like context-free grammars . SIAM J. Comput , 2 : 174 – 182 .
   Google Scholar
• Sénizergues , G. 1985 . The equivalence and inclusion problems for NTS languages . J. Comput. System Sci , 31 : 303 – 331 .
   Google Scholar