Rajeev Alur & P. Madhusudan (2009):
Adding nesting structure to words.
J. ACM 56,
pp. 16:1–16:43,
doi:10.1145/1516512.1516518.
Suna Bensch, Markus Holzer, Martin Kutrib & Andreas Malcher (2012):
Input-Driven Stack Automata.
In: Jos C. M. Baeten, Thomas Ball & Frank S. de Boer: Theoretical Computer Science (TCS 2012),
LNCS 7604.
Springer,
pp. 28–42,
doi:10.1007/978-3-642-33475-7_3.
Burchard von Braunmühl & Rutger Verbeek (1983):
Input-Driven Languages are Recognized in ologn Space.
In: Marek Karpinski: Fundamentals of Computation Theory (FCT 1983),
LNCS 158.
Springer,
pp. 40–51,
doi:10.1007/3-540-12689-9_92.
Gerhard Buntrock & Friedrich Otto (1998):
Growing Context-Sensitive Languages and Church-Rosser Languages.
Inform. Comput. 141(1),
pp. 1–36,
doi:10.1006/inco.1997.2681.
Patrick W. Dymond (1988):
Input-Driven Languages are in ologn Depth.
Inform. Process. Lett. 26,
pp. 247–250,
doi:10.1016/0020-0190(88)90148-2.
Michael A. Harrison & Oscar H. Ibarra (1968):
Multi-Tape and Multi-Head Pushdown Automata.
Inform. Control 13,
pp. 433–470,
doi:10.1016/S0019-9958(68)90901-7.
John E. Hopcroft & Jeffrey D. Ullman (1979):
Introduction to Automata Theory, Languages, and Computation.
Addison-Wesley,
Reading, Massachusetts.
Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano & Matthias Wendlandt (2015):
Deterministic Input-Driven Queue Automata: Finite Turns, Decidability, and Closure Properties.
Theoret. Comput. Sci. 578,
pp. 58–71,
doi:10.1016/j.tcs.2015.01.012.
Robert McNaughton, Paliath Narendran & Friedrich Otto (1988):
Church-Rosser Thue Systems and Formal Languages.
J. ACM 35,
pp. 324–344,
doi:10.1145/42282.42284.
Kurt Mehlhorn (1980):
Pebbling Moutain Ranges and its Application of DCFL-Recognition.
In: J. W. de Bakker & Jan van Leeuwen: International Colloquium on Automata, Languages and Programming (ICALP 1980),
LNCS 85.
Springer,
pp. 422–435,
doi:10.1007/3-540-10003-2_89.
Benedek Nagy (2012):
A class of 2-head finite automata for linear languages.
Triangle 8, (Languages, Mathematical Approaches),
pp. 89–99.
Benedek Nagy (2015):
A family of two-head pushdown automata.
In: Rudolf Freund, Markus Holzer, Nelma Moreira & Rogério Reis: Non-Classical Models of Automata and Applications (NCMA 2015),
books@ocg.at 318.
Austrian Computer Society,
Vienna,
pp. 177–191.
G. Niemann & F. Otto (2005):
The Church-Rosser languages are the deterministic variants of the growing context-sensitive languages.
Inform. Comput. 197,
pp. 1–21,
doi:10.1016/j.ic.2004.09.003.
Arnold L. Rosenberg (1967):
A Machine Realization of the Linear Context-Free Languages.
Inform. Control 10,
pp. 175–188,
doi:10.1016/S0019-9958(67)80006-8.
eptcs@eptcs.org