Mathematical Foundations of Computer Science 2005

DOI10.1007/11549345MaRDI QIDQ5492887zbMATH OpenOpenAlexFDO

Authors Tomasz Jurdziński, Friedrich Otto

Publication date 20 October 2006

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

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• SHRINKING RESTARTING AUTOMATA
• Restarting automata with restricted utilization of auxiliary symbols
• Restarting automata
• scientific article; zbMATH DE number 2040896
• Restarting Tree Automata

Cited in

(4)

• SHRINKING RESTARTING AUTOMATA
• Shrinking timed automata
• Restarting automata with restricted utilization of auxiliary symbols
• scientific article; zbMATH DE number 1836418 (Why is no real title available?)

This page was built for publication: Mathematical Foundations of Computer Science 2005

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