The following pages link to (Q3345795):
Displayed 16 items.
- On the commutative equivalence of bounded context-free and regular languages: the code case (Q476875) (← links)
- Periodic and Sturmian languages (Q844208) (← links)
- Slender Siromoney matrix languages (Q948096) (← links)
- On the separability of sparse context-free languages and of bounded rational relations (Q995585) (← links)
- The Parikh counting functions of sparse context-free languages are quasi-polynomials (Q1034637) (← links)
- Rational languages and the Burnside problem (Q1079380) (← links)
- On the equivalence problem of context-free and DT0L languages (Q1961239) (← links)
- Computational complexity of synchronization under sparse regular constraints (Q2140506) (← links)
- On bounded linear codes and the commutative equivalence (Q2220842) (← links)
- Recognition of poly-slender context-free languages by trellis automata (Q2401759) (← links)
- Sparse and slender subsets of monoids. (Q2480765) (← links)
- On the structure of the counting function of sparse context-free languages. (Q2490812) (← links)
- Finding the Growth Rate of a Regular of Context-Free Language in Polynomial Time (Q3533023) (← links)
- A characterization of poly-slender context-free languages (Q4494483) (← links)
- The monoids of the patience sorting algorithm (Q4629511) (← links)
- On the Commutative Equivalence of Algebraic Formal Series and Languages (Q6114824) (← links)