Imagen de Portada

Context-free graphs and their transition groups

Fuente: arXiv

Guardado en:

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

Ejemplares similares

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)

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

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

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

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

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

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)

Solutions of Word Equations over Partially Commutative Structures
por: Diekert, Volker, et al.
Publicado: (2016)

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

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

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

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

Rational cross-sections, bounded generation and orders on groups
por: Bodart, Corentin
Publicado: (2022)

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

A fast algorithm for Stallings foldings over virtually free groups
por: Cookson, Sam, et al.
Publicado: (2023)

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

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

Graphs and groups with unique geodesics
por: Elder, Murray, et al.
Publicado: (2023)

Ideals of equations for elements in a free group and Stallings folding
por: Ascari, Dario
Publicado: (2022)

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

Conjugacy languages in virtual graph products
por: Crowe, Gemma
Publicado: (2022)

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

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

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)

Quaternionic lattices and poly-context-free word problem
por: Bondarenko, Ievgen
Publicado: (2024)

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

Word equations and the exponent of periodicity
por: Diekert, Volker, et al.
Publicado: (2025)

Membership problems in braid groups and Artin groups
por: Gray, Robert D., et al.
Publicado: (2024)

Context-Free Trees
por: Wächter, Jan Philipp
Publicado: (2026)

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

Equations in Burnside groups
por: Coulon, Rémi, et al.
Publicado: (2021)

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

A polynomial-time algorithm for the automatic Baire property
por: Staiger, Ludwig
Publicado: (2025)

On Languages Describing Large Graph Classes
por: Fernau, Henning, et al.
Publicado: (2026)

A note on Automatic Baire property
por: Staiger, Ludwig
Publicado: (2025)

Boone--Higman Embeddings for Contracting Self-Similar Groups
por: Belk, James, et al.
Publicado: (2024)

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

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