On the growth of linear languages
From MaRDI portal
Publication:817237
DOI10.1016/J.AAM.2005.01.002zbMATH Open1084.68060OpenAlexW2062203804MaRDI QIDQ817237FDOQ817237
Authors: Tullio Ceccherini-Silberstein 
Publication date: 8 March 2006
Published in: Advances in Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.aam.2005.01.002
Recommendations
- Finding the growth rate of a regular or context-free language in polynomial time
- Finding the Growth Rate of a Regular of Context-Free Language in Polynomial Time
- Growth and ergodicity of context-free languages II: The linear case
- Growth-sensitivity of context-free languages.
- Growth and ergodicity of context-free languages
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Bounded Algol-Like Languages
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the entropy of context-free languages
- Title not available (Why is that?)
- A growth criterion for graphs and algebras defined by words
- Growth-sensitivity of context-free languages.
- Growth and ergodicity of context-free languages
- Growth and ergodicity of context-free languages II: The linear case
- An example of an indexed language of intermediate growth
- On the entropy of regular languages.
- Context-free languages of sub-exponential growth
- The growth function of context-free languages
- A helpful result for proving inherent ambiguity
Cited In (9)
- Non-closure under complementation for unambiguous linear grammars
- Deciding regularity of hairpin completions of regular languages in polynomial time
- Growth-sensitivity of context-free languages.
- Groups, graphs, languages, automata, games and second-order monadic logic
- Finding the growth rate of a regular or context-free language in polynomial time
- Finding the Growth Rate of a Regular of Context-Free Language in Polynomial Time
- Volume formula and growth rates of the balls of strings under the edit distances
- Growth and ergodicity of context-free languages II: The linear case
- Complexity Results and the Growths of Hairpin Completions of Regular Languages (Extended Abstract)
Uses Software
This page was built for publication: On the growth of linear languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q817237)
