✦ LIBER ✦

The semigroup of a strongly connected automaton

✍ Scribed by Robert H. Oehmke

Publisher: Springer
Year: 1977
Tongue: English
Weight: 291 KB
Volume: 15
Category: Article
ISSN: 0037-1912
DOI: 10.1007/bf02195767

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Rank and statistical mapping of a strong

Rank and statistical mapping of a strongly connected automaton

✍ A. S. Barashko 📂 Article 📅 1988 🏛 Springer US 🌐 English ⚖ 541 KB

Semigroups and automorphism groups of st

Semigroups and automorphism groups of strongly connected automata

✍ Kenji Uemura 📂 Article 📅 1974 🏛 Springer 🌐 English ⚖ 404 KB

On the semigroup of a linear nonsingular

On the semigroup of a linear nonsingular automaton

✍ Klaus H. Ecker 📂 Article 📅 1972 🏛 Springer 🌐 English ⚖ 406 KB

Some results on the set of congruence re

Some results on the set of congruence relations in a finite, strongly connected automaton

✍ P. Deussen 📂 Article 📅 1967 🏛 Springer Vienna 🌐 English ⚖ 714 KB

On the semigroup of endomorphisms of a f

On the semigroup of endomorphisms of a finite automaton

✍ V. Z. Amkhinich 📂 Article 📅 1971 🏛 Springer US 🌐 English ⚖ 134 KB

The Critical Spectrum of a Strongly Cont

The Critical Spectrum of a Strongly Continuous Semigroup

✍ Rainer Nagel; Jan Poland 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 132 KB

For a strongly continuous semigroup (T(t)) t 0 with generator A we introduce its critical spectrum \_ crit (T(t)). This yields in an optimal way the spectral mapping theorem \_(T(t))=e t\_(A) \_ \_ crit (T(t)) and improves classical stability results. 2000