scientific article; zbMATH DE number 7559499

DOI10.4230/LIPICS.CONCUR.2020.43MaRDI QIDQ5089310FDOQ5089310

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

Publication date: 18 July 2022

Title of this publication is not available (Why is that?)

Recommendations

• Synthesis of computable regular functions of infinite words
• Recursive Word‐Functions over Infinite Alphabets
• scientific article; zbMATH DE number 1834677
• scientific article; zbMATH DE number 1834659
• Constructing Infinite Words of Intermediate Arithmetical Complexity
• On complexity functions of infinite words associated with generalized Dyck languages
• Computing the rabin index of a regular language of infinite words
• On the computing of \(C^\infty\)-square words
• scientific article; zbMATH DE number 1263593
• On the minimal complexity of infinite words

zbMATH Keywords

synthesiscontinuitytransducersinfinite wordscomputability

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Automata with Reversal-Bounded Counters: A Survey
• Title not available (Why is that?)
• Solving Sequential Conditions by Finite-State Strategies
• Two-Way Parikh Automata
• Regularity-preserving relations
• Regularity preserving modifications of regular expressions
• Minimizing subsequential transducers: a survey.
• On uniformly continuous functions for some profinite topologies
• Degrees of lookahead in regular infinite games
• Title not available (Why is that?)
• A circuit complexity approach to transductions
• Automata and semigroups recognizing infinite words
• Note on: ``How to decide continuity of rational functions on infinite words
• A pattern logic for automata with outputs
• Regular transformations of infinite strings
• Continuity and Rational Functions
• Regular Real Analysis
• On computability of data word functions defined by transducers
• Logic-automata connections for transformations

Cited In (3)

• Title not available (Why is that?)
• Synthesizing Computable Functions from Rational Specifications Over Infinite Words
• Synthesis of computable regular functions of infinite words

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5089310)