Pages that link to "Item:Q1183428"
From MaRDI portal
The following pages link to A note on the space complexity of some decision problems for finite automata (Q1183428):
Displayed 19 items.
- Similarity in languages and programs (Q391201) (← links)
- Descriptional and computational complexity of finite automata -- a survey (Q553312) (← links)
- A note on algebras of languages (Q650885) (← links)
- Succinctness of regular expressions with interleaving, intersection and counting (Q982670) (← links)
- State complexity of unique rational operations (Q1019724) (← links)
- Decision procedures for inductive Boolean functions based on alternating automata (Q1399969) (← links)
- Local temporal logic is expressively complete for cograph dependence alphabets (Q1763374) (← links)
- Deciding unifiability and computing local unifiers in the description logic \(\mathcal{EL}\) without top constructor (Q2374390) (← links)
- A note on emptiness for alternating finite automata with a one-letter alphabet (Q2380016) (← links)
- On the State Complexity of Partial Derivative Automata For Regular Expressions with Intersection (Q2829969) (← links)
- THE COMPLEXITY OF REGULAR(-LIKE) EXPRESSIONS (Q2909093) (← links)
- COMPRESSED MEMBERSHIP PROBLEMS FOR REGULAR EXPRESSIONS AND HIERARCHICAL AUTOMATA (Q3056281) (← links)
- Note on the complexity of Las Vegas automata problems (Q3421911) (← links)
- Descriptional and Computational Complexity of Finite Automata (Q3618565) (← links)
- Two-way automata and length-preserving homomorphisms (Q4879206) (← links)
- (Q5015399) (← links)
- Unification in the Description Logic $\mathcal{EL}$ without the Top Concept (Q5200016) (← links)
- Kleene Theorems for Product Systems (Q5200095) (← links)
- MINIMALIZATIONS OF NFA USING THE UNIVERSAL AUTOMATON (Q5704379) (← links)