Time-bounded controlled bidirectional grammars

References

• Aho , A.V. and Ullman , J.D. 1972 . The Theory of Parsing , Vol. I , Englewood Cliffs, N.J : Prentice-Hall . Translations and Compiling—Parsing
   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. and Van Leeuwen , J. Vol. 85 , 109 – 118 . Berlin : Springer-Verlag . Lect. Notes Comp. Sci., Heidelberg-New York
   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 Sci , 5 : 397 – 429 .
   Google Scholar
• Book , R.V. 1987 . Thue systems as rewriting systems . J. Symb. Comp , 3 : 39 – 68 .
   Web of Science ®Google Scholar
• Gladkii , A.V. 1964 . On the complexity of derivations in phrase-structure grammar . Algebri i Logika Sem , 3 ( 5-6 ) : 29 – 44 . in Russian
   Google Scholar
• Harrison , M.A. 1978 . Introduction to Formal Language Theory , Reading, MA : 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. 1988 . Controlled rewriting using productions and reductions . Proceedings of ’;Computer Science in the Netherlands—‘ . 1988 . pp. 479 – 494 .
   Google Scholar
• McNaughton , R. , Narendran , P. and Otto , F. 1988 . Church-Rosser Thue systems and formal languages . J. Assoc. Comput. Mach , 35 : 324 – 344 .
   Web of Science ®Google Scholar
• Salomaa , A. 1973 . Formal Languages , New York : Academic Press .
   Google Scholar
• Sudkamp , T.A. 1988 . Languages and Machines—An Introduction to the Theory of Computer Science , Reading, MA : Addison-Wesley .
   Google Scholar