The State Complexity of Alternating Automata

DOI10.1145/3209108.3209167zbMath1497.68262OpenAlexW2798603509MaRDI QIDQ5145316

Nathanaël Fijalkow

Publication date: 20 January 2021

Published in: Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3209108.3209167

zbMATH Keywords

automata theorylower boundsstate complexityprime numbersalternating automatahierarchy theorem

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Primes (11A41)

This page was built for publication: The State Complexity of Alternating Automata