scientific article; zbMATH DE number 3415406
From MaRDI portal
Publication:5679727
Cited in
(18)- A note on the density of inherently ambiguous context-free languages
- On the number of words in the language \(\{w \epsilon \Sigma^* | w=w^ r\}^ 2\)
- Automatic average-case analysis of algorithms
- On counting functions and slenderness of languages
- scientific article; zbMATH DE number 3553774 (Why is no real title available?)
- A characterization of poly-slender context-free languages
- Chomsky-Schützenberger type characterizations of poly-slender and Parikh slender context-free languages
- scientific article; zbMATH DE number 7438576 (Why is no real title available?)
- scientific article; zbMATH DE number 7439745 (Why is no real title available?)
- Unambiguous conjunctive grammars over a one-symbol alphabet
- On Rough Approximations of Languages under Infinite Index Indiscernibility Relations
- Properties and limits of recognition of sets of integers by countable automata
- Monotonicity characterizations of regular languages
- Relative densities of formal languages
- Monotonicity characterizations of regular languages
- Density of group languages in shift spaces
- Asymptotic approximation by regular languages
- Periodic and Sturmian languages
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 Q5679727)
