Regular Augmentation of Automata and Transducers (Extended Abstract)

[1]  Alfred V. Aho,et al.  The Theory of Parsing, Translation, and Compiling , 1972 .

[2]  Karel Culik,et al.  LR-Regular Grammars - an Extension of LR(k) Grammars , 1973, J. Comput. Syst. Sci..

[3]  Andrew Chi-Chih Yao,et al.  K + 1 heads are better than K , 1976, 17th Annual Symposium on Foundations of Computer Science (sfcs 1976).

[4]  Martin Plátek,et al.  A Scale of Context Sensitive Languages: Applications to Natural Language , 1978, Inf. Control..

[5]  Jeffrey D. Ullman,et al.  Formal languages and their relation to automata , 1969, Addison-Wesley series in computer science and information processing.

[6]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[7]  Burkhard Monien.  Two-Way Multihead Automata Over a One-Letter Alphabet , 1980, RAIRO Theor. Informatics Appl..

[8]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .