@article(lmcs/AlurABEIL08,
 author       = {R.~Alur and M.~Arenas and P.~Barcel{\'o} and K.~Etessami and N.~Immerman and L.~Libkin},
 year         = {2008},
 title        = {First-Order and Temporal Logics for Nested Words},
 journal      = {Logical Methods in Computer Science},
 volume       = {4},
 number       = {4},
 doi          = {10.2168/LMCS-4(4:11)2008},
)
@article(DBLP:journals/toplas/AlurCM11,
 author       = {R.~Alur and S.~Chaudhuri and P.~Madhusudan},
 year         = {2011},
 title        = {Software model checking using languages of nested trees},
 journal      = {{ACM} Trans. Program. Lang. Syst.},
 volume       = {33},
 number       = {5},
 pages        = {15:1--15:45},
 doi          = {10.1145/2039346.2039347},
)
@article(AlurDill1994a,
 author       = {R.~Alur and D.~L. Dill},
 year         = {1994},
 title        = {{A Theory of Timed Automata}},
 journal      = {Theor. Comput. Sci.},
 volume       = {126},
 number       = {2},
 pages        = {183--235},
 doi          = {10.1016/0304-3975(94)90010-8},
)
@article(jacm/AlurM09,
 author       = {R.~Alur and P.~Madhusudan},
 year         = {2009},
 title        = {Adding nesting structure to words},
 journal      = {JACM},
 volume       = {56},
 number       = {3},
 doi          = {10.1145/1516512.1516518},
)
@article(BarenghiEtAl2015,
 author       = {A.~Barenghi and S.~{Crespi Reghizzi} and D.~Mandrioli and F.~Panella and M.~Pradella},
 year         = {2015},
 title        = {Parallel parsing made practical},
 journal      = {Sci. Comput. Program.},
 volume       = {112},
 pages        = {195--226},
 doi          = {10.1016/j.scico.2015.09.002},
)
@inproceedings(BouajjaniEM97,
 author       = {A.~Bouajjani and J.~Esparza and O.~Maler},
 year         = {1997},
 title        = {Reachability analysis of pushdown automata: Application to model-checking},
 booktitle    = {CONCUR '97: Concurrency Theory},
 publisher    = {Springer Berlin Heidelberg},
 address      = {Berlin, Heidelberg},
 pages        = {135--150},
 doi          = {10.1007/3-540-63141-0_10},
)
@inproceedings(Input-driven,
 author       = {B.~von Braunm\"uhl and R.~Verbeek},
 year         = {1983},
 title        = {Input-driven languages are recognized in log n space},
 booktitle    = {Proc. of the Symp. on Fundamentals of Computation Theory, LNCS 158},
 publisher    = {Springer},
 pages        = {40--51},
 doi          = {10.1007/3-540-12689-9_92},
)
@article(bib:Buchi1960a,
 author       = {J.~R. B\"{u}chi},
 year         = {1960},
 title        = {{Weak Second-Order Arithmetic and Finite Automata}},
 journal      = {Mathematical Logic Quarterly},
 volume       = {6},
 number       = {1-6},
 pages        = {66--92},
 doi          = {10.1002/malq.19600060105},
)
@incollection(BurkartSteffen1992a,
 author       = {O.~Burkart and B.~Steffen},
 year         = {1992},
 title        = {Model checking for context-free processes},
 booktitle    = {CONCUR '92},
 series       = {LNCS},
 volume       = {630},
 publisher    = {Springer Berlin Heidelberg},
 pages        = {123--137},
 doi          = {10.1007/BFb0084787},
)
@article(CrespiMandrioli12,
 author       = {S.~{Crespi Reghizzi} and D.~Mandrioli},
 year         = {2012},
 title        = {{Operator Precedence and the Visibly Pushdown Property}},
 journal      = {JCSS},
 volume       = {78},
 number       = {6},
 pages        = {1837--1867},
 doi          = {10.1016/j.jcss.2011.12.006},
)
@article(Crespi-ReghizziMM1978,
 author       = {S.~{Crespi Reghizzi} and D.~Mandrioli and D.~F. Martin},
 year         = {1978},
 title        = {{Algebraic Properties of Operator Precedence Languages}},
 journal      = {Information and Control},
 volume       = {37},
 number       = {2},
 pages        = {115--133},
 doi          = {10.1016/S0019-9958(78)90474-6},
)
@incollection(Emerson90,
 author       = {E.~A. Emerson},
 year         = {1990},
 title        = {Temporal and Modal Logic},
 booktitle    = {Handbook of Theoretical Computer Science, Volume {B:} Formal Models and Sematics {(B)}},
 publisher    = {Elsevier},
 pages        = {995--1072},
 doi          = {10.1016/B978-0-444-88074-1.50021-4},
)
@article(Floyd1963,
 author       = {R.~W. Floyd},
 year         = {1963},
 title        = {{Syntactic Analysis and Operator Precedence}},
 journal      = {JACM},
 volume       = {10},
 number       = {3},
 pages        = {316--333},
 doi          = {10.1145/321172.321179},
)
@article(DBLP:FrickG04,
 author       = {M.~Frick and M.~Grohe},
 year         = {2004},
 title        = {The complexity of first-order and monadic second-order logic revisited},
 journal      = {Ann. Pure Appl. Logic},
 volume       = {130},
 number       = {1-3},
 pages        = {3--31},
 doi          = {10.1016/j.apal.2004.01.007},
)
@book(GruneJacobs:08,
 author       = {D.~Grune and C.~J. Jacobs},
 year         = {2008},
 title        = {Parsing techniques: a practical guide},
 publisher    = {Springer},
 address      = {New York},
 doi          = {10.1007/978-0-387-68954-8},
)
@inproceedings(Lautemann94,
 author       = {C.~Lautemann and T.~Schwentick and D.~Th{\'{e}}rien},
 year         = {1994},
 title        = {Logics For Context-Free Languages},
 booktitle    = {Computer Science Logic, 8th International Workshop, {CSL} '94},
 pages        = {205--216},
 doi          = {10.1007/BFb0022257},
)
@article(LonatiEtAl2015,
 author       = {V.~Lonati and D.~Mandrioli and F.~Panella and M.~Pradella},
 year         = {2015},
 title        = {Operator Precedence Languages: Their Automata-Theoretic and Logic Characterization},
 journal      = {{SIAM} J. Comput.},
 volume       = {44},
 number       = {4},
 pages        = {1026--1088},
 doi          = {10.1137/140978818},
)
@article(MP18,
 author       = {D.~Mandrioli and M.~Pradella},
 year         = {2018},
 title        = {Generalizing input-driven languages: Theoretical and practical benefits},
 journal      = {Computer Science Review},
 volume       = {27},
 pages        = {61--87},
 doi          = {10.1016/j.cosrev.2017.12.001},
)
@article(McNaughton67,
 author       = {R.~McNaughton},
 year         = {1967},
 title        = {{Parenthesis Grammars}},
 journal      = {JACM},
 volume       = {14},
 number       = {3},
 pages        = {490--500},
 doi          = {10.1145/321406.321411},
)
@book(McNaughtonPapert71,
 author       = {R.~McNaughton and S.~Papert},
 year         = {1971},
 title        = {{Counter-free Automata}},
 publisher    = {{MIT} {P}ress, {C}ambridge, {USA}},
)
@article(Tha67,
 author       = {J.~Thatcher},
 year         = {1967},
 title        = {Characterizing derivation trees of context-free grammars through a generalization of finite automata theory},
 journal      = {Journ. of Comp. and Syst.Sc.},
 volume       = {1},
 pages        = {317--322},
 doi          = {10.1016/S0022-0000(67)80022-9},
)
@article(Walukiewicz2001,
 author       = {I.~Walukiewicz},
 year         = {2001},
 title        = {Pushdown Processes: Games and Model-Checking},
 journal      = {Information and Computation},
 volume       = {164},
 number       = {2},
 pages        = {234--263},
 doi          = {10.1006/inco.2000.2894},
)
@inproceedings(WolperVardiSistla1983,
 author       = {P.~Wolper and M.~Y. Vardi and A.~P. Sistla},
 year         = {1983},
 title        = {Reasoning about infinite computation paths},
 booktitle    = {24th Annual Symposium on Foundations of Computer Science {SFCS}},
 pages        = {185--194},
 doi          = {10.1109/SFCS.1983.51},
)