Similarity relations and cover automata
From MaRDI portal
Publication:4680729
DOI10.1051/ita:2005006zbMath1102.68057MaRDI 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
68Q45: Formal languages and automata
Related Items
UNWEIGHTED AND WEIGHTED HYPER-MINIMIZATION, Computing All ℓ-Cover Automata Fast, COVER TRANSDUCERS FOR FUNCTIONS WITH FINITE DOMAIN, A sufficient condition to polynomially compute a minimum separating DFA, More on deterministic and nondeterministic finite cover automata, More on Deterministic and Nondeterministic Finite Cover Automata, Reducing Acyclic Cover Transducers
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