Multi-sequential Word Relations

DOI10.1007/978-3-319-21500-6_23zbMath1386.68093arXiv1504.03864OpenAlexW2807810915MaRDI QIDQ3451110

Ismaël Jecker, Emmanuel Filiot

Publication date: 10 November 2015

Published in: Developments in Language Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1504.03864

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (3)

Multi-sequential Word Relations ⋮ Unnamed Item ⋮ Degree of Sequentiality of Weighted Automata

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?
• Multi-sequential Word Relations
• A note on finite-valued and finitely ambiguous transducers
• 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