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 17 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)
- Observations on the complexity of regular expression problems (Q1149249) (← links)
- On the equivalence, containment, and covering problems for the regular and context-free languages (Q1229100) (← links)
- Complexity metatheorems for context-free grammar problems (Q1246270) (← links)
- Complexity of universality and related problems for partially ordered NFAs (Q2013561) (← links)
- On Boolean combinations forming piecewise testable languages (Q2358689) (← links)
- Decidability of trajectory-based equations (Q2575751) (← links)
- Descriptional and Computational Complexity of Finite Automata (Q3618565) (← links)
- Decision Problems for Convex Languages (Q3618584) (← links)
- Classifying the computational complexity of problems (Q3781088) (← links)
- More on Minimizing Finite Automata with Errors — Nondeterministic Machines (Q5268394) (← links)
- On the undecidability and descriptional complexity of synchronized regular expressions (Q6171822) (← links)
- Pumping lemmas can be ``harmful'' (Q6635700) (← links)
- Decision problems for subregular classes (Q6666796) (← links)
