Descriptions of cross-serial dependencies

DOI10.1023/A:1009992722773zbMath0970.68091OpenAlexW1499263147MaRDI QIDQ5931128

Uwe Mönnich, Hans-Peter Kolb, Frank Morawietz

Publication date: 6 May 2001

Published in: Grammars (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1009992722773

zbMATH Keywords

monadic second-orderMSO logicregular string languagesregular tree languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (3)

A Model-Theoretic Description of Tree Adjoining Grammars1 1The research presented in this paper was supported by the Deutsche Forschungsgemeinschaft within the Sonderforschungsbereich 441, TP A2. The authors wish to thank Jens Michaelis and Stephan Kepser for helpful comments. ⋮ Closure properties of linear context-free tree languages with an application to optimality theory ⋮ An operational and denotational approach to non-context-freeness

This page was built for publication: Descriptions of cross-serial dependencies