AN EFFICIENT ALGORITHM FOR CONSTRUCTING MINIMAL COVER AUTOMATA FOR FINITE LANGUAGES

DOI10.1142/S0129054102000960zbMath1066.68062OpenAlexW1993598446MaRDI QIDQ3021940

Andrei Păun, Cezar Campeanu, Sheng Yu

Publication date: 22 June 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/s0129054102000960

zbMATH Keywords

deterministic finite automatacover languagedeterministic cover automatafinite languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (16)

Incremental construction of minimal deterministic finite cover automata ⋮ Finite state based testing of P systems ⋮ More on Deterministic and Nondeterministic Finite Cover Automata ⋮ Reducing Acyclic Cover Transducers ⋮ Learning finite cover automata from queries ⋮ COUNTING THE NUMBER OF MINIMAL DFCA OBTAINED BY MERGING STATES ⋮ A TIME AND SPACE EFFICIENT ALGORITHM FOR MINIMIZING COVER AUTOMATA FOR FINITE LANGUAGES ⋮ COVER TRANSDUCERS FOR FUNCTIONS WITH FINITE DOMAIN ⋮ UNWEIGHTED AND WEIGHTED HYPER-MINIMIZATION ⋮ Similarity relations and cover automata ⋮ On Testing P Systems ⋮ Hopcroft’s Minimization Technique: Queues or Stacks? ⋮ Computing All ℓ-Cover Automata Fast ⋮ BRUTE FORCE DETERMINIZATION OF NFAs BY MEANS OF STATE COVERS ⋮ On the Hopcroft's minimization technique for DFA and DFCA ⋮ More on deterministic and nondeterministic finite cover automata

Cites Work

• A Time Complexity Gap for Two-Way Probabilistic Finite-State Automata

This page was built for publication: AN EFFICIENT ALGORITHM FOR CONSTRUCTING MINIMAL COVER AUTOMATA FOR FINITE LANGUAGES