Page 1 Next

Displaying 1 – 20 of 983

Showing per page

A Burnside Approach to the Termination of Mohri's Algorithm for Polynomially Ambiguous Min-Plus-Automata

Daniel Kirsten (2008)

RAIRO - Theoretical Informatics and Applications

We show that the termination of Mohri's algorithm is decidable for polynomially ambiguous weighted finite automata over the tropical semiring which gives a partial answer to a question by Mohri [29]. The proof relies on an improvement of the notion of the twins property and a Burnside type characterization for the finiteness of the set of states produced by Mohri's algorithm.

A characterization of C 2 ( q ) where q > 5

Ali Iranmanesh, Behrooz Khosravi (2002)

Commentationes Mathematicae Universitatis Carolinae

The order of every finite group G can be expressed as a product of coprime positive integers m 1 , , m t such that π ( m i ) is a connected component of the prime graph of G . The integers m 1 , , m t are called the order components of G . Some non-abelian simple groups are known to be uniquely determined by their order components. As the main result of this paper, we show that the projective symplectic groups C 2 ( q ) where q > 5 are also uniquely determined by their order components. As corollaries of this result, the validities of a...

Currently displaying 1 – 20 of 983

Page 1 Next