Regular transducer expressions for regular transformations

DOI10.1016/j.ic.2020.104655zbMath1485.68140arXiv1802.02094OpenAlexW3104747687MaRDI QIDQ2064527

Shankara Narayanan Krishna, Vrunda Dave, Paul Gastin

Publication date: 6 January 2022

Published in: Information and Computation, Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

transducersunambiguitytransition monoid

Mathematics Subject Classification ID

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

Related Items

Pebble minimization: the last theorems, Weighted two-way transducers, Tribute: The influence of Imre Simon's work in the theory of automata, languages and semigroups, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Regular transducer expressions for regular transformations, From Two-Way Transducers to Regular Function Expressions

Uses Software

• DReX

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Handbook of weighted automata
• Factorization forests for infinite words and applications to countable scattered linear orderings
• Factorization forests of finite height
• Concatenation of inputs in a two-way automaton
• Unambiguous Büchi automata.
• From two-way transducers to regular function expressions
• Regular transducer expressions for regular transformations
• DReX
• Expressiveness of Streaming String Transducers
• First-order definable string transformations
• Regular Transformations of Infinite Strings
• Streaming Tree Transducers
• MSO definable string transductions and two-way finite-state transducers
• Regular combinators for string transformations
• FO-Definable Transformations of Infinite Strings
• Backward Deterministic Büchi Automata on Infinite Words
• Factorisation Forests for Infinite Words