Finite Nondeterminism vs. DFAs with Multiple Initial States

DOI10.1007/978-3-642-39310-5_22zbMath1388.68178OpenAlexW198383578MaRDI QIDQ2843099

Selim G. Akl, Alexandros Palioudakis, Kai Salomaa

Publication date: 9 August 2013

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-39310-5_22

zbMATH Keywords

finite automatastate complexitylimited nondeterminismdeterministic automata with multiple initial states

Mathematics Subject Classification ID

Formal languages and automata (68Q45)