Obálkyknih.cz - Jihočeská vědecká knihovna v Českých Budějovicích

oprava existující anotace, přidání nové anotace

Název:		Finiteness and Regularity in Semigroups and Formal Languages (Monographs in Theoretical Computer Science. An EATCS Series)
Autor:
Rok vydání:		1999
Identifikátory:		9783540637714

Upravte stávající anotaci nebo vložte anotaci novou.
Anotace:	This is a rigorous and self-contained monograph on a central topic in theoretical computer science: finiteness conditions for semigroups and regularity conditions for formal languages. For the first time in book form, original results from the last ten years are presented, some previously unpublished, using combinatorial and algebraic methods. These are mainly based on combinatorics on words and especially on the theory of "unavoidable regularities" in free monoids. Many finiteness conditions are considered, formulated in terms of such concepts as: permutability, iteration, repetitivity, and chain conditions. These give rise to regularity conditions for formal languages. Non-algebraic regularity conditions are also investigated. A background in mathematics and computer science is required.
	Souhlasím s využitím anotace pro potřeby projektu obálkyknih.cz. Obsah neporušuje autorská práva.(povinné)