The state complexity of alternating automata

DOI10.1145/3209108.3209167MaRDI QIDQ5145316zbMATH OpenOpenAlexWikidataFDO

Authors 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

alternating automataautomata theoryhierarchy theoremlower boundsprime numbersstate complexity

Mathematics Subject Classification ID

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

Recommendations

• Lower bounds for the state complexity of probabilistic languages and the language of prime numbers
• An alternating hierarchy for finite automata
• Descriptional complexity of h-alternating finite automata
• The complexity of concatenation on deterministic and alternating finite automata
• On emptiness and counting for alternating finite automata

Cited in

(6)

• State complexity of reversals of deterministic finite automata with output
• State complexity of the set of synchronizing words for circular automata and automata over binary alphabets
• Notes on counting with finite machines
• scientific article; zbMATH DE number 3999320 (Why is no real title available?)
• Lower bounds for the state complexity of probabilistic languages and the language of prime numbers
• The complexity of concatenation on deterministic and alternating finite automata

This page was built for publication: The state complexity of alternating automata

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