EXACT GENERATION OF MINIMAL ACYCLIC DETERMINISTIC FINITE AUTOMATA-Reference-Cited by-同舟云学术

EXACT GENERATION OF MINIMAL ACYCLIC DETERMINISTIC FINITE AUTOMATA

Published:2008-08 Issue:04 Volume:19 Page:751-765
ISSN:0129-0541
Container-title:International Journal of Foundations of Computer Science
language:en
Short-container-title:Int. J. Found. Comput. Sci.

Author:

ALMEIDA MARCO¹,MOREIRA NELMA¹,REIS ROGÉRIO¹

Affiliation:

1. LIACC, Faculdade de Ciências, Universidade do Porto, Departamento de Ciência de Computadores, Rua do Campo Alegre, 1021/1055, 4169-007 Porto, Portugal

Abstract

We give a canonical representation for minimal acyclic deterministic finite automata (MADFA) with n states over an alphabet of k symbols. Using this normal form, we present a method for the exact generation of MADFAs. This method avoids a rejection phase that would be needed if a generation algorithm for a larger class of objects that contains the MADFAs were used. We give upper and lower bounds for MADFAs enumeration and some exact formulas for small values of n.

Publisher

World Scientific Pub Co Pte Lt

Subject

Computer Science (miscellaneous)

Link

https://www.worldscientific.com/doi/pdf/10.1142/S0129054108005930

Reference10 articles.

1. Enumeration and generation with a string automata representation

2. IMPROVED BOUNDS ON THE NUMBER OF AUTOMATA ACCEPTING FINITE LANGUAGES

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Operational State Complexity of Block Languages;Electronic Proceedings in Theoretical Computer Science;2024-09-11

2. Block Languages and Their Bitmap Representations;Lecture Notes in Computer Science;2024

3. Hot Current Topics of Descriptional Complexity;IFIP Advances in Information and Communication Technology;2021

4. Guest Column;ACM SIGACT News;2020-03-12

5. Random Generation of Deterministic Acyclic Automata Using the Recursive Method;Computer Science – Theory and Applications;2013