Combinatorial Complexity of Regular Languages
From MaRDI portal
Publication:3503647
DOI10.1007/978-3-540-79709-8_30zbMath1142.68428OpenAlexW2126113681MaRDI QIDQ3503647
Publication date: 5 June 2008
Published in: Computer Science – Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-79709-8_30
Related Items (12)
Branching frequency and Markov entropy of repetition-free languages ⋮ Growth of power-free languages over large alphabets ⋮ Normal forms of random braids. ⋮ The carry propagation of the successor function ⋮ On the penetration distance in Garside monoids ⋮ Finding the Growth Rate of a Regular of Context-Free Language in Polynomial Time ⋮ Growth properties of power-free languages ⋮ Binary words avoiding the pattern AABBCABBA ⋮ On the growth rates of complexity of threshold languages ⋮ Growth rates of complexity of power-free languages ⋮ Two-Sided Bounds for the Growth Rates of Power-Free Languages ⋮ A New Hierarchy for Automaton Semigroups
This page was built for publication: Combinatorial Complexity of Regular Languages
