scientific article
From MaRDI portal
Publication:3115555
zbMath1249.68107MaRDI QIDQ3115555
Publication date: 10 February 2012
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Formal languages and automata (68Q45) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (8)
Comparing Complexity Functions of a Language and Its Extendable Part ⋮ Finding the Growth Rate of a Regular of Context-Free Language in Polynomial Time ⋮ Growth properties of power-free languages ⋮ Growth rates of complexity of power-free languages ⋮ Computing the \(k\)-binomial complexity of the Thue-Morse word ⋮ Polynomial languages with finite antidictionaries ⋮ On intermediate factorial languages ⋮ Subword complexity and power avoidance
This page was built for publication:
