scientific article; zbMATH DE number 7559499
From MaRDI portal
Publication:5089310
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^-square words
- scientific article; zbMATH DE number 1263593
- On the minimal complexity of infinite words
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
- Degrees of lookahead in regular infinite games
- 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 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
- Two-Way Parikh Automata
Cited in
(4)
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)
