Pages that link to "Item:Q1068549"
From MaRDI portal
The following pages link to Succinct representation of regular languages by Boolean automata. II (Q1068549):
Displaying 8 items.
- Descriptional and computational complexity of finite automata -- a survey (Q553312) (← links)
- Alternating finite automata and star-free languages (Q1575674) (← links)
- Alternation in two-way finite automata (Q2029487) (← links)
- The state complexity of \(\overline{\varSigma ^*\overline{L}}\) and its connection with temporal logic (Q2423779) (← links)
- Concise representations of regular languages by degree and probabilistic finite automata (Q3142004) (← links)
- Descriptional and Computational Complexity of Finite Automata (Q3618565) (← links)
- Two-way automata and length-preserving homomorphisms (Q4879206) (← links)
- State-complexity of finite-state devices, state compressibility and incompressibility (Q5289271) (← links)
