Pages that link to "Item:Q1271339"
From MaRDI portal
The following pages link to Decision problems concerning thinness and slenderness of formal languages (Q1271339):
Displaying 14 items.
- On the commutative equivalence of bounded context-free and regular languages: the code case (Q476875) (← links)
- The Parikh counting functions of sparse context-free languages are quasi-polynomials (Q1034637) (← links)
- On lengths of words in context-free languages (Q1575557) (← links)
- On bounded linear codes and the commutative equivalence (Q2220842) (← links)
- On injectivity of quantum finite automata (Q2229947) (← links)
- On the commutative equivalence of bounded context-free and regular languages: the semi-linear case (Q2257288) (← links)
- Freeness properties of weighted and probabilistic automata over bounded languages (Q2280319) (← links)
- On counting functions and slenderness of languages (Q2422037) (← links)
- On the structure of the counting function of sparse context-free languages. (Q2490812) (← links)
- A characterization of poly-slender context-free languages (Q4494483) (← links)
- RESULTS CONCERNING THINNESS OF D0L LANGUAGES (Q4786244) (← links)
- Chomsky-Schützenberger Type Characterizations of Poly-Slender and Parikh Slender Context-Free Languages1 1Work supported by the Grants-in Aid for Scientific Research No. 1 0440034, Japan Society for the Promotion of Sciences and the Dirección General de (Q4923560) (← links)
- Acceptance Ambiguity for Quantum Automata (Q5092433) (← links)
- On the Commutative Equivalence of Algebraic Formal Series and Languages (Q6114824) (← links)
