scientific article; zbMATH DE number 7559499

DOI10.4230/LIPIcs.CONCUR.2020.43MaRDI QIDQ5089310

Emmanuel Filiot, Shankara Narayanan Krishna, Nathan Lhote, Vrunda Dave

Publication date: 18 July 2022

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

synthesiscontinuitycomputabilityinfinite wordstransducers

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (3)

Synthesizing Computable Functions from Rational Specifications Over Infinite Words ⋮ Unnamed Item ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On uniformly continuous functions for some profinite topologies
• Regularity-preserving relations
• Note on: ``How to decide continuity of rational functions on infinite words
• A pattern logic for automata with outputs
• Minimizing subsequential transducers: a survey.
• On computability of data word functions defined by transducers
• Logic-Automata Connections for Transformations
• A Circuit Complexity Approach to Transductions
• Regular Transformations of Infinite Strings
• Degrees of Lookahead in Regular Infinite Games
• Regularity preserving modifications of regular expressions
• Continuity and Rational Functions
• Regular Real Analysis
• Automata with Reversal-Bounded Counters: A Survey
• Solving Sequential Conditions by Finite-State Strategies
• Two-Way Parikh Automata

This page was built for publication: