Tree Transformations and Dependencies
From MaRDI portal
Publication:3172824
DOI10.1007/978-3-642-23211-4_1zbMath1348.68278MaRDI QIDQ3172824
Publication date: 7 October 2011
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-23211-4_1
68Q45: Formal languages and automata
68Q42: Grammars and rewriting systems
68T50: Natural language processing
Related Items
Look-ahead removal for total deterministic top-down tree transducers, Linking theorems for tree transducers, Decision Problems of Tree Transducers with Origin
Cites Work
- Modular tree transducers
- Compositions of extended top-down tree transducers
- Extended multi bottom-up tree transducers
- Macro tree transducers
- Attribute grammars and recursive program schemes. I. II
- Recognizable formal power series on trees
- Morphismes et bimorphismes d'arbres
- Rational tree relations
- Typechecking for XML transformers
- A comparison of tree transductions defined by monadic second order logic and by attribute grammars
- Macro tree transducers, attribute grammars, and MSO definable tree translations.
- A bottom-up characterization of deterministic top-down tree transducers with regular look-ahead
- Generalized sequential machine maps
- Linear deterministic multi bottom-up tree transducers
- Head-Driven Statistical Models for Natural Language Parsing
- Statistical Machine Translation
- The Power of Extended Top-Down Tree Transducers
- Macro Tree Translations of Linear Size Increase are MSO Definable
- Term Rewriting and All That
- An Automata Theoretic Approach to Rational Tree Relations
- Semantics of context-free languages
- Mappings and grammars on trees
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
