Imagen de Portada

On the ET0L subgroup membership problem in bounded automata groups

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Bishop, Alex, D'Angeli, Daniele, Matucci, Francesco, Nagnibeda, Tatiana, Perego, Davide, Rodaro, Emanuele
Formato:	Preprint
Publicado:	2024
Materias:	Group Theory Formal Languages and Automata Theory 20E08, 20F10, 68Q42, 68Q45, 05C25
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

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

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

Dynamics and Obstructions for Self-Similar Groups Generating Free Groups
por: D'Angeli, Daniele, et al.
Publicado: (2025)

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

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

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

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

Presheaf automata
por: Struth, Georg, 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)

Simplicity and irreducibility in circular automata
por: Venturi, Riccardo
Publicado: (2025)

On Quantum Context-Free Grammars
por: Aruja, Merina, et al.
Publicado: (2025)

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

Further results on generalized cellular automata
por: Castillo-Ramirez, Alonso, et al.
Publicado: (2023)

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

A hierarchy of reversible finite automata
por: Radionova, Maria, 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)

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

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

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

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

Anti-Context-Free languages
por: Cardó, Carles
Publicado: (2024)

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)

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

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

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

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

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

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

From higher-order rewriting systems to higher-order categorial algebras and higher-order Curry-Howard isomorphisms
por: Vidal, Juan Climent, et al.
Publicado: (2024)

Weakly-unambiguous Parikh automata and their link to holonomic series
por: Bostan, Alin, et al.
Publicado: (2025)

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)

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

Free inverse monoids are co-context-free
por: Brough, Tara Macalister, et al.
Publicado: (2025)

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

On Computational Completeness of Semi-Conditional Matrix Grammars
por: Fernau, Henning, et al.
Publicado: (2024)

Mostowski Index via extended register games
por: Idir, Olivier, et al.
Publicado: (2024)

An $L^{\#}$ Based Algorithm for Active Learning of Minimal Separating Automata
por: Laumen, Jasper, et al.
Publicado: (2026)

Bounded Languages Described by GF(2)-grammars
por: Makarov, Vladislav
Publicado: (2019)