Pages that link to "Item:Q1219165"
From MaRDI portal
The following pages link to The membership question for ETOL-languages is polynomially complete (Q1219165):
Displayed 18 items.
- On the complexity of the recognition of parallel 2D-image languages (Q808271) (← links)
- Recurrent words and simultaneous growth in T0L systems (Q1081308) (← links)
- Pattern selector grammars and several parsing algorithms in the context- free style (Q1081314) (← links)
- Applications of scheduling theory to formal language theory (Q1082085) (← links)
- Abstract grammars based on transductions (Q1176481) (← links)
- ETOL-grammars and N-grammars (Q1219692) (← links)
- On the complexity of formal grammars (Q1239000) (← links)
- On the Kleijn-Rozenberg k-adjacent languages (Q1351933) (← links)
- The Euclidean traveling salesman problem and a space-filling curve (Q1392940) (← links)
- Grouped partial ET0L systems and parallel multiple context-free grammars (Q1583595) (← links)
- Manipulating derivation forests by scheduling techniques (Q1820586) (← links)
- Linear-bounded composition of tree-walking tree transducers: linear size increase and complexity (Q2022308) (← links)
- On Distinguishing NC $$^1$$ and NL (Q3451114) (← links)
- Complexity of some problems concerningL systems (Q3896507) (← links)
- The complexity of the membership problem for some extensions of context-free languagest† (Q4181980) (← links)
- Complexity of E0L structural equivalence (Q4359286) (← links)
- Parallel complexity of iterated morphisms and the arithmetic of small numbers (Q5096834) (← links)
- Complexity of EOL structural equivalence (Q5096917) (← links)