On computability of data word functions defined by transducers

DOI10.1007/978-3-030-45231-5_12OpenAlexW3023763951MaRDI QIDQ2200823

Emmanuel Filiot, Léo Exibard, Pierre-Alain Reynier

Publication date: 23 September 2020

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

zbMATH Keywords

continuitycomputabilitydata wordsregister automatafunctionalityregister transducers

Mathematics Subject Classification ID

Theory of computing (68Qxx) Theory of software (68Nxx)

Related Items

Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Two decidability problems for infinite words
• Finite-memory automata
• Note on: ``How to decide continuity of rational functions on infinite words
• A pattern logic for automata with outputs
• Regular expressions for data words
• Regular Transformations of Data Words Through Origin Information
• Synthesis with Identifiers
• LTL with the freeze quantifier and register automata
• Degrees of Lookahead in Regular Infinite Games
• Equivalence problems for mappings on infinite strings
• On equivalence and uniformisation problems for finite transducers
• Path Logics for Querying Graphs: Combining Expressiveness and Efficiency
• Finite state machines for strings over infinite alphabets
• Solving Sequential Conditions by Finite-State Strategies
• Bounded synthesis of register transducers