Operations on Boolean and Alternating Finite Automata
From MaRDI portal
Publication:6204121
DOI10.4204/eptcs.386.1arXiv2309.02748MaRDI QIDQ6204121
Publication date: 9 April 2024
Published in: Electronic Proceedings in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2309.02748
Cites Work
- Unnamed Item
- Reversal of binary regular languages
- On equations for regular languages, finite automata, and sequential networks
- Succinct representation of regular languages by Boolean automata
- Operations on Boolean and alternating finite automata
- Power, positive closure, and quotients on convex languages
- Descriptional Complexity of Operations on Alternating and Boolean Automata
- Kleene closure and state complexity
- Constructions for alternating finite automata∗
- Alternation
- Square on Deterministic, Alternating, and Boolean Finite Automata
- The complexity of concatenation on deterministic and alternating finite automata
This page was built for publication: Operations on Boolean and Alternating Finite Automata
