On computability of data word functions defined by transducers
From MaRDI portal
Recommendations
- Computability of data-word transductions over different data domains
- Synthesis of computable regular functions of infinite words
- scientific article; zbMATH DE number 7559499
- Continuity of functional transducers: a profinite study of rational functions
- Determinization of transducers over infinite words: The general case
Cites work
- scientific article; zbMATH DE number 3660804 (Why is no real title available?)
- scientific article; zbMATH DE number 4124989 (Why is no real title available?)
- scientific article; zbMATH DE number 6741931 (Why is no real title available?)
- scientific article; zbMATH DE number 7649933 (Why is no real title available?)
- A pattern logic for automata with outputs
- Bounded synthesis of register transducers
- Degrees of lookahead in regular infinite games
- Equivalence problems for mappings on infinite strings
- Finite state machines for strings over infinite alphabets
- Finite-memory automata
- LTL with the freeze quantifier and register automata
- Note on: ``How to decide continuity of rational functions on infinite words
- On equivalence and uniformisation problems for finite transducers
- Path logics for querying graphs: combining expressiveness and efficiency
- Regular Transformations of Data Words Through Origin Information
- Regular expressions for data words
- Solving Sequential Conditions by Finite-State Strategies
- Synthesis of data word transducers
- Synthesis with Identifiers
- Two decidability problems for infinite words
Cited in
(4)
This page was built for publication: On computability of data word functions defined by transducers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2200823)
