scientific article; zbMATH DE number 1512706

MaRDI QIDQ4508395zbMATH OpenFDO

Authors Marie-Pierre Béal, Olivier Carton, Christophe Prieur, Jacques Sakarovitch

Publication date 3 October 2000

zbMATH Keywords

complexity of decision proceduresdecidabilityfinite transducerfunctional relationsequential relation

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Automata and formal grammars in connection with logical questions (03D05)

Recommendations

• Squaring transducers: An efficient procedure for deciding functionality and sequentiality.
• scientific article; zbMATH DE number 1870549
• scientific article; zbMATH DE number 1773097
• The complexity of transducer synthesis from multi-sequential specifications
• scientific article; zbMATH DE number 2050927
• Sequentiality of string-to-context transducers
• Minimization algorithms for sequential transducers
• Iterating transducers in the large (extended abstract)
• Characterizing the rational functions by restarting transducers
• Encoding transition systems in sequent calculus

Cited in

(8)

• Deciding sequentiability of finite-state transducers by finite-state pattern-matching.
• Hierarchical information and the synthesis of distributed strategies
• Determinization of transducers over finite and infinite words.
• Squaring transducers: An efficient procedure for deciding functionality and sequentiality.
• Multi-sequential word relations
• Multi-sequential word relations
• Undecidability of Topological and Arithmetical Properties of Infinitary Rational Relations
• Sequentiality of string-to-context transducers

This page was built for publication:

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