Pages that link to "Item:Q1608320"
From MaRDI portal
The following pages link to Context-free languages of sub-exponential growth (Q1608320):
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)
- Growth rates of power-free languages (Q1037095) (← links)
- Factorial languages with quadratically upper bounded growth functions and nonlinearly upper bounded subword complexities (Q1124353) (← links)
- On bounded linear codes and the commutative equivalence (Q2220842) (← links)
- On groups whose geodesic growth is polynomial. (Q2909493) (← 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)
- FINDING THE GROWTH RATE OF A REGULAR OR CONTEXT-FREE LANGUAGE IN POLYNOMIAL TIME (Q3586406) (← links)
- The monoids of the patience sorting algorithm (Q4629511) (← links)
- Applications of L systems to group theory (Q4634925) (← links)
- LANGUAGES WITH A FINITE ANTIDICTIONARY: SOME GROWTH QUESTIONS (Q5247167) (← links)
- The growth function of context-free languages (Q5941088) (← 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)
- Computing the bandwidth of meager timed automata (Q6666783) (← links)
