Imagen de Portada

Simplicity and irreducibility in circular automata

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Venturi, Riccardo
Formato:	Preprint
Publicado:	2025
Materias:	Formal Languages and Automata Theory Combinatorics Representation Theory 68Q70, 68Q45, 20M20, 20M30, 05E10
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

The hereditariness problem for the Černý conjecture
por: Rodaro, Emanuele, et al.
Publicado: (2025)

On the ET0L subgroup membership problem in bounded automata groups
por: Bishop, Alex, et al.
Publicado: (2024)

The Freeness Problem for Automaton Semigroups
por: D'Angeli, Daniele, et al.
Publicado: (2024)

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

Topoi of automata I: Four topoi of automata and regular languages
por: Hora, Ryuya
Publicado: (2024)

Preserving self-similarity in free products of semigroups
por: Brough, Tara Macalister, et al.
Publicado: (2020)

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

Generalizations of the Muller-Schupp theorem and tree-like inverse graphs
por: Rodaro, Emanuele
Publicado: (2023)

Kunz languages for numerical semigroups are context sensitive
por: Delgado, Manuel, et al.
Publicado: (2023)

Uniform winning strategies for the synchronization games on subclasses of finite automata
por: Fernau, Henning, et al.
Publicado: (2025)

A substitution lemma for multiple context-free languages
por: Duncan, Andrew, et al.
Publicado: (2025)

Context-free graphs and their transition groups
por: D'Angeli, Daniele, et al.
Publicado: (2024)

Semidirect Product Decompositions for Periodic Regular Languages
por: Inoue, Yusuke, et al.
Publicado: (2024)

Permutation closure for multiple context-free languages
por: Duncan, Andrew, et al.
Publicado: (2025)

Presheaf automata
por: Struth, Georg, et al.
Publicado: (2024)

The word problem and growth of groups
por: Bondarenko, Ievgen
Publicado: (2024)

The Word Problem for $(ω- 1)$-Terms over $\mathrm{DAb}$
por: Almeida, Jorge, et al.
Publicado: (2024)

Factoring through monomial representations: arithmetic characterizations and ambiguity of weighted automata
por: Puch, Antoni, et al.
Publicado: (2024)

Subsets of groups with context-free preimages
por: Levine, Alex
Publicado: (2023)

A hierarchy of reversible finite automata
por: Radionova, Maria, et al.
Publicado: (2024)

A lower bound on the state complexity of transforming two-way nondeterministic finite automata to unambiguous finite automata
por: Petrov, Semyon, et al.
Publicado: (2024)

Nondeterministic tree-walking automata are not closed under complementation
por: Martynova, Olga, et al.
Publicado: (2024)

Around Don's conjecture for binary completely reachable automata
por: Zhu, Yinfeng
Publicado: (2024)

An automata-based test for bricks over string algebras
por: Kuber, Amit, et al.
Publicado: (2026)

Don's conjecture for binary completely reachable automata: an approach and its limitations
por: Casas, David, et al.
Publicado: (2023)

A generalization of Deterministic Finite Automata related to discharging
por: Campbell, John M.
Publicado: (2025)

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

Hexagonal Picture Scanning Automata
por: D, Deepalakshmi, et al.
Publicado: (2025)

Density of rational languages under shift invariant measures
por: Berthé, Valérie, et al.
Publicado: (2025)

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

A short proof of a bound on the size of finite irreducible semigroups of rational matrices
por: Steinberg, Benjamin
Publicado: (2026)

Effective equation solving, constraints and growth in virtually abelian groups
por: Ciobanu, Laura, et al.
Publicado: (2023)

Introducing q-deformed binomial coefficients of words
por: Renard, Antoine, et al.
Publicado: (2024)

Weighing Obese Timed Languages
por: Asarin, Eugene, et al.
Publicado: (2025)

Computing the Bandwidth of Meager Timed Automata
por: Asarin, Eugene, et al.
Publicado: (2024)

A cornering strategy for synchronizing a DFA
por: Bradshaw, Peter, et al.
Publicado: (2024)

Bandwidth of Nondeterministic Finite Automata
por: Cho, Da-Jung, et al.
Publicado: (2026)

The Word Problem for Finitary Automaton Groups
por: Kotowsky, Maximilian, et al.
Publicado: (2023)

On groups with EDT0L word problem
por: Bishop, Alex, et al.
Publicado: (2025)

Cone-Induced Observation Congruences for Vector-Valued Quantitative Languages
por: Alpay, Faruk, et al.
Publicado: (2026)