Alternating finite automata and star-free languages
From MaRDI portal
Publication:1575674
DOI10.1016/S0304-3975(98)00047-4zbMath0944.68090MaRDI QIDQ1575674
Publication date: 21 August 2000
Published in: Theoretical Computer Science (Search for Journal in Brave)
68Q45: Formal languages and automata
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On equations for regular languages, finite automata, and sequential networks
- Succinct representation of regular languages by Boolean automata. II
- Succinct representation of regular languages by Boolean automata
- On communication-bounded synchronized alternating finite automata
- Constructions for alternating finite automata∗
- Alternation
- ON THE POWER OF ONE-WAY SYNCHRONIZED ALTERNATING MACHINES WITH SMALL SPACE
- On the power of bounded concurrency I
- On finite monoids having only trivial subgroups
- A Note on Star-Free Events
- Derivatives of Regular Expressions