Pages that link to "Item:Q4922680"
From MaRDI portal
The following pages link to ON A HIERARCHY OF PERMUTATION LANGUAGES (Q4922680):
Displaying 12 items.
- Shuffled languages -- representation and recognition (Q388107) (← links)
- On permutative grammars generating context-free languages (Q1068558) (← links)
- One-way permutations and self-witnessing languages (Q1877694) (← links)
- Characterization and complexity results on jumping finite automata (Q2357104) (← links)
- Permutations of context-free, ET0L and indexed languages (Q2816503) (← links)
- Languages generated by context-free grammars extended by type \(AB\to BA\) rules (Q3589634) (← links)
- Uniform rewriting based on permutations (Q4208597) (← links)
- Combinatorial generation via permutation languages (Q5146846) (← links)
- Regular and linear permutation languages (Q5223617) (← links)
- Counting and Generating Permutations Using Timed Languages (Q5405068) (← links)
- On the Membership Problem of Permutation Grammars — A Direct Proof of NP-Completeness (Q5859630) (← links)
- Combinatorial Generation via Permutation Languages. V. Acyclic Orientations (Q6170445) (← links)