Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2110.06839

The algebra of row monomial matrices

A. N. Trahtman
View original source ↗Read source document ↗Export metadata ↓

Abstract

We consider an algebra with non-standard operations on the class of row monomial matrices (having one unit and rest of zeros in every row). The class of row monomial matrices is closed under multiplication, but not closed under ordinary matrix addition. The paper considers a kind of summation operation on row monomial matrices and the necessary conditions to be closed under the operation in this class. The most significant difference between the algebra of row monomial matrices and linear algebra is the summation operation, with respect to which the class of row monomial matrices is closed. The operation of summation in the algebra can be considered also as an algebra of subsets of any set. The class of subsets of given set is closed under considered operation of summation. The deterministic finite automaton (DFA) can be presented by a complete underlying graph of the automaton with edges labelled by letters of an alphabet. Row monomial matrices can be induced by words in the alphabet of labels on edges of underlying graph of DFA and present a mapping of the set of states. A word $s$ of letters on edges of underlying graph $\Gamma$ of deterministic finite automaton (DFA) is called synchronizing if $s$ sends all states of the automaton to a unique state. J. \v{C}erny discovered in 1964 a sequence of $n$-state complete DFA possessing a minimal synchronizing word of length $(n-1)^2$. The hypothesis, mostly known today as \v{C}erny conjecture, claims that $(n-1)^2$ is a precise upper bound on the length of such a word over alphabet $\Sigma$ of letters on edges of $\Gamma$ for every complete $n$-state DFA. The hypothesis was formulated in 1966 by Starke. The following proof of the conjecture uses the algebra of row monomial matrices.

Explore related subjects

cs.FL

Keep this discovery

BibTeXRIS

A. N. Trahtman. 2021-10-13. The algebra of row monomial matrices. https://arxiv.org/abs/2110.06839

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Beyond the Turing threshold: Productive grammars generate essentially undecidable languages

Emil Post's productive sets are not even semi-computable, let alone computable, being thus essentially incomputable. Accordingly, formal languages whose set of words is a (completely) productive set are essentially undecidable. In this article, I elaborate on Post productivity from the viewpoint of formal language theory: I design formal grammars that emulate the construction of productive sets of natural numbers and are thus beyond Turing-decidability.

cs.FL↗
arXiv2026

RAGTIMER 1.0: Rapid Rare-Event Partial State Space Construction for Stochastic VAS (extended version)

Transient reachability analysis of rare events in Continuous-Time Stochastic Vector Addition Systems (CTSVAS) such as Chemical Reaction Networks (CRNs) has proven a formidable challenge to cutting-edge tools. Underlying a CTSVAS is a continuous-time Markov chain (CTMC), and CTMC transient reachability analysis calls for Probabilistic Model Checking (PMC). This analysis requires the explicit representation of a model's entire state space. Rare events occur with extremely low probability, compounding the challenge of probabilistic analysis. In CRNs, it is imperative to verify the probability of rare events; even a low concentration of a species can have pathological consequences. This paper presents the RAGTIMER 1.0 tool, which efficiently builds a partial state space for a CTSVAS by enumerating traces to a rare event of interest and expanding them to exploit concurrency and cycles, providing a guaranteed lower bound on the probability of a rare event. Guaranteed lower bounds are particularly useful in synthetic biological applications because they indicate how and when a rare event can be experimentally observed. RAGTIMER is an attractive alternative to existing rare event analysis methods for CTSVAS models. It outperforms existing PMC tools and refutes multiple probability estimates from rare-event stochastic simulation on multiple challenging CRN models. RAGTIMER uses optimized data structures, a simple input format, and memory-safe Rust code to improve the scalability and accessibility of PMC for industry professionals.

cs.FL↗
arXiv2026

Execution-Time Opacity Logic: A Logic for Ensuring ET-Opacity in Timed Systems

Ensuring confidentiality in Cyber-Physical Systems is critical, especially when attackers exploit execution times to infer sensitiveinformation. Traditional opacity models are inadequate for timed systems, as verifying opacity in Timed Automata is undecidable. To address this challenge, we propose Execution-Time Opacity Logic (ETOL), a new formalism that specifies opacity by requiring that for every execution satisfying a secret formula, there exists another execution of the same duration that does not satisfy it. ETOL guarantees that timing observations cannot reveal confidential agent activities. We present a decidable and efficient verification framework based on zone-based model checking, supported by a dedicated algorithm that systematically identifies duration-equivalent executions. Our approach is validated through an ATM case study, showing that ETOL enables efficient verification of execution-time confidentiality under timing attacks. We also developed a prototype tool for the ETOL logic that supports symbolic model checking over timed systems. It allows users to verify ETOL formulas based on clock-constrained execution paths.

cs.FL↗