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

DOI10.1016/J.TCS.2003.10.008zbMATH Open1069.68066OpenAlexW2069407765MaRDI QIDQ1426166FDOQ1426166

Authors: 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

Recommendations

• scientific article; zbMATH DE number 1949651
• scientific article; zbMATH DE number 1512706
• FINITELY SUBSEQUENTIAL TRANSDUCERS
• scientific article; zbMATH DE number 1773097
• Squaring transducers: An efficient procedure for deciding functionality and sequentiality.

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
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (7)

• Ferromagnetic Wire Memory
• Lipschitz robustness of finite-state transducers
• Squaring transducers: An efficient procedure for deciding functionality and sequentiality.
• Algorithmic solvability of comparison problems for finitely ambiguous sequence transducers on superwords
• Finite state transducers with predicates and identities
• Sequentiality of string-to-context transducers
• Title not available (Why is that?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1426166)