Cover Image

The asymptotic size of finite irreducible semigroups of rational matrices

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Kiefer, Stefan, Ryzhikov, Andrew
Format:	Preprint
Published:	2026
Subjects:	Formal Languages and Automata Theory Group Theory Rings and Algebras
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

The complexity of reachability problems in strongly connected finite automata
by: Kiefer, Stefan, et al.
Published: (2025)

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

Geodesic languages for rational subsets and conjugates in virtually free groups
by: Carvalho, André, et al.
Published: (2024)

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

Spectral and combinatorial methods for efficiently computing the rank of unambiguous finite automata
by: Kiefer, Stefan, et al.
Published: (2025)

Careful synchronisation and the diameter of transformation semigroups with few generators
by: Ryzhikov, Andrew
Published: (2025)

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

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

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

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

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

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

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

Efficient Analysis of Unambiguous Automata Using Matrix Semigroup Techniques
by: Kiefer, Stefan, et al.
Published: (2019)

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

Equations in wreath products
by: Bartholdi, Laurent, 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)

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

Pseudovarieties of semigroups
by: Almeida, Jorge
Published: (2025)

Membership problems in nilpotent groups
by: Bodart, Corentin
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)

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

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

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

On shortest products for nonnegative matrix mortality
by: Ryzhikov, Andrew
Published: (2024)

Synchronization of strongly connected partial DFAs and prefix codes
by: Berlinkov, Mikhail V., et al.
Published: (2021)

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

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

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

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

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

Minimising the Probabilistic Bisimilarity Distance
by: Kiefer, Stefan, et al.
Published: (2024)

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

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

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

[Draft] High-order estimation-based properties and high-order observers for labeled finite-state automata
by: Zhang, Kuize, et al.
Published: (2024)

Characterization of deterministically recognizable weighted tree languages over commutative semifields by finitely generated and cancellative scalar algebras
by: Fülöp, Zoltán, et al.
Published: (2025)

Well-Behaved (Co)algebraic Semantics of Regular Expressions in Dafny
by: Zetzsche, Stefan, et al.
Published: (2024)