Membership and reachability problems for row-monomial transformations
From MaRDI portal
Semigroups of transformations, relations, partitions, etc. (20M20) Semigroups in automata theory, linguistics, etc. (20M35) Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Recommendations
- REACHABILITY PROBLEMS FOR PRODUCTS OF MATRICES IN SEMIRINGS
- On the decidability of membership in matrix-exponential semigroups
- On undecidability bounds for matrix decision problems
- Vector reachability problem in \(\operatorname{SL}(2,\mathbb{Z})\)
- From Post systems to the reachability problems for matrix semigroups and multicounter automata
Cited in
(11)- Vector and scalar reachability problems in \(\operatorname{SL}(2, \mathbb{Z})\)
- Weighted automata on infinite words in the context of attacker-defender games
- On the mortality problem: from multiplicative matrix equations to linear recurrence sequences and beyond
- On undecidability bounds for matrix decision problems
- On the Identity Problem for the Special Linear Group and the Heisenberg Group.
- On the mortality problem: from multiplicative matrix equations to linear recurrence sequences and beyond
- scientific article; zbMATH DE number 7204378 (Why is no real title available?)
- Mortality Problem for 2×2 Integer Matrices
- Monoids of upper triangular matrices over the Boolean semiring
- Reachability in linear recurrence automata
- On the membership of invertible diagonal and scalar matrices
This page was built for publication: Membership and reachability problems for row-monomial transformations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5311135)