Resynchronized uniformization and definability problems for rational relations
From MaRDI portal
Recommendations
Cites work
- Automatic presentations of structures
- Closure properties of synchronized relations
- Deciding Whether or Not a Synchronous Relation is Regular Prefix
- Decision problems among the main subfamilies of rational relations
- Degrees of lookahead in regular infinite games
- Distance desert automata and the star height problem
- Elements of automata theory. Translated from the French by Reuben Thomas
- General algorithms for testing the ambiguity of finite automata and the double-tape ambiguity of finite-state transducers
- scientific article; zbMATH DE number 3660804 (Why is no real title available?)
- scientific article; zbMATH DE number 7376069 (Why is no real title available?)
- scientific article; zbMATH DE number 6741931 (Why is no real title available?)
- Improved limitedness theorems on finite automata with distance functions
- Invisible pushdown languages
- Limitedness theorem on finite automata with distance functions
- Monadic second order definable relations on the binary tree
- On equivalence and uniformisation problems for finite transducers
- On infinite transition graphs having a decidable monadic theory
- On Synthesis of Resynchronizers for Transducers
- Origin-equivalence of two-way word transducers is in PSPACE
- Regular prefix relations
- Resynchronizing classes of word relations
- Solving Sequential Conditions by Finite-State Strategies
- Synchronized rational relations of finite and infinite words
- Synchronizing relations on words
- Transducers with Origin Information
- Which classes of origin graphs are generated by transducers
This page was built for publication: Resynchronized uniformization and definability problems for rational relations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6599794)
