Closure properties of linear context-free tree languages with an application to optimality theory
From MaRDI portal
Publication:2368942
DOI10.1016/j.tcs.2005.11.024zbMath1088.68081OpenAlexW1971051128MaRDI QIDQ2368942
Publication date: 28 April 2006
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2005.11.024
Related Items (7)
The generative power of delegation networks ⋮ Regular Approximation of Weighted Linear Context-Free Tree Languages ⋮ The equivalence of tree adjoining grammars and monadic linear context-free tree grammars ⋮ Restarting Tree Automata and Linear Context-Free Tree Languages ⋮ Second-order abstract categorial grammars as hyperedge replacement grammars ⋮ Linear context-free tree languages and inverse homomorphisms ⋮ The Pumping Lemma for Well-Nested Multiple Context-Free Languages
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Macro tree transducers
- A generalized approach to formal languages
- IO and OI. I
- IO and OI. II
- Some notes on the formal properties of bidirectional optimality theory
- An operational and denotational approach to non-context-freeness
- Tree acceptors and some of their applications
- Bottom-up and top-down tree transformations— a comparison
- 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.
- Generalized finite automata theory with an application to a decision problem of second-order logic
- Mappings and grammars on trees
- Descriptions of cross-serial dependencies
This page was built for publication: Closure properties of linear context-free tree languages with an application to optimality theory
