Cover Image

Deciding Conjugacy of a Rational Relation

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Aiswarya, C., Manuel, Amaldev, Sunny, Saina
Format:	Preprint
Published:	2023
Subjects:	Formal Languages and Automata Theory G.2.1
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Edit Distance of Finite State Transducers
by: Aiswarya, C., et al.
Published: (2024)

On a Generalization of the Christoffel Tree: Epichristoffel Trees
by: Krishnamoorthy, Abhishek, et al.
Published: (2025)

Set Automata and Limits of Decidability of Two-Variable Logic on Data Words
by: Guha, Shibashis, et al.
Published: (2026)

Approximate Problems for Finite Transducers
by: Filiot, Emmanuel, et al.
Published: (2025)

Words with factor complexity $2n+1$ and minimal critical exponent
by: Currie, James D.
Published: (2025)

Edit Distance of Finite-Valued Transducers
by: Mathew, Prince, et al.
Published: (2026)

Finding codes on infinite grids automatically
by: Salo, Ville, et al.
Published: (2023)

One-sided Hom shifts
by: Béal, Marie-Pierre, et al.
Published: (2025)

Some Results on Digital Segments and Balanced Words
by: De Luca, Alessandro, et al.
Published: (2022)

Resynchronized Uniformization and Definability Problems for Rational Relations
by: Löding, Christof, et al.
Published: (2021)

On Decidability and Expressive Power of Fusion Grammars
by: Pshenitsyn, Tikhon
Published: (2023)

Deciding Subtyping for Asynchronous Multiparty Sessions
by: Li, Elaine, et al.
Published: (2024)

Bounded treewidth, multiple context-free grammars, and downward closures
by: Aiswarya, C., et al.
Published: (2025)

On Decidability Timed Automata with 2 Parametric Clocks
by: Bersani, Marcello M., et al.
Published: (2025)

Reachability in One-Dimensional Pushdown Vector Addition Systems is Decidable
by: Bizière, Clotilde, et al.
Published: (2024)

Deciding whether an Attributed Translation can be realized by a Top-Down Transducer
by: Maneth, Sebastian, et al.
Published: (2023)

Tight Bounds for the Number of Absent Subsequences
by: Adamson, Duncan, et al.
Published: (2024)

Walking on Words
by: Pratt-Hartmann, Ian
Published: (2022)

Deciding Linear Height and Linear Size-to-Height Increase for Macro Tree Transducers
by: Gallot, Paul, et al.
Published: (2023)

A Theory of Hanoi Omega-Automata and Games
by: Filiot, Emmanuel, et al.
Published: (2026)

Construction of Minkowski Sums by Cellular Automata
by: Tahay, Pierre-Adrien
Published: (2024)

Techniques for Showing the Decidability of the Boundedness Problem of Language Acceptors
by: Ibarra, Oscar H., et al.
Published: (2024)

Rabin Games and Colourful Universal Trees
by: Majumdar, Rupak, et al.
Published: (2024)

Membership and Conjugacy in Inverse Semigroups
by: Fleischer, Lukas, et al.
Published: (2025)

Computing the linear hull: Deciding Deterministic? and Unambiguous? for weighted automata over fields
by: Bell, Jason P., et al.
Published: (2022)

Decidable problems in substitution shifts
by: Béal, Marie-Pierre, et al.
Published: (2021)

Synchronous Signal Temporal Logic for Decidable Verification of Cyber-Physical Systems
by: Roop, Partha, et al.
Published: (2026)

PVASS Reachability is Decidable
by: Guttenberg, Roland, et al.
Published: (2025)

New Insights into the Decidability of Opacity in Timed Automata
by: Deng, Weilin, et al.
Published: (2025)

Decidability and Characterization of Expansivity for Group Cellular Automata
by: Castronuovo, Niccolo', et al.
Published: (2025)

On Constructing Finite Automata by Relational Programming
by: Egri-Nagy, Attila, et al.
Published: (2025)

Positive Characteristic Sets for Relational Pattern Languages
by: Mousawi, S. Mahmoud, et al.
Published: (2025)

A Divide and Conquer Algorithm for Deciding Group Cellular Automata Dynamics
by: Castronuovo, Niccolo', et al.
Published: (2025)

Uniform Membership for Hyperedge Replacement Grammars and Related Decision Problems
by: Pshenitsyn, Tikhon
Published: (2025)

Decidability Problems for Micro-Stipula
by: Delzanno, Giorgio, et al.
Published: (2025)

Decidability Issues for Petri Nets -- a survey
by: Esparza, Javier, et al.
Published: (2024)

Deciding DFA-Primality is NP-Hard
by: Spenner, Daniel Alexander
Published: (2026)

Determinization of Min-Plus Weighted Automata is Decidable
by: Almagor, Shaull, et al.
Published: (2025)

General Decidability Results for Systems with Continuous Counters
by: Balasubramanian, A. R., et al.
Published: (2025)

Characterization and Decidability of FC-Definable Regular Languages
by: Thompson, Sam M., et al.
Published: (2025)