Mathematical Foundations of Computer Science 2005

DOI10.1007/11549345zbMATH Open1156.68455OpenAlexW2494705596MaRDI QIDQ5492887FDOQ5492887

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

Recommendations

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

Mathematics Subject Classification ID

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

Cited In (4)

• SHRINKING RESTARTING AUTOMATA
• Shrinking timed automata
• Restarting automata with restricted utilization of auxiliary symbols
• Title not available (Why is that?)

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)