T.P. Baker (1981):
Extending lookahead for LR parsers.
JCSS 22(2),
pp. 243–259,
doi:10.1016/0022-0000(81)90030-1.
M.E. Bermudez & K.M. Schimpf (1990):
Practical arbitrary lookahead LR parsing.
JCSS 41(2),
pp. 230–250,
doi:10.1016/0022-0000(90)90037-l.
H. Burden & P. Ljunglöf (2005):
Parsing Linear Context-free Rewriting Systems.
In: Proc. of IWPT,
pp. 11–17.
E. Charniak, M. Pozar, T. Vu, M. Johnson, M. Elsner, J. Austerweil, D. Ellis, I. Haxton, C. Hill, R. Shrivaths & J. Moore (2006):
Multilevel coarse-to-fine PCFG parsing.
In: Proc. of NAACL HLT,
pp. 168–175,
doi:10.3115/1220835.1220857.
É. Villemonte de la Clergerie (2002):
Parsing Mildly Context-Sensitive Languages with Thread Automata.
In: Proc. of COLING,
pp. 1–7,
doi:10.3115/1072228.1072256.
A. van Cranenburgh (2012):
Efficient Parsing with Linear Context-free Rewriting Systems.
In: Proc. of EACL,
pp. 460–470.
T. Denkinger (2016):
An Automata Characterisation for Multiple Context-Free Languages.
In: Proc. of DLT,
pp. 138–150,
doi:10.1007/978-3-662-53132-7_12.
M. Droste & W. Kuich (2009):
Semirings and Formal Power Series.
In: Handbook of Weighted Automata.
Springer,
pp. 3–28,
doi:10.1007/978-3-642-01492-5_1.
S. Eilenberg (1974):
Automata, languages, and machines.
Academic Press.
J. Engelfriet (1986):
Context-free grammars with storage.
Technical Report I86-11.
Leiden University.
J. Engelfriet (2014):
Context-free grammars with storage.
CoRR.
J. Engelfriet & H. Vogler (1986):
Pushdown machines for the macro tree transducer.
TCS 42(3),
pp. 251–368,
doi:10.1016/0304-3975(86)90052-6.
E.G. Evans (1997):
Approximating context-free grammars with a finite-state calculus.
In: Proc. of EACL,
pp. 452–459,
doi:10.3115/979617.979675.
J. Goldstine (1979):
A rational theory of AFLs.
In: Automata, Languages and Programming.
Springer,
pp. 271–281,
doi:10.1007/3-540-09510-1_21.
L. Herrmann & H. Vogler (2015):
A Chomsky-Schützenberger Theorem for Weighted Automata with Storage.
In: Proc. of CAI,
pp. 90–102,
doi:10.1007/978-3-319-23021-4_11.
L. Herrmann & H. Vogler (2016):
Weighted Symbolic Automata with Data Storage.
In: Developments in Language Theory.
Springer,
pp. 203–215,
doi:10.1007/978-3-662-53132-7_17.
C.A.R. Hoare (1972):
Proof of correctness of data representations.
Acta Informatica 1(4),
doi:10.1007/bf00289507.
J.E. Hopcroft & J.D. Ullman (1979):
Introduction to Automata Theory, Languages and Computation.
Addison-Wesley.
L. Huang & D. Chiang (2005):
Better k-best Parsing.
In: Proc. of IWPT,
pp. 53–64.
M. Johnson (1998):
Finite-state approximation of constraint-based grammars using left-corner grammar transforms.
In: Proc. of COLING,
pp. 619–623,
doi:10.3115/980451.980948.
S. Krauwer & L. des Tombe (1981):
Transducers and Grammars as Theories of Language.
Theoretical Linguistics 8(1–3),
pp. 173–202,
doi:10.1515/thli.1981.8.1-3.173.
M. Kuhlmann & G. Satta (2009):
Treebank grammar techniques for non-projective dependency parsing.
In: Proc. of EACL,
pp. 478–486,
doi:10.3115/1609067.1609120.
D.T. Langendoen & Y. Langsam (1987):
On the design of finite transducers for parsing phrase-structure languages.
Mathematics of Language,
pp. 191–235,
doi:10.1075/z.35.11lan.
W. Maier (2010):
Direct Parsing of Discontinuous Constituents in German.
In: Proc. of NAACL HLT,
pp. 58–66.
M.-J. Nederhof (2000):
Practical experiments with regular approximation of context-free languages.
Computational Linguistics 26(1),
pp. 17–44,
doi:10.1162/089120100561610.
M.-J. Nederhof (2000):
Regular approximation of CFLs: a grammatical view.
In: Advances in Probabilistic and other Parsing Technologies.
Springer,
pp. 221–241,
doi:10.1007/978-94-015-9470-7_12.
M.-J. Nederhof (2017):
personal communication.
F.C.N. Pereira & R.N. Wright (1991):
Finite-state approximation of phrase structure grammars.
In: Proc. of ACL,
pp. 246–255,
doi:10.3115/981344.981376.
S.G. Pulman (1986):
Grammars, parsers, and memory limitations.
Language and Cognitive Processes 1(3),
pp. 197–225,
doi:10.1080/01690968608407061.
M.-P. Schützenberger (1962):
Certain elementary families of automata.
In: Proc. Symp. on Mathematical Theory of Automata,
pp. 139–153.
D. Scott (1967):
Some definitional suggestions for automata theory.
JCSS 1(2),
pp. 187–212,
doi:10.1016/s0022-0000(67)80014-x.
H. Seki, T. Matsumura, M. Fujii & T. Kasami (1991):
On multiple context-free grammars.
TCS 88(2),
pp. 191–229,
doi:10.1016/0304-3975(91)90374-B.
K. Vijay-Shanker, D.J. Weir & A.K. Joshi (1987):
Characterizing Structural Descriptions Produced by Various Grammatical Formalisms.
In: Proc. of ACL,
pp. 104–111,
doi:10.3115/981175.981190.
H. Vogler, M. Droste & L. Herrmann (2016):
A Weighted MSO Logic with Storage Behaviour and Its Büchi-Elgot-Trakhtenbrot Theorem.
In: Proc. of LATA,
pp. 127–139,
doi:10.1007/978-3-319-30000-9_10.
eptcs@eptcs.org