IMPROVED BOUNDS ON THE NUMBER OF AUTOMATA ACCEPTING FINITE LANGUAGES

DOI10.1142/S0129054104002352zbMath1101.68650OpenAlexW2075936685MaRDI QIDQ5696970

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)

Related Items (10)

State Complexity of Boundary of Prefix-Free Regular Languages ⋮ STATE COMPLEXITY OF TWO COMBINED OPERATIONS: CATENATION-UNION AND CATENATION-INTERSECTION ⋮ 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 ⋮ MAGIC NUMBERS FOR SYMMETRIC DIFFERENCE NFAS ⋮ Compacted binary trees admit a stretched exponential ⋮ Exact enumeration of acyclic deterministic automata ⋮ Enumerating regular expressions and their languages ⋮ State Complexity of k-Union and k-Intersection for Prefix-Free Regular Languages

Cites Work

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

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