Computing the prefix of an automaton

DOI10.1051/ita:2000127zbMath0974.68105OpenAlexW1978825867MaRDI QIDQ2729627

Olivier Carton, Marie-Pierre Béal

Publication date: 23 July 2001

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

Full work available at URL: https://eudml.org/doc/222063

zbMATH Keywords

prefix of an automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (4)

Subsequential transducers: a coalgebraic perspective ⋮ Reducing Acyclic Cover Transducers ⋮ Determinization of transducers over finite and infinite words. ⋮ Minimizing subsequential transducers: a survey.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The suffix tree of a tree and minimizing sequential transducers
• Confluent linear numeration systems
• Minimization algorithms for sequential transducers

This page was built for publication: Computing the prefix of an automaton