Image de couverture de livre

Semidirect Product Decompositions for Periodic Regular Languages

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Inoue, Yusuke, Hashimoto, Kenji, Seki, Hiroyuki
Format:	Preprint
Publié:	2024
Sujets:	Formal Languages and Automata Theory 68Q45, 68Q70
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

On A. V. Anisimov's problem for finding a polynomial algorithm checking inclusion of context-free languages in group languages
par: Yordzhev, Krasimir
Publié: (2026)

Bandwidth of Nondeterministic Finite Automata
par: Cho, Da-Jung, et autres
Publié: (2026)

Cone-Induced Observation Congruences for Vector-Valued Quantitative Languages
par: Alpay, Faruk, et autres
Publié: (2026)

Bounded Languages Described by GF(2)-grammars
par: Makarov, Vladislav
Publié: (2019)

A Unary-to-Nonunary Transition in the Accepting-State Spectrum of Right Quotient for Permutation Automata
par: German, Samuel
Publié: (2026)

Density of rational languages under shift invariant measures
par: Berthé, Valérie, et autres
Publié: (2025)

A hierarchy of reversible finite automata
par: Radionova, Maria, et autres
Publié: (2024)

On Computational Completeness of Semi-Conditional Matrix Grammars
par: Fernau, Henning, et autres
Publié: (2024)

Nondeterministic tree-walking automata are not closed under complementation
par: Martynova, Olga, et autres
Publié: (2024)

A lower bound on the state complexity of transforming two-way nondeterministic finite automata to unambiguous finite automata
par: Petrov, Semyon, et autres
Publié: (2024)

Mostowski Index via extended register games
par: Idir, Olivier, et autres
Publié: (2024)

Linear equations and recursively enumerable sets
par: Honkala, Juha
Publié: (2024)

A quadratic upper bound on the reset thresholds of synchronizing automata containing a transitive permutation group
par: Zhu, Yinfeng
Publié: (2024)

Around Don's conjecture for binary completely reachable automata
par: Zhu, Yinfeng
Publié: (2024)

An $L^{\#}$ Based Algorithm for Active Learning of Minimal Separating Automata
par: Laumen, Jasper, et autres
Publié: (2026)

From regular expressions to deterministic finite automata: $2^{\frac{n}{2}+\sqrt{n}(\log n)^{Θ(1)}}$ states are necessary and sufficient
par: Martynova, Olga, et autres
Publié: (2025)

Don's conjecture for binary completely reachable automata: an approach and its limitations
par: Casas, David, et autres
Publié: (2023)

On Quantum Context-Free Grammars
par: Aruja, Merina, et autres
Publié: (2025)

A generalization of Deterministic Finite Automata related to discharging
par: Campbell, John M.
Publié: (2025)

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

On Languages Describing Large Graph Classes
par: Fernau, Henning, et autres
Publié: (2026)

Decomposition of Automata recognizing Ideals
par: Berry, Mathias, et autres
Publié: (2026)

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

Languages given by Finite Automata over the Unary Alphabet
par: Czerwiński, Wojciech, et autres
Publié: (2023)

Weighted Automata and Logics Meet Computational Complexity
par: Kostolányi, Peter
Publié: (2023)

Illustrating Finite Automata with Grail+ and TikZ
par: May, Alastair, et autres
Publié: (2024)

A polynomial-time algorithm for the automatic Baire property
par: Staiger, Ludwig
Publié: (2025)

A note on Automatic Baire property
par: Staiger, Ludwig
Publié: (2025)

Dissecting power of intersection of two context-free languages
par: Rukavicka, Josef
Publié: (2020)

Weakly-unambiguous Parikh automata and their link to holonomic series
par: Bostan, Alin, et autres
Publié: (2025)

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)

Alternating Nominal Automata with Name Allocation
par: Frank, Florian, et autres
Publié: (2024)

Nominal Tree Automata With Name Allocation
par: Prucker, Simon, et autres
Publié: (2024)

Generalized Parikh Matrices For Tracking Subsequence Occurrences
par: Fazekas, Szilárd Zsolt, et autres
Publié: (2024)

Eve-positional languages: putting order into Büchi automata
par: Idir, Olivier
Publié: (2026)

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

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

Runs, Squares, Palindromes, and Unbordered Factors of a Family of Binary Pattern Sequences with the All-One Pattern
par: Hendel, Russell Jay
Publié: (2025)

Learning Automata with Name Allocation
par: Frank, Florian, et autres
Publié: (2025)