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):
Displaying 6 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)
- Local temporal logic is expressively complete for cograph dependence alphabets (Q1763374) (← links)
