Tree automata and term rewrite systems

DOI10.1007/10721975_2MaRDI QIDQ2723888zbMATH OpenFDO

Authors Sophie Tison

Publication date 8 July 2001

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/10721975_2

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Formal languages and automata (68Q45)

Recommendations

• Tree automata, (dis-)equality constraints and term rewriting. What's new?
• Basics on tree automata
• Regulated tree automata
• scientific article; zbMATH DE number 3854429
• Tree automata for rewrite strategies

Cited in

(13)

• Regulated tree automata
• \texttt{Autowrite}: a tool for term rewrite systems and tree automata
• Modular tree automata
• Tree automata, (dis-)equality constraints and term rewriting. What's new?
• Construction of Tree Automata from Regular Expressions
• Rigid Tree Automata
• scientific article; zbMATH DE number 18637 (Why is no real title available?)
• scientific article; zbMATH DE number 1051240 (Why is no real title available?)
• Symbolic tree automata
• Bottom-Up Tree Automata with Term Constraints
• On the connections between rewriting and formal language theory,
• Proceedings of the 2nd international workshop on trends in tree automata and tree transducers, TTATT'13, Hanoi, Vietnam, October 19, 2013
• Deleting string rewriting systems preserve regularity

This page was built for publication: Tree automata and term rewrite systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2723888)