Augmented transition networks and their relation to tree transducers

DOI10.1016/0020-0255(76)90006-2zbMath0358.68127OpenAlexW2001140451MaRDI QIDQ1238432

C. Raymond Perrault

Publication date: 1976

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0255(76)90006-2

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Pattern recognition, speech recognition (68T10)

Related Items

Intercalation lemmas for tree transducer languages, Augmented transition networks and their relation to tree transducers

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On derivation trees of indexed grammars - an extension of the uvwxy- theorem
• Tree adjunct grammars
• Intercalation lemmas for tree transducer languages
• Augmented transition networks and their relation to tree transducers
• Characterizing derivation trees of context-free grammars through a generalization of finite automata theory
• Properties of syntax directed translations
• Generalized sequential machine maps
• On the generative power of transformational grammars
• Bottom-up and top-down tree transformations— a comparison
• Indexed Grammars—An Extension of Context-Free Grammars
• Nested Stack Automata
• Mappings and grammars on trees
• Transition network grammars for natural language analysis
• A Formalization of Transition Diagram Systems
• Design of a separable transition-diagram compiler