Pages that link to "Item:Q4131690"
From MaRDI portal
The following pages link to On Equivalence and Containment Problems for Formal Languages (Q4131690):
Displayed 6 items.
- Descriptional and computational complexity of finite automata -- a survey (Q553312) (← links)
- Double Greibach operator grammars (Q1589438) (← links)
- Bond-free DNA language classes (Q2461298) (← links)
- Descriptional and Computational Complexity of Finite Automata (Q3618565) (← links)
- Classifying the computational complexity of problems (Q3781088) (← links)
- On the undecidability and descriptional complexity of synchronized regular expressions (Q6171822) (← links)