On the density of regular languages

DOI10.3233/FI-2019-1823MaRDI QIDQ5241416zbMATH OpenOpenAlexFDO

Authors Toshihiro Koga

Publication date 31 October 2019

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/fi-2019-1823

zbMATH Keywords

densityformal languagesregular languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Conditional densities of regular languages
• LATIN 2004: Theoretical Informatics
• On the density of regular and context-free languages
• Characterizing regular languages with polynomial densities
• On the Density of Regular and Context-Free Languages

Cited in

(14)

• Regular autodense languages
• Power languages and density
• Relatively regular languages and thin codes
• On the density of certain languages with \(p^2\) letters
• Conditional densities of regular languages
• scientific article; zbMATH DE number 2186907 (Why is no real title available?)
• scientific article; zbMATH DE number 2186931 (Why is no real title available?)
• scientific article; zbMATH DE number 1824155 (Why is no real title available?)
• On the Density of Regular and Context-Free Languages
• Characterizing regular languages with polynomial densities
• scientific article; zbMATH DE number 5199150 (Why is no real title available?)
• LATIN 2004: Theoretical Informatics
• Deciding sparseness of regular languages of finite trees and infinite words
• Asymptotic approximation by regular languages

This page was built for publication: On the density of regular languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5241416)