Pages that link to "Item:Q476875"
From MaRDI portal
The following pages link to On the commutative equivalence of bounded context-free and regular languages: the code case (Q476875):
Displaying 12 items.
- On the commutative equivalence of semi-linear sets of \(\mathbb{N}^k\) (Q476895) (← links)
- Semi-linearity, Parikh-boundedness and tree adjunct languages (Q799121) (← links)
- Commutative one-counter languages are regular (Q800097) (← links)
- On the commutative equivalence of context-free languages (Q1622958) (← links)
- Relationships between bounded languages, counter machines, finite-index grammars, ambiguity, and commutative regularity (Q1998865) (← links)
- Coding by minimal linear grammars (Q2192369) (← links)
- On bounded linear codes and the commutative equivalence (Q2220842) (← links)
- On the commutative equivalence of bounded context-free and regular languages: the semi-linear case (Q2257288) (← links)
- On counting functions and slenderness of languages (Q2422037) (← links)
- On the commutative equivalence of bounded context-free and regular languages (Q2789520) (← links)
- A Fully Equational Proof of Parikh's Theorem (Q4787831) (← links)
- On the Commutative Equivalence of Algebraic Formal Series and Languages (Q6114824) (← links)
