Restarting Tree Automata

DOI10.1007/978-3-540-69507-3_44MaRDI QIDQ5448801zbMATH OpenOpenAlexFDO

Authors Heiko Stamer, Friedrich Otto

Publication date 7 March 2008

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

Full work available at URL https://doi.org/10.1007/978-3-540-69507-3_44

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Restarting Tree Automata and Linear Context-Free Tree Languages
• Restarting automata
• Single-Path Restarting Tree Automata
• scientific article; zbMATH DE number 2040896
• Tree automata
• scientific article; zbMATH DE number 3854429
• Clearing restarting automata
• Tree automata for rewrite strategies
• scientific article; zbMATH DE number 1836418
• On special forms of restarting automata

Cited in

(10)

• Weighted restarting automata
• Clearing restarting automata
• SHRINKING RESTARTING AUTOMATA
• Restarting Tree Automata and Linear Context-Free Tree Languages
• Restarting automata with structured output and functional generative description
• Single-Path Restarting Tree Automata
• scientific article; zbMATH DE number 2040896 (Why is no real title available?)
• Mathematical Foundations of Computer Science 2005
• A hierarchy of jumping restarting automata
• Restarting automata with restricted utilization of auxiliary symbols

This page was built for publication: Restarting Tree Automata

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