The following pages link to (Q3870326):
Displayed 17 items.
- The hardest \(\operatorname{LL}(k)\) language (Q832952) (← links)
- Remarks on multihead pushdown automata and multihead stack automata (Q1052822) (← links)
- An inverse homomorphic characterization of full principal AFL (Q1058861) (← links)
- On morphic generation of regular languages (Q1083217) (← links)
- Representations of language families by homomorphic equality operations and generalized equality sets (Q1099633) (← links)
- Bifaithful starry transductions (Q1116707) (← links)
- Test sets and checking words for homomorphism equivalence (Q1148122) (← links)
- A homomorphic characterization of regular languages (Q1162364) (← links)
- A note on morphic characterization of languages (Q1171887) (← links)
- Hardest languages for conjunctive and Boolean grammars (Q1740643) (← links)
- Finite transducers and rational transductions (Q2074205) (← links)
- On hardest languages for one-dimensional cellular automata (Q2232270) (← links)
- A homomorphic characterization of time and space complexity classes of languages† (Q3888530) (← links)
- The Hardest Language for Conjunctive Grammars (Q5740196) (← links)
- The hardest language for grammars with context operators (Q6038689) (← links)
- The Hardest LL(k) Language (Q6169967) (← links)
- On hardest languages for one-dimensional cellular automata (Q6186307) (← links)