Multi-Sequential Word Relations

DOI10.1142/S0129054118400075zbMath1387.68157OpenAlexW2963410321MaRDI QIDQ4640041

Ismaël Jecker, Emmanuel Filiot

Publication date: 15 May 2018

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054118400075

zbMATH Keywords

automatasequentialmulti-sequentialword transductions

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

A Pattern Logic for Automata with Outputs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the valuedness of finite transducers
• Une caractérisation des fonctions séquentielles et des fonctions sous- séquentielles en tant que rélations rationnelles
• Determinization of transducers over finite and infinite words.
• Squaring transducers: An efficient procedure for deciding functionality and sequentiality.
• Lexicographic decomposition of \(k\)-valued transducers
• Which Finitely Ambiguous Automata Recognize Finitely Sequential Functions?
• Degree of Sequentiality of Weighted Automata
• A note on finite-valued and finitely ambiguous transducers
• Decomposing Finite-Valued Transducers and Deciding Their Equivalence
• Reversal-Bounded Multicounter Machines and Their Decision Problems
• Unambiguous Automata Denoting Finitely Sequential Functions
• On Relations Defined by Generalized Finite Automata
• The unsolvability of the Equivalence Problem for Λ-Free nondeterministic generalized machines
• FINITELY SUBSEQUENTIAL TRANSDUCERS

This page was built for publication: Multi-Sequential Word Relations