Similarity relations and cover automata

DOI10.1051/ita:2005006zbMath1102.68057OpenAlexW2125094982MaRDI QIDQ4680729

Georges Hansel, Franck Guingne, Jean-Marc Champarnaud

Publication date: 7 June 2005

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=ITA_2005__39_1_115_0

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (7)

More on Deterministic and Nondeterministic Finite Cover Automata ⋮ Reducing Acyclic Cover Transducers ⋮ COVER TRANSDUCERS FOR FUNCTIONS WITH FINITE DOMAIN ⋮ UNWEIGHTED AND WEIGHTED HYPER-MINIMIZATION ⋮ A sufficient condition to polynomially compute a minimum separating DFA ⋮ Computing All ℓ-Cover Automata Fast ⋮ More on deterministic and nondeterministic finite cover automata

Cites Work

• Unnamed Item
• Unnamed Item
• AN EFFICIENT ALGORITHM FOR CONSTRUCTING MINIMAL COVER AUTOMATA FOR FINITE LANGUAGES
• A Time Complexity Gap for Two-Way Probabilistic Finite-State Automata
• A TIME AND SPACE EFFICIENT ALGORITHM FOR MINIMIZING COVER AUTOMATA FOR FINITE LANGUAGES
• Minimal cover-automata for finite languages

This page was built for publication: Similarity relations and cover automata