Undecidable problems concerning densities of languages
From MaRDI portal
Recommendations
Cited in
(16)- A context-free language decision problem
- An undecidable property of context-free linear orders
- On the density of certain languages with \(p^2\) letters
- Conditional densities of regular languages
- (Un)decidability of the emptiness problem for multi-dimensional context-free grammars
- On the density of regular and context-free languages
- On the density of context-free and counter languages
- Density of grammar forms part II
- scientific article; zbMATH DE number 4080943 (Why is no real title available?)
- scientific article; zbMATH DE number 58306 (Why is no real title available?)
- On the density of context-free and counter languages
- scientific article; zbMATH DE number 938665 (Why is no real title available?)
- The two-cardinal problem for languages of arbitrary cardinality
- scientific article; zbMATH DE number 5199150 (Why is no real title available?)
- On the density of languages accepted by Turing machines and other machine models
- Relative densities of formal languages
This page was built for publication: Undecidable problems concerning densities of languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3576000)