scientific article; zbMATH DE number 3911733
From MaRDI portal
Publication:3687739
[For the entire collection see Zbl 0563.00018.] We establish that several classical context free languages are inherently ambiguous by proving that their counting generating functions, when considered as analytic functions, exhibit some characteristic form of transcendental behaviour.
Recommendations
Cited in
(16)- Analytic models and ambiguity of context-free languages
- Prefixes of infinite words and ambiguous context-free languages
- Ambiguity in omega context free languages
- On the conjecture \(\mathcal {L}_{\mathsf {DFCM}}\subsetneq \mathsf {RCM}\)
- Why we need semirings in automata theory (extended abstract)
- Perceptual Ambiguity and the Sorites
- scientific article; zbMATH DE number 65744 (Why is no real title available?)
- scientific article; zbMATH DE number 475425 (Why is no real title available?)
- Non recursive functions have transcendental generating series
- Universal inherence of cycle-free context-free ambiguity functions
- Properties of infinite words: recent results
- Purely subjective revealed ambiguity
- On a class of languages with holonomic generating functions
- On the number of factors of Sturmian words
- Asymptotic approximation by regular languages
- The number of three-choice polygons
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3687739)