Pages that link to "Item:Q1998865"
From MaRDI portal
The following pages link to Relationships between bounded languages, counter machines, finite-index grammars, ambiguity, and commutative regularity (Q1998865):
Displaying 4 items.
- On the commutative equivalence of bounded context-free and regular languages: the code case (Q476875) (← links)
- On Families of Full Trios Containing Counter Machine Languages (Q2817390) (← links)
- Unboundedness problems for machines with reversal-bounded counters (Q6091196) (← links)
- On the Commutative Equivalence of Algebraic Formal Series and Languages (Q6114824) (← links)