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

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

by Aldo de Luca,Stefano Varricchio

  • ISBN: 3540637710
  • Category: Technology
  • Author: Aldo de Luca,Stefano Varricchio
  • Subcategory: Programming
  • Other formats: txt rtf lrf azw
  • Language: English
  • Publisher: Springer; 1 edition (June 22, 1999)
  • Pages: 240 pages
  • FB2 size: 1535 kb
  • EPUB size: 1591 kb
  • Rating: 4.9
  • Votes: 254
Download Finiteness and Regularity in Semigroups and Formal Languages (Monographs in Theoretical Computer Science. An EATCS Series) fb2

Monographs in Theoretical Computer Science. Authors: Luca, Aldo de, Varricchio, Stefano.

Monographs in Theoretical Computer Science. The unavoidable regularities ofsufficiently large words over a finite alpha­ bet are very important in the study of finiteness conditions for semigroups. This problem consists in considering conditions which are satisfied by a fi­ nite semigroup and are such as to assure that a semigroup satisfying them is finite. The most natural requirement is that the semigroup is finitely gener­ ated.

Aldo de Luca, Stefano Varricchio. Authors and affiliations.

This is a rigorous and self-contained monograph on a central topic in theoretical computer science

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.

Cite this publication. The study of finiteness conditions for semigroups consists in giving some conditions which are satisfied by finite semigroups and which are such as to assure the finiteness of them. In this study one of the properties which is generally required of a semigroup is that of being finitely generated. Do you want to read the rest of this chapter? Request full-text.

This is a rigorous and self-contained monograph on a central topic in. .

book by Araldo De Luca. Luca, Aldo de, Varricchio, Stefano. Softcover reprint of the original 1st ed. 1999, X, 240 pp. Up to May 1993 with the title: EATCS Monographs on Theoretical Computer Science. Models and Algorithms of Time-Dependent Scheduling. Syntax-Directed Semantics. Formal Models Based on Tree Transducers. Fülöp, Zoltan, Vogler, Heiko.

A de Luca, A De Luca

A De Luca, S Varricchio. Springer Science & Business Media, 2012. A de Luca, A De Luca. Theoretical Computer Science 362 (1-3), 282-300, 2006. A De Luca, A Restivo. Information and Control 44 (3), 300-319, 1980.

by Aldo De Luca (Author), Stefano Varricchio (Author). Manufacturer warranty may not apply.

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.

Related to Finiteness and Regularity in Semigroups and Formal Languages (Monographs in Theoretical Computer Science. An EATCS Series) fb2 books: