Pages that link to "Item:Q3477972"
From MaRDI portal
The following pages link to Constructions for alternating finite automata<sup>∗</sup> (Q3477972):
Displaying 17 items.
- Descriptional and computational complexity of finite automata -- a survey (Q553312) (← links)
- Distributed XML design (Q657904) (← links)
- The state complexities of some basic operations on regular languages (Q1318694) (← links)
- Alternating finite automata and star-free languages (Q1575674) (← links)
- Efficient implementation of regular languages using reversed alternating finite automata (Q1575901) (← links)
- Implementing automata. Selected papers from the 2nd international workshop, WIA '97, Univ. of Western Ontario, London, Ontario, Canada, September 18--20, 1997 (Q1586200) (← links)
- Alternation in two-way finite automata (Q2029487) (← links)
- Descriptional complexity of regular languages (Q2074214) (← links)
- Descriptional and Computational Complexity of Finite Automata (Q3618565) (← links)
- Domain mu-calculus (Q4460689) (← links)
- Equations and regular-like expressions for afa (Q4839734) (← links)
- Square on Deterministic, Alternating, and Boolean Finite Automata (Q5205045) (← links)
- The complexity of concatenation on deterministic and alternating finite automata (Q5223613) (← links)
- Descriptional Complexity of the Forever Operator (Q5384434) (← links)
- Linear Parsing Expression Grammars (Q5739004) (← links)
- The Ranges of Accepting State Complexities of Languages Resulting from Some Operations (Q5859667) (← links)
- Operations on Boolean and Alternating Finite Automata (Q6204121) (← links)
