Extraction and recoding of input-\(\varepsilon\)-cycles in finite state transducers.

DOI10.1016/j.tcs.2003.10.012zbMath1033.05092OpenAlexW2079052816MaRDI QIDQ1426170

André Kempe

Publication date: 14 March 2004

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2003.10.012

zbMATH Keywords

DecompositionNon-determinismEpsilon cycleFinite state transducer

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Formal languages and automata (68Q45) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Acyclic networks maximizing the printing complexity

Cites Work

• Sur les rélations rationnelles entre monoides libres
• A construction on finite automata that has remained hidden
• Unnamed Item
• Unnamed Item
• Unnamed Item