COVER TRANSDUCERS FOR FUNCTIONS WITH FINITE DOMAIN

DOI10.1142/S0129054105003339zbMath1080.68051MaRDI QIDQ5704369

Franck Guingne, Georges Hansel, Jean-Marc Champarnaud

Publication date: 14 November 2005

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

zbMATH Keywords

Cover automataweighted finite state automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

Reducing Acyclic Cover Transducers

Uses Software

• WFSC

Cites Work

• Minimization algorithms for sequential transducers
• Minimizing subsequential transducers: a survey.
• AN EFFICIENT ALGORITHM FOR CONSTRUCTING MINIMAL COVER AUTOMATA FOR FINITE LANGUAGES
• A Time Complexity Gap for Two-Way Probabilistic Finite-State Automata
• Similarity relations and cover 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: COVER TRANSDUCERS FOR FUNCTIONS WITH FINITE DOMAIN