An Automata Theoretic Approach to Rational Tree Relations

DOI10.1007/978-3-540-77566-9_37zbMath1133.68040OpenAlexW2112661970MaRDI QIDQ5448669

Frank G. Radmacher

Publication date: 7 March 2008

Published in: SOFSEM 2008: Theory and Practice of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-77566-9_37

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

Tree Transformations and Dependencies ⋮ Multiple context-free tree grammars: lexicalization and characterization

Cites Work

• Rational tree relations
• Modelization of deterministic rational relations
• Finite presentations of infinite structures: Automata and interpretations
• On the representation of finite deterministic 2-tape automata
• Multitape one-way nonwriting automata
• Decision problems among the main subfamilies of rational relations
• Foundations of Software Science and Computation Structures
• Fundamentals of Computation Theory
• On Relations Defined by Generalized Finite Automata
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An Automata Theoretic Approach to Rational Tree Relations