COUNTING THE NUMBER OF MINIMAL DFCA OBTAINED BY MERGING STATES

DOI10.1142/S0129054103002138zbMATH Open1104.68059OpenAlexW1994122595MaRDI QIDQ5696949FDOQ5696949

Authors: Andrei Păun, C. Câmpeanu 

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

Recommendations

• scientific article; zbMATH DE number 1962768
• scientific article; zbMATH DE number 2182418
• scientific article; zbMATH DE number 1962773
• Implementation and Application of Automata
• A TIME AND SPACE EFFICIENT ALGORITHM FOR MINIMIZING COVER AUTOMATA FOR FINITE LANGUAGES

zbMATH Keywords

minimizationdeterministic finite automatafinite languagescover languagedeterministic cover automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• A Time Complexity Gap for Two-Way Probabilistic Finite-State Automata
• Title not available (Why is that?)
• AN EFFICIENT ALGORITHM FOR CONSTRUCTING MINIMAL COVER AUTOMATA FOR FINITE LANGUAGES

Cited In (2)

• Incremental construction of minimal deterministic finite cover automata
• Title not available (Why is that?)

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

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