IMPROVED BOUNDS ON THE NUMBER OF AUTOMATA ACCEPTING FINITE LANGUAGES

DOI10.1142/S0129054104002352MaRDI QIDQ5696970zbMATH OpenOpenAlexFDO

Authors Michael Domaratzki

Publication date 19 October 2005

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0129054104002352

zbMATH Keywords

non-isomorphic minimal deterministic finite automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 1948499
• scientific article; zbMATH DE number 2068873
• Exact enumeration of acyclic deterministic automata
• scientific article; zbMATH DE number 1834665
• scientific article; zbMATH DE number 1949657

Cites work

• A Census of Finite Automata
• Enumeration of strongly connected sequential machines

Cited in

(16)

• Exponential upper and lower bounds for the order of a regular language
• Compacted binary trees admit a stretched exponential
• Enumerating regular expressions and their languages
• Exact enumeration of acyclic deterministic automata
• State complexity of two combined operations: catenation-union and catenation-intersection
• scientific article; zbMATH DE number 3876601 (Why is no real title available?)
• State complexity of boundary of prefix-free regular languages
• ON THE STATE COMPLEXITY OF COMBINED OPERATIONS AND THEIR ESTIMATION
• EXACT GENERATION OF MINIMAL ACYCLIC DETERMINISTIC FINITE AUTOMATA
• STATE COMPLEXITY OF UNION AND INTERSECTION OF FINITE LANGUAGES
• scientific article; zbMATH DE number 1948499 (Why is no real title available?)
• scientific article; zbMATH DE number 1979537 (Why is no real title available?)
• scientific article; zbMATH DE number 2068873 (Why is no real title available?)
• State Complexity of k-Union and k-Intersection for Prefix-Free Regular Languages
• MAGIC NUMBERS FOR SYMMETRIC DIFFERENCE NFAS
• Improved limitedness theorems on finite automata with distance functions

This page was built for publication: IMPROVED BOUNDS ON THE NUMBER OF AUTOMATA ACCEPTING FINITE LANGUAGES

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