Resynchronized uniformization and definability problems for rational relations
From MaRDI portal
Publication:6599794
DOI10.46298/dmtcs.7460MaRDI QIDQ6599794
Publication date: 6 September 2024
Published in: Discrete Mathematics and Theoretical Computer Science. DMTCS (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Synchronized rational relations of finite and infinite words
- Synchronizing relations on words
- Improved limitedness theorems on finite automata with distance functions
- Limitedness theorem on finite automata with distance functions
- On infinite transition graphs having a decidable monadic theory
- Deciding Whether or Not a Synchronous Relation is Regular Prefix
- GENERAL ALGORITHMS FOR TESTING THE AMBIGUITY OF FINITE AUTOMATA AND THE DOUBLE-TAPE AMBIGUITY OF FINITE-STATE TRANSDUCERS
- Decision problems among the main subfamilies of rational relations
- Degrees of Lookahead in Regular Infinite Games
- Regular prefix relations
- Monadic second order definable relations on the binary tree
- On equivalence and uniformisation problems for finite transducers
- Invisible Pushdown Languages
- Resynchronizing Classes of Word Relations
- Closure properties of synchronized relations
- Origin-equivalence of two-way word transducers is in PSPACE
- On Synthesis of Resynchronizers for Transducers
- Transducers with Origin Information
- Distance desert automata and the star height problem
- Solving Sequential Conditions by Finite-State Strategies
- Automatic presentations of structures
This page was built for publication: Resynchronized uniformization and definability problems for rational relations
