Prefixes of infinite words and ambiguous context-free languages
From MaRDI portal
Publication:1108044
DOI10.1016/0020-0190(87)90162-1zbMATH Open0653.68076OpenAlexW2034926538MaRDI QIDQ1108044FDOQ1108044
Authors: Jean-Michel Autebert, Philippe Flajolet, Joaquim Gabarró 
Publication date: 1987
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/inria-00076062/file/RR-0492.pdf
Cites Work
- Title not available (Why is that?)
- Algebraic functions over finite fields
- Title not available (Why is that?)
- Title not available (Why is that?)
- Folds! III: More morphisms
- On the periodicity of morphisms on free monoids
- Decidability of periodicity for infinite words
- Probabilistic counting algorithms for data base applications
- Analytic models and ambiguity of context-free languages
- Dirichlet Series and Curious infinite Products
- Every iterated morphism yields a co-CFL
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (12)
- Asymptotic approximation by regular languages
- A tree-height hierarchy of context-free languages
- Chomsky-Schützenberger type characterizations of poly-slender and Parikh slender context-free languages
- On quasi orders of words and the confluence property
- Transcendence of formal power series with rational coefficients
- Iterated GSMs and CO-CFL
- Properties of infinite words: recent results
- A decision method for Parikh slenderness of context-free languages
- On Parikh slender context-free languages
- Non recursive functions have transcendental generating series
- Languages obtained from infinite words
- Formulae and asymptotics for coefficients of algebraic functions
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)
