Descriptional Complexity of Operations on Alternating and Boolean Automata
From MaRDI portal
Publication:2907501
DOI10.1007/978-3-642-30642-6_19zbMath1360.68562OpenAlexW1748498014MaRDI QIDQ2907501
Publication date: 10 September 2012
Published in: Computer Science – Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-30642-6_19
Related Items (6)
Operations on Boolean and Alternating Finite Automata ⋮ Descriptional Complexity of the Forever Operator ⋮ Alternation in two-way finite automata ⋮ Square on Deterministic, Alternating, and Boolean Finite Automata ⋮ The complexity of concatenation on deterministic and alternating finite automata ⋮ Descriptional complexity of regular languages
This page was built for publication: Descriptional Complexity of Operations on Alternating and Boolean Automata
