Finiteness and Regularity in Semigroups and Formal Languages (EATCS Monographs in Theoretical Computer Science) - Tapa dura

De Luca, A.; Carricchio, S.

 
9783540637714: Finiteness and Regularity in Semigroups and Formal Languages (EATCS Monographs in Theoretical Computer Science)
Tapa dura
ISBN 10: 3540637710 ISBN 13: 9783540637714
Editorial: Springer-Verlag Berlin and Heidelberg GmbH & Co. K, 1998

Sinopsis

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.

"Sinopsis" puede pertenecer a otra edición de este libro.

Reseña del editor

This is a rigorous and self-contained monograph on a central topic in theoretical computer science. 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." Researchers will find important new results on semigroups and formal languages, as well as various applications for these methods.

Reseña del editor

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.

"Sobre este título" puede pertenecer a otra edición de este libro.

Editorial
Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Año de publicación
1998
Idioma
Inglés
ISBN 10 
3540637710
ISBN 13 
9783540637714
Encuadernación
Tapa dura
Número de páginas
250
Contacto del fabricante
no disponible
Persona responsable
CMN Printpool Inh. Mathis Neumann
https://www.also.com/ec/cms5/en_6000/6000/index.jsp

Friedrich-Karl-Str. 9
Hamburg
Alemania

Otras ediciones populares con el mismo título

9783642641503: Finiteness and Regularity in Semigroups and Formal Languages (Monographs in Theoretical Computer Science. An EATCS Series)

Edición Destacada

ISBN 10:  3642641504 ISBN 13:  9783642641503
Editorial: Springer, 2011
Tapa blanda