Image de couverture de livre

Decidability of membership problems for flat rational subsets of $\mathrm{GL}(2,\mathbb{Q})$ and singular matrices

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Diekert, Volker, Potapov, Igor, Semukhin, Pavel
Format:	Preprint
Publié:	2019
Sujets:	Formal Languages and Automata Theory 68Q45, 68W30 F.4.3; F.2.1; F.1.1
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

On Transition Constructions for Automata -- A Categorical Perspective
par: Cruchten, Mike
Publié: (2024)

Polynomial Complementation of Nondeterministic 2-Way Finite Automata by 1-Limited Automata
par: Guillon, Bruno, et autres
Publié: (2025)

Kleene Theorems for Lasso Languages and $ω$-Languages
par: Cruchten, Mike
Publié: (2024)

Input-Erasing Two-Way Finite Automata
par: Meduna, Alexander, et autres
Publié: (2025)

The decidability of the genus of regular languages and directed emulators
par: Bonfante, Guillaume, et autres
Publié: (2021)

Word equations and the exponent of periodicity
par: Diekert, Volker, et autres
Publié: (2025)

A Formalization of Co-Transcriptional Splicing as an Operation on Formal Languages
par: Cho, Da-Jung, et autres
Publié: (2025)

Regular Model Checking for Systems with Effectively Regular Reachability Relation
par: Esparza, Javier, et autres
Publié: (2025)

The Algebra of Nondeterministic Finite Automata
par: Gorrieri, Roberto
Publié: (2023)

Axiomatizing NFAs Generated by Regular Grammars
par: Gorrieri, Roberto
Publié: (2024)

$\mathbb{N}$-polyregular functions arise from well-quasi-orderings
par: Lopez, Aliaume
Publié: (2024)

Weighing Obese Timed Languages
par: Asarin, Eugene, et autres
Publié: (2025)

Computing the Bandwidth of Meager Timed Automata
par: Asarin, Eugene, et autres
Publié: (2024)

Propositional dynamic logic and asynchronous cascade decompositions for regular trace languages
par: Adsul, Bharat, et autres
Publié: (2024)

Deciding Sparseness of Regular Languages of Finite Trees and Infinite Words
par: Eickmeyer, Kord, et autres
Publié: (2025)

Functional Closure Properties of Finite $\mathbb{N}$-weighted Automata
par: Dörfler, Julian, et autres
Publié: (2024)

Decision Problems on Copying and Shuffling
par: Halava, Vesa, et autres
Publié: (2023)

Subshifts defined by nondeterministic and alternating plane-walking automata
par: de Menibus, Benjamin Hellouin, et autres
Publié: (2024)

On Repetitive Finite Automata with Translucent Words
par: Mráz, František, et autres
Publié: (2025)

On the Boolean Closure of Deterministic Top-Down Tree Automata
par: Löding, Christof, et autres
Publié: (2024)

On Minimization and Learning of Deterministic $ω$-Automata in the Presence of Don't Care Words
par: Löding, Christof, et autres
Publié: (2022)

Recognizing Numbers
par: Gaba, Pranshu, et autres
Publié: (2025)

Lexicographic transductions of finite words
par: Filiot, Emmanuel, et autres
Publié: (2025)

Probabilistic Finite Automaton Emptiness is undecidable
par: Rote, Günter
Publié: (2024)

Orbit-Finite-Dimensional Vector Spaces and Weighted Register Automata
par: Bojańczyk, Mikołaj, et autres
Publié: (2021)

Probabilistic Finite Automaton Emptiness is Undecidable for a Fixed Automaton
par: Rote, Günter
Publié: (2024)

Evolution-Based Timed Opacity under a Universal Observation Model
par: Zhang, Zhe, et autres
Publié: (2026)

Deterministic Suffix-reading Automata
par: Keerthan, R, et autres
Publié: (2025)

List of Results on the Černý Conjecture and Reset Thresholds for Synchronizing Automata
par: Volkov, Mikhail V.
Publié: (2025)

Anti-Context-Free languages
par: Cardó, Carles
Publié: (2024)

Evaluating Massively Parallel Algorithms for DFA Minimisation, Equivalence Checking and Inclusion Checking
par: Heemstra, Jan, et autres
Publié: (2025)

On universality of regular realizability problems
par: Rubtsov, Alexander, et autres
Publié: (2023)

Tight Bounds for the Number of Absent Subsequences
par: Adamson, Duncan, et autres
Publié: (2024)

On Graph Grammars and Games
par: Vijayakumar, Jayakrishna, et autres
Publié: (2024)

Identity Testing for Stochastic Languages
par: Agarwal, Smayan, et autres
Publié: (2025)

Non-reducible Modal Transition Systems
par: Basile, Davide
Publié: (2023)

Learning real-time one-counter automata using polynomially many queries
par: Mathew, Prince, et autres
Publié: (2024)

Introducing Divergence for Infinite Probabilistic Models
par: Finkel, Alain, et autres
Publié: (2023)

Hypernode Automata
par: Bartocci, Ezio, et autres
Publié: (2023)

Geometric Characterization of Context-Free Intersections via the Inner Segment Dichotomy
par: Silva, Jorge Miguel
Publié: (2026)