Conditional densities of regular languages
From MaRDI portal
Publication:2851695
Recommendations
Cited in
(22)- Undecidable problems concerning densities of languages
- Regular autodense languages
- On the Density of Regular and Context-Free Languages
- scientific article; zbMATH DE number 3919856 (Why is no real title available?)
- scientific article; zbMATH DE number 4045193 (Why is no real title available?)
- scientific article; zbMATH DE number 3885337 (Why is no real title available?)
- scientific article; zbMATH DE number 169339 (Why is no real title available?)
- On the density of regular languages
- Regularity of languages defined by formal series with isolated cut point
- Weights of formal languages based on geometric series with an application to automatic grading
- LATIN 2004: Theoretical Informatics
- Definitions and properties of entropy and distance for regular languages
- Characterizing regular languages with polynomial densities
- scientific article; zbMATH DE number 3997184 (Why is no real title available?)
- Denseness, maximality, and decidability of grammatical families
- On the density of languages accepted by Turing machines and other machine models
- Languages that require full scanning of words to determine membership
- scientific article; zbMATH DE number 2186907 (Why is no real title available?)
- Languages with membership determined by single letter factors
- On the density of regular and context-free languages
- A similarity measure for formal languages based on convergent geometric series
- Regular language distance and entropy
This page was built for publication: Conditional densities of regular languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2851695)
