Context-free languages of sub-exponential growth
From MaRDI portal
Publication:1608320
DOI10.1006/JCSS.2001.1804zbMATH Open1013.68123OpenAlexW1982097696MaRDI QIDQ1608320FDOQ1608320
Authors: Martin R. Bridson, Robert H. Gilman 
Publication date: 4 August 2002
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://ora.ox.ac.uk/objects/uuid:d55e36d5-2cce-4de7-af0b-7fa20d8883ba
Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70) Combinatorics on words (68R15)
Cites Work
- Bounded Algol-Like Languages
- Analytic models and ambiguity of context-free languages
- Formal language theory and the geometry of 3-manifolds
- An example of an indexed language of intermediate growth
- The growth function of context-free languages
- A note on decidability questions on presentations of word semigroups
Cited In (20)
- On groups whose geodesic growth is polynomial.
- The monoids of the patience sorting algorithm
- Factorial languages with quadratically upper bounded growth functions and nonlinearly upper bounded subword complexities
- Groups, graphs, languages, automata, games and second-order monadic logic
- Ideals of equations for elements in a free group and context-free languages
- Title not available (Why is that?)
- LANGUAGES WITH A FINITE ANTIDICTIONARY: SOME GROWTH QUESTIONS
- The growth function of context-free languages
- On the growth of linear languages
- Applications of L systems to group theory
- On the Commutative Equivalence of Algebraic Formal Series and Languages
- On block pumpable languages
- Growth rates of power-free languages
- 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
- On bounded linear codes and the commutative equivalence
- 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
- Computing the bandwidth of meager timed automata
Uses Software
This page was built for publication: Context-free languages of sub-exponential growth
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1608320)
