EXACT GENERATION OF MINIMAL ACYCLIC DETERMINISTIC FINITE AUTOMATA

DOI10.1142/S0129054108005930zbMath1156.68029OpenAlexW2020308196MaRDI QIDQ3526533

Rogério Reis, Marco Almeida, Nelma Moreira

Publication date: 25 September 2008

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

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

zbMATH Keywords

finite languagesminimal automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

Sampling different kinds of acyclic automata using Markov chains ⋮ Random Generation of Deterministic Acyclic Automata Using Markov Chains

Cites Work

• Enumeration and generation with a string automata representation
• Exact enumeration of acyclic deterministic automata
• IMPROVED BOUNDS ON THE NUMBER OF AUTOMATA ACCEPTING FINITE LANGUAGES
• Unnamed Item
• Unnamed Item

This page was built for publication: EXACT GENERATION OF MINIMAL ACYCLIC DETERMINISTIC FINITE AUTOMATA