Computing the prefix of an automaton
From MaRDI portal
Publication:2729627
DOI10.1051/ita:2000127zbMath0974.68105MaRDI 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
68Q45: Formal languages and automata
Related Items
Subsequential transducers: a coalgebraic perspective, Determinization of transducers over finite and infinite words., Minimizing subsequential transducers: a survey., Reducing Acyclic Cover Transducers
Cites Work