Prefixes of infinite words and ambiguous context-free languages
From MaRDI portal
(Redirected from Publication:1108044)
Cites work
- scientific article; zbMATH DE number 3911733 (Why is no real title available?)
- scientific article; zbMATH DE number 3499699 (Why is no real title available?)
- scientific article; zbMATH DE number 3588051 (Why is no real title available?)
- scientific article; zbMATH DE number 1737190 (Why is no real title available?)
- scientific article; zbMATH DE number 3238653 (Why is no real title available?)
- Algebraic functions over finite fields
- Analytic models and ambiguity of context-free languages
- Decidability of periodicity for infinite words
- Dirichlet Series and Curious infinite Products
- Every iterated morphism yields a co-CFL
- Folds! III: More morphisms
- On the periodicity of morphisms on free monoids
- Probabilistic counting algorithms for data base applications
Cited in
(12)- On Parikh slender context-free languages
- Asymptotic approximation by regular languages
- A tree-height hierarchy of context-free languages
- Properties of infinite words: recent results
- Iterated GSMs and CO-CFL
- A decision method for Parikh slenderness of context-free languages
- Chomsky-Schützenberger type characterizations of poly-slender and Parikh slender context-free languages
- Formulae and asymptotics for coefficients of algebraic functions
- On quasi orders of words and the confluence property
- Non recursive functions have transcendental generating series
- Transcendence of formal power series with rational coefficients
- Languages obtained from infinite words
This page was built for publication: Prefixes of infinite words and ambiguous context-free languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1108044)
