R. Alur & P. Madhusudan (2009):
Adding nesting structure to words.
JACM 56(3),
doi:10.1145/1516512.1516518.
D. Angluin & C. H. Smith (1983):
Inductive Inference: Theory and Methods.
ACM Comput. Surv. 15(3),
pp. 237–269,
doi:10.1145/356914.356918.
A. Barenghi, S. Crespi Reghizzi, D. Mandrioli, F. Panella & M. Pradella (2015):
Parallel parsing made practical.
Sci. Comput. Program. 112,
pp. 195–226,
doi:10.1016/j.scico.2015.09.002.
B. von Braunmühl & R. Verbeek (1983):
Input-driven languages are recognized in log n space.
In: Proc. of the Symp. on Fundamentals of Computation Theory, LNCS 158.
Springer,
pp. 40–51.
P. Caron (2000):
Families of locally testable languages.
Theor. Comput. Sci. 242(1-2),
pp. 361–376,
doi:10.1016/S0304-3975(98)00332-6.
S. Crespi Reghizzi, G. Guida & D. Mandrioli (1981):
Operator Precedence Grammars and the Noncounting Property.
SIAM J. Computing 10,
pp. 174—191,
doi:10.1137/0210013.
S. Crespi Reghizzi, V. Lonati, D. Mandrioli & M. Pradella (2017):
Toward a theory of input-driven locally parsable languages.
Theor. Comput. Sci. 658,
pp. 105–121,
doi:10.1016/j.tcs.2016.05.003.
S. Crespi Reghizzi & D. Mandrioli (2012):
Operator Precedence and the Visibly Pushdown Property.
JCSS 78(6),
pp. 1837–1867,
doi:10.1016/j.jcss.2011.12.006.
S. Crespi Reghizzi, D. Mandrioli & D. F. Martin (1978):
Algebraic Properties of Operator Precedence Languages.
Information and Control 37(2),
pp. 115–133,
doi:10.1016/S0019-9958(78)90474-6.
S. Crespi Reghizzi, M. A. Melkanoff & L. Lichten (1973):
The Use of Grammatical Inference for Designing Programming Languages.
Commun. ACM 16(2),
pp. 83–90,
doi:10.1145/361952.361958.
R. W. Floyd (1963):
Syntactic Analysis and Operator Precedence.
JACM 10(3),
pp. 316–333,
doi:10.1145/321172.321179.
R. W. Floyd (1964):
Bounded context syntactic analysis.
Commun. ACM 7(2),
pp. 62–67,
doi:10.1145/363921.363927.
D. Grune & C. J. Jacobs (2008):
Parsing techniques: a practical guide.
Springer,
New York,
doi:10.1007/978-0-387-68954-8.
M. A. Harrison (1978):
Introduction to Formal Language Theory.
Addison Wesley.
D. Knuth (1967):
A characterization of parenthesis languages.
Information and Control 11,
pp. 269–289,
doi:10.1016/S0019-9958(67)90564-5.
M. Kutrib, A. Malcher & M. Wendlandt (2015):
Tinput-Driven Pushdown Automata.
In: J. Durand-Lose & B. Nagy: Machines, Computations, and Universality - 7th International Conference, MCU 2015,
LNCS 9288.
Springer,
pp. 94–112,
doi:10.1007/978-3-319-23111-2_7.
V. Lonati, D. Mandrioli, F. Panella & M. Pradella (2015):
Operator Precedence Languages: Their Automata-Theoretic and Logic Characterization.
SIAM J. Comput. 44(4),
pp. 1026–1088,
doi:10.1137/140978818.
F. M. Luque & G. G. Infante López (2010):
PAC-Learning Unambiguous k, l-NTS^\voidb@x = Languages.
In: Grammatical Inference: Theoretical Results and Applications, 10th International Colloquium, ICGI 2010, Valencia, Spain, September 13-16, 2010. Proceedings,
pp. 122–134.
R. McNaughton (1967):
Parenthesis Grammars.
JACM 14(3),
pp. 490–500,
doi:10.1145/321406.321411.
R. McNaughton & S. Papert (1971):
Counter-free Automata.
MIT Press, Cambridge, USA.
K. Mehlhorn (1980):
Pebbling Mountain Ranges and its Application of DCFL-Recognition.
In: Automata, languages and programming (ICALP-80),
LNCS 85,
pp. 422–435,
doi:10.1007/3-540-10003-2_89.
R. Yoshinaka (2008):
Identification in the Limit of k, l-Substitutable Context-Free Languages.
In: A. Clark, F. Coste & L. Miclet: Grammatical Inference: Algorithms and Applications, 9th International Colloquium, ICGI 2008,
LNCS 5278.
Springer,
pp. 266–279,
doi:10.1007/978-3-540-88009-7_21.
eptcs@eptcs.org