Pages that link to "Item:Q4151734"
From MaRDI portal
The following pages link to Computational Parallels between the Regular and Context-Free Languages (Q4151734):
Displaying 5 items.
- Decision problems for convex languages (Q553302) (← links)
- Descriptional and computational complexity of finite automata -- a survey (Q553312) (← links)
- On the index of positive programmed formal languages (Q673473) (← links)
- Algebraic properties of substitution on trajectories (Q861260) (← links)
- On the undecidability and descriptional complexity of synchronized regular expressions (Q6171822) (← links)
