Cover Image

Geodesic languages for rational subsets and conjugates in virtually free groups

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Carvalho, André, Silva, Pedro V.
Format:	Preprint
Published:	2024
Subjects:	Group Theory Formal Languages and Automata Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A language-theoretic approach to study the density of subsets in free groups
by: Carvalho, André
Published: (2026)

On linguistic subsets of groups and monoids
by: Carvalho, André, et al.
Published: (2025)

The asymptotic size of finite irreducible semigroups of rational matrices
by: Kiefer, Stefan, et al.
Published: (2026)

Sections of Submonoids of Nilpotent Groups
by: Shafrir, Doron
Published: (2024)

Presentation of monoids generated by a projection and an involution
by: Caron, Pascal, et al.
Published: (2024)

Is decidability of the Submonoid Membership Problem closed under finite extensions?
by: Shafrir, Doron
Published: (2024)

Cayley Automatic Groups and Numerical Characteristics of Turing Transducers
by: Berdinsky, Dmitry
Published: (2016)

Equality of cycle lengths in one- and two-dimensional $σ$ automata
by: Vadali, Avi, et al.
Published: (2025)

Visibly Pushdown Languages in Groups
by: Ciobanu, Laura, et al.
Published: (2026)

Submonoid Membership in n-dimensional lamplighter groups and S-unit equations
by: Dong, Ruiwen
Published: (2024)

Membership problems in nilpotent groups
by: Bodart, Corentin
Published: (2024)

On finite extensions of lamplighter groups
by: Bodart, Corentin
Published: (2025)

Word equations, constraints, and formal languages
by: Ciobanu, Laura
Published: (2024)

The Identity Problem in virtually solvable matrix groups over algebraic numbers
by: Bodart, Corentin, et al.
Published: (2024)

Equations in wreath products
by: Bartholdi, Laurent, et al.
Published: (2024)

Slice closures of indexed languages and word equations with counting constraints
by: Ciobanu, Laura, et al.
Published: (2024)

The rotating normal form of braids is regular
by: Fromentin, Jean
Published: (2016)

Idempotent cellular automata and their natural order
by: Castillo-Ramirez, Alonso, et al.
Published: (2024)

Watson-Crick conjugates of words and languages
by: Mahalingam, Kalpana, et al.
Published: (2022)

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

Bounded Generation of Submonoids of Heisenberg Groups
by: Shafrir, Doron
Published: (2024)

Graph and wreath products of cellular automata
by: Salo, Ville
Published: (2020)

Membership and Conjugacy in Inverse Semigroups
by: Fleischer, Lukas, et al.
Published: (2025)

Graph subshifts
by: Arrighi, Pablo, et al.
Published: (2023)

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

Word problems and embedding-obstructions in cellular automata groups on groups
by: Salo, Ville
Published: (2025)

A short survey around the pumping lemma for context-free languages
by: Gullà, Gabriele
Published: (2024)

Quantum finite automata and linear context-free languages: a decidable problem
by: Bertoni, A., et al.
Published: (2013)

Sequential densities of rational languages
by: Gorman, Alexi Block, et al.
Published: (2026)

On the order of lazy cellular automata
by: Alcalá-Arroyo, Edgar, et al.
Published: (2025)

On Direct Product and Quotient of Strongly Connected Automata
by: Hu, Zino H.
Published: (2011)

On Word Representations and Embeddings in Complex Matrices
by: Bell, Paul C., et al.
Published: (2026)

Navigational hierarchies of regular languages
by: Place, Thomas, et al.
Published: (2024)

On state complexity for subword-closed languages
by: Guyot, Jérôme
Published: (2024)

Note on dissecting power of regular languages
by: Rukavicka, Josef
Published: (2023)

Two-way affine automata can verify every language
by: Chen, Zeyu, et al.
Published: (2025)

A pumping-like lemma for languages over infinite alphabets
by: Danieli, Yoav
Published: (2025)

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

Bounded treewidth, multiple context-free grammars, and downward closures
by: Aiswarya, C., et al.
Published: (2025)

Passive Model Learning of Visibly Deterministic Context-free Grammars
by: Muškardin, Edi, et al.
Published: (2025)