A TIME AND SPACE EFFICIENT ALGORITHM FOR MINIMIZING COVER AUTOMATA FOR FINITE LANGUAGES

DOI10.1142/S0129054103002187zbMath1104.68061MaRDI QIDQ5696954

Heiko Körner

Publication date: 19 October 2005

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

zbMATH Keywords

deterministic finite automataefficient algorithmcover languagedeterministic cover automatafinite languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (19)

Incremental construction of minimal deterministic finite cover automata ⋮ Finite state based testing of P systems ⋮ Time window temporal logic ⋮ A model learning based testing approach for spiking neural P systems ⋮ More on Deterministic and Nondeterministic Finite Cover Automata ⋮ Reducing Acyclic Cover Transducers ⋮ Learning finite cover automata from queries ⋮ A model learning based testing approach for kernel P systems ⋮ 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? ⋮ Hyper-Minimization in O(n 2) ⋮ Testing based on identifiable P systems using cover automata and X-machines ⋮ Computing All ℓ-Cover Automata Fast ⋮ On the Hopcroft's minimization technique for DFA and DFCA ⋮ HYPER-MINIMIZATION IN O(n²) ⋮ More on deterministic and nondeterministic finite cover automata

Cites Work

• Unnamed Item
• AN EFFICIENT ALGORITHM FOR CONSTRUCTING MINIMAL COVER AUTOMATA FOR FINITE LANGUAGES

This page was built for publication: A TIME AND SPACE EFFICIENT ALGORITHM FOR MINIMIZING COVER AUTOMATA FOR FINITE LANGUAGES