Pages that link to "Item:Q5941088"
From MaRDI portal
The following pages link to The growth function of context-free languages (Q5941088):
Displaying 20 items.
- Groups, graphs, languages, automata, games and second-order monadic logic (Q444388) (← links)
- On the growth of linear languages (Q817237) (← links)
- On block pumpable languages (Q897892) (← links)
- The Parikh counting functions of sparse context-free languages are quasi-polynomials (Q1034637) (← links)
- Growth rates of power-free languages (Q1037095) (← links)
- On universally easy classes for NP-complete problems. (Q1401418) (← links)
- Context-free languages of sub-exponential growth (Q1608320) (← links)
- On bounded linear codes and the commutative equivalence (Q2220842) (← links)
- On the structure of the counting function of sparse context-free languages. (Q2490812) (← links)
- ON THE DENSITY OF REGULAR AND CONTEXT-FREE LANGUAGES (Q3084684) (← links)
- Growth and ergodicity of context-free languages (Q3151247) (← links)
- Growth and ergodicity of context-free languages II: The linear case (Q3420282) (← links)
- (Q3450102) (← links)
- Finding the Growth Rate of a Regular of Context-Free Language in Polynomial Time (Q3533023) (← links)
- The monoids of the patience sorting algorithm (Q4629511) (← links)
- On differentiation functions, structure functions, and related languages of context-free grammars (Q4825398) (← links)
- The binomial equivalence classes of finite words (Q4970534) (← links)
- Ideals of equations for elements in a free group and context-free languages (Q6054798) (← links)
- Volume formula and growth rates of the balls of strings under the edit distances (Q6096340) (← links)
- On the Commutative Equivalence of Algebraic Formal Series and Languages (Q6114824) (← links)
