Deciding sequentiability of finite-state transducers by finite-state pattern-matching.

DOI10.1016/j.tcs.2003.10.008zbMath1069.68066OpenAlexW2069407765MaRDI QIDQ1426166

Tamás Gaál

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.008

zbMATH Keywords

SequentialSequentiality\(\varepsilon\)-ambiguity\(\varepsilon\)-closureFinite-state transducerLetter transducerSequentiabilitySequentialization

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05)

Cites Work

• Sur une variante des fonctions séquentielles
• Une caractérisation des fonctions séquentielles et des fonctions sous- séquentielles en tant que rélations rationnelles
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Deciding sequentiability of finite-state transducers by finite-state pattern-matching.