Conditional densities of regular languages
From MaRDI portal
Publication:2851695
zbMATH Open1272.68213MaRDI QIDQ2851695FDOQ2851695
Authors: Jakub Kozik 
Publication date: 2 October 2013
Full work available at URL: http://www.sciencedirect.com/science/article/pii/S1571066105051273
Recommendations
Cited In (22)
- Regular language distance and entropy
- Weights of formal languages based on geometric series with an application to automatic grading
- Characterizing regular languages with polynomial densities
- On the density of regular and context-free languages
- Definitions and properties of entropy and distance for regular languages
- Languages that require full scanning of words to determine membership
- Title not available (Why is that?)
- On the density of regular languages
- LATIN 2004: Theoretical Informatics
- Regular autodense languages
- Title not available (Why is that?)
- Denseness, maximality, and decidability of grammatical families
- Title not available (Why is that?)
- Undecidable problems concerning densities of languages
- On the density of languages accepted by Turing machines and other machine models
- Title not available (Why is that?)
- A similarity measure for formal languages based on convergent geometric series
- Title not available (Why is that?)
- Regularity of languages defined by formal series with isolated cut point
- Title not available (Why is that?)
- On the Density of Regular and Context-Free Languages
- Languages with membership determined by single letter factors
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)
