Schützenberger-like products in non-free monoids
Construction of a deterministic -automaton using derivatives
Construction of a Deterministic -Automaton Using Derivatives
A deterministic automaton recognizing a given -regular language is constructed from an -regular expression with the help of derivatives. The construction is related to Safra's algorithm, in about the same way as the classical derivative method is related to the subset construction.
A characterization of polarities whose polar lattice is orthomodular
Some euclidean space properties applied to data analysis
Page 1