R. Alur, M. Arenas, P. Barceló, K. Etessami, N. Immerman & L. Libkin (2008):
First-Order and Temporal Logics for Nested Words.
Logical Methods in Computer Science 4(4),
doi:10.2168/LMCS-4(4:11)2008.
R. Alur, S. Chaudhuri & P. Madhusudan (2011):
Software model checking using languages of nested trees.
ACM Trans. Program. Lang. Syst. 33(5),
pp. 15:1–15:45,
doi:10.1145/2039346.2039347.
R. Alur & D. L. Dill (1994):
A Theory of Timed Automata.
Theor. Comput. Sci. 126(2),
pp. 183–235,
doi:10.1016/0304-3975(94)90010-8.
R. Alur & P. Madhusudan (2009):
Adding nesting structure to words.
JACM 56(3),
doi:10.1145/1516512.1516518.
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.
A. Bouajjani, J. Esparza & O. Maler (1997):
Reachability analysis of pushdown automata: Application to model-checking.
In: CONCUR '97: Concurrency Theory.
Springer Berlin Heidelberg,
Berlin, Heidelberg,
pp. 135–150,
doi:10.1007/3-540-63141-0_10.
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,
doi:10.1007/3-540-12689-9_92.
J. R. Büchi (1960):
Weak Second-Order Arithmetic and Finite Automata.
Mathematical Logic Quarterly 6(1-6),
pp. 66–92,
doi:10.1002/malq.19600060105.
O. Burkart & B. Steffen (1992):
Model checking for context-free processes.
In: CONCUR '92,
LNCS 630.
Springer Berlin Heidelberg,
pp. 123–137,
doi:10.1007/BFb0084787.
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.
E. A. Emerson (1990):
Temporal and Modal Logic.
In: Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B).
Elsevier,
pp. 995–1072,
doi:10.1016/B978-0-444-88074-1.50021-4.
R. W. Floyd (1963):
Syntactic Analysis and Operator Precedence.
JACM 10(3),
pp. 316–333,
doi:10.1145/321172.321179.
M. Frick & M. Grohe (2004):
The complexity of first-order and monadic second-order logic revisited.
Ann. Pure Appl. Logic 130(1-3),
pp. 3–31,
doi:10.1016/j.apal.2004.01.007.
D. Grune & C. J. Jacobs (2008):
Parsing techniques: a practical guide.
Springer,
New York,
doi:10.1007/978-0-387-68954-8.
C. Lautemann, T. Schwentick & D. Thérien (1994):
Logics For Context-Free Languages.
In: Computer Science Logic, 8th International Workshop, CSL '94,
pp. 205–216,
doi:10.1007/BFb0022257.
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.
D. Mandrioli & M. Pradella (2018):
Generalizing input-driven languages: Theoretical and practical benefits.
Computer Science Review 27,
pp. 61–87,
doi:10.1016/j.cosrev.2017.12.001.
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.
J. Thatcher (1967):
Characterizing derivation trees of context-free grammars through a generalization of finite automata theory.
Journ. of Comp. and Syst.Sc. 1,
pp. 317–322,
doi:10.1016/S0022-0000(67)80022-9.
I. Walukiewicz (2001):
Pushdown Processes: Games and Model-Checking.
Information and Computation 164(2),
pp. 234–263,
doi:10.1006/inco.2000.2894.
P. Wolper, M. Y. Vardi & A. P. Sistla (1983):
Reasoning about infinite computation paths.
In: 24th Annual Symposium on Foundations of Computer Science SFCS,
pp. 185–194,
doi:10.1109/SFCS.1983.51.
eptcs@eptcs.org