COUNTING THE NUMBER OF MINIMAL DFCA OBTAINED BY MERGING STATES

DOI10.1142/S0129054103002138zbMath1104.68059OpenAlexW1994122595MaRDI QIDQ5696949

Andrei Păun, Cezar Campeanu

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/s0129054103002138

zbMATH Keywords

deterministic finite automataminimizationcover languagedeterministic cover automatafinite languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

Incremental construction of minimal deterministic finite cover automata

Cites Work

• Unnamed Item
• AN EFFICIENT ALGORITHM FOR CONSTRUCTING MINIMAL COVER AUTOMATA FOR FINITE LANGUAGES
• A Time Complexity Gap for Two-Way Probabilistic Finite-State Automata

This page was built for publication: COUNTING THE NUMBER OF MINIMAL DFCA OBTAINED BY MERGING STATES