Pages that link to "Item:Q3589634"
From MaRDI portal
The following pages link to Languages generated by context-free grammars extended by type \(AB\to BA\) rules (Q3589634):
Displaying 7 items.
- Shuffled languages -- representation and recognition (Q388107) (← links)
- Counter machines, Petri nets, and consensual computation (Q517037) (← links)
- Characterization and complexity results on jumping finite automata (Q2357104) (← links)
- \( 5^\prime \to 3^\prime\) Watson-Crick pushdown automata (Q2666842) (← links)
- Regular and linear permutation languages (Q5223617) (← links)
- On the Membership Problem of Permutation Grammars — A Direct Proof of NP-Completeness (Q5859630) (← links)
- State-deterministic Finite Automata with Translucent Letters and Finite Automata with Nondeterministically Translucent Letters (Q6204134) (← links)