Succinct representations of languages by DFA with different levels of reliability

DOI10.1016/j.tcs.2004.04.012zbMath1078.68089OpenAlexW2061494703MaRDI QIDQ1763718

Frank Nießner, Martin Kappes

Publication date: 22 February 2005

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2004.04.012

zbMATH Keywords

Finite automataDescriptional complexitySoftware reliability

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

Asymptotic approximation by regular languages ⋮ IN MEMORIAM CHANDRA KINTALA ⋮ On the existence of regular approximations

Cites Work

• On measuring nondeterminism in regular languages
• Defining liveness
• Automaticity. I: Properties of a measure of descriptional complexity
• Thin and slender languages
• Minimal cover-automata for finite languages
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item