Transition Function Complexity of Finite Automata

DOI10.1007/978-3-642-22600-7_24zbMath1341.68113OpenAlexW1042345658MaRDI QIDQ5200100

Māris Valdats

Publication date: 29 July 2011

Published in: Descriptional Complexity of Formal Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-22600-7_24

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• The average-case parallel complexity of sorting
• STACS 2005
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Transition Function Complexity of Finite Automata