Image de couverture de livre

Languages given by Finite Automata over the Unary Alphabet

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Czerwiński, Wojciech, Dębski, Maciej, Gogasz, Tomasz, Hoi, Gordon, Jain, Sanjay, Skrzypczak, Michał, Stephan, Frank, Tan, Christopher
Format:	Preprint
Publié:	2023
Sujets:	Formal Languages and Automata Theory Logic 03D05, 68Q15, 68Q17, 68Q45
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

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)

On the Intersection Problem for Quantum Finite Automata
par: Benso, Andrea, et autres
Publié: (2024)

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

Implicit automata in λ-calculi III: affine planar string-to-string functions
par: Pradic, Cécilia, et autres
Publié: (2024)

Resolution of The Linear-Bounded Automata Question
par: Lin, Tianrong
Publié: (2021)

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

Probabilistic automatic complexity of finite strings
par: Gill, Kenneth
Publié: (2024)

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

Languages of Words of Low Automatic Complexity Are Hard to Compute
par: Chen, Joey, et autres
Publié: (2025)

Semidirect Product Decompositions for Periodic Regular Languages
par: Inoue, Yusuke, et autres
Publié: (2024)

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

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

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

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)

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

On the Equivalence Checking Problem for Deterministic Top-Down Tree Automata
par: Deng, Zhibo, et autres
Publié: (2025)

Diagonalization of Polynomial-Time Deterministic Turing Machines via Nondeterministic Turing Machines
par: Lin, Tianrong
Publié: (2021)

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)

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)

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

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)

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

The Complexity of Simplifying $ω$-Automata through the Alternating Cycle Decomposition
par: Casares, Antonio, et autres
Publié: (2024)

From Muller to Parity and Rabin Automata: Optimal Transformations Preserving (History) Determinism
par: Casares, Antonio, et autres
Publié: (2023)

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

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

Classically Time-Controlled Quantum Automata: Definition and Properties
par: Díaz-Caro, Alejandro, et autres
Publié: (2018)

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

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

Disproving Termination of Non-Erasing Sole Combinatory Calculus with Tree Automata (Full Version)
par: Nakano, Keisuke, et autres
Publié: (2024)

Finite-Horizon First-Order Rank Profiles of Regular Languages
par: Bazarova, Madina, et autres
Publié: (2026)

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

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