Synthesis of computable regular functions of infinite words
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 7559499
- On computability of data word functions defined by transducers
- Computability of data-word transductions over different data domains
- How to decide continuity of rational functions on infinite words
- Continuity of functional transducers: a profinite study of rational functions
Cites work
- A circuit complexity approach to transductions
- A pattern logic for automata with outputs
- Automata and semigroups recognizing infinite words
- Automata with Reversal-Bounded Counters: A Survey
- Continuity and Rational Functions
- Continuity of functional transducers: a profinite study of rational functions
- scientific article; zbMATH DE number 3539473 (Why is no real title available?)
- scientific article; zbMATH DE number 1460545 (Why is no real title available?)
- scientific article; zbMATH DE number 7003194 (Why is no real title available?)
- scientific article; zbMATH DE number 7559499 (Why is no real title available?)
- scientific article; zbMATH DE number 3189696 (Why is no real title available?)
- Logic-automata connections for transformations
- Minimizing subsequential transducers: a survey.
- Note on: ``How to decide continuity of rational functions on infinite words
- On computability of data word functions defined by transducers
- On uniformly continuous functions for some profinite topologies
- Regular Real Analysis
- Regular transformations of infinite strings
- Regularity preserving modifications of regular expressions
- Regularity-preserving relations
- Solving Sequential Conditions by Finite-State Strategies
- XML navigation and transformation by tree-walking automata and transducers with visible and invisible pebbles
Cited in
(5)
This page was built for publication: Synthesis of computable regular functions of infinite words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5094153)
