Monoids of upper triangular matrices over the Boolean semiring
From MaRDI portal
Cites work
- An introduction to symbolic dynamics and coding
- Analytic methods for reachability problems
- Codes and automata.
- Complexity of universality and related problems for partially ordered NFAs
- Computational complexity of certain problems related to carefully synchronizing words for partial automata and directing words for nondeterministic automata
- Decidability of the membership problem for \(2\times 2\) integer matrices
- Directable nondeterministic automata
- scientific article; zbMATH DE number 4034007 (Why is no real title available?)
- scientific article; zbMATH DE number 1033392 (Why is no real title available?)
- scientific article; zbMATH DE number 784042 (Why is no real title available?)
- scientific article; zbMATH DE number 871949 (Why is no real title available?)
- Mathematical Foundations of Computer Science 2004
- Membership testing in commutative transformation semigroups
- Membership testing in threshold one transformation monoids
- Mortality and synchronization of unambiguous finite automata
- Non-negative matrices and Markov chains.
- On Boolean combinations forming piecewise testable languages
- On Nonnegative Integer Matrices and Short Killing Words
- On synchronizing unambiguous automata
- On the complexity of topological sorting
- On two algorithmic problems about synchronizing automata (short paper)
- Partially ordered automata and piecewise testability
- Polynomial-time algorithm for the orbit problem
- Primitivity and Hurwitz Primitivity of Nonnegative Matrix Tuples: A Unified Approach
- RANK PROBLEMS FOR COMPOSITE TRANSFORMATIONS
- Ranks of binary relations
- Shortest directing words of nondeterministic directable automata
- Synchronised automata
- Synchronization of finite automata
- Synchronization problems in automata without non-trivial cycles
- Synchronizing Automata and the Černý Conjecture
- Synchronizing strongly connected partial DFAs
- The complexity of intersecting finite automata having few final states
- The membership problem in aperiodic transformation monoids
- Unambiguous automata
- Unsolvability in 3 × 3 Matrices
- Černý's conjecture and the road colouring problem
This page was built for publication: Monoids of upper triangular matrices over the Boolean semiring
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7241090)
