Finiteness and Regularity in Semigroups and Formal Languages (Monographs in Theoretical Computer Science. An EATCS Series) - Softcover
Synopsis
The aim of this monograph is to present some recent research work on the combinatorial aspects of the theory of semigroups which are of great inter est for both algebra and theoretical computer science. This research mainly concerns that part of combinatorics of finite and infinite words over a finite alphabet which is usually called the theory of "unavoidable" regularities. 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. Ifone supposes that the semigroup is also periodic the study offiniteness conditions for these semigroups (or groups) is called the Burnside problem for semigroups (or groups). There exists an important relationship with the theory of finite automata because, as is well known, a language L over a fi nite alphabet is regular (that is, recognizable by a finite automaton) if and only if its syntactic monoid S(L) is finite. Hence, in principle, any finite ness condition for semigroups can be translated into a regularity condition for languages. The study of finiteness conditions for periodic languages (Le. , such that the syntactic semigroup is periodic) has been called the Burnside problem for languages.
"synopsis" may belong to another edition of this title.
Other Popular Editions of the Same Title
Search results for Finiteness and Regularity in Semigroups and Formal...
Stock Image
Finiteness and Regularity in Semigroups and Formal Languages (eng)
Print on DemandSeller: Brook Bookstore On Demand, Napoli, NA, Italy
Seller rating 3 out of 5 stars
Condition: new. Questo è un articolo print on demand. Seller Inventory # CRE7KOUTHR
Buy New
US$ 103.13
US$ 6.39 shipping
Ships from Italy to U.S.A.
Ships from Italy to U.S.A.
Quantity: Over 20 available
Stock Image
Finiteness and Regularity in Semigroups and Formal Languages (Monographs in Theoretical Computer Science. An EATCS Series)
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. In. Seller Inventory # ria9783642641503_new
Buy New
US$ 133.99
US$ 16.09 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: Over 20 available
Seller Image
Finiteness and Regularity in Semigroups and Formal Languages
Published by
Springer Berlin Heidelberg Sep 2011, 2011
ISBN 10: 3642641504
ISBN 13: 9783642641503
New
Taschenbuch
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 256 pp. Englisch. Seller Inventory # 9783642641503
Buy New
US$ 127.94
US$ 26.70 shipping
Ships from Germany to U.S.A.
Ships from Germany to U.S.A.
Quantity: 2 available
Stock Image
Finiteness and Regularity in Semigroups and Formal Languages
Seller: Books Puddle, New York, NY, U.S.A.
Seller rating 4 out of 5 stars
Condition: New. pp. 256. Seller Inventory # 2658595014
Seller Image
Finiteness and Regularity in Semigroups and Formal Languages
Published by
Springer Berlin Heidelberg, 2011
ISBN 10: 3642641504
ISBN 13: 9783642641503
New
Softcover
Seller: moluna, Greven, Germany
Seller rating 5 out of 5 stars
Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Rigorous presentation of latest research results A unique and definitive monograph on a central subject in theoretical computer science with various applications A must for all experts in theoretical computer science and combinatorics Self-contained account. Seller Inventory # 5066399
Buy New
US$ 110.34
US$ 56.88 shipping
Ships from Germany to U.S.A.
Ships from Germany to U.S.A.
Quantity: Over 20 available
Stock Image
Finiteness and Regularity in Semigroups and Formal Languages
Print on DemandSeller: Majestic Books, Hounslow, United Kingdom
Seller rating 4 out of 5 stars
Condition: New. Print on Demand pp. 256 49:B&W 6.14 x 9.21 in or 234 x 156 mm (Royal 8vo) Perfect Bound on White w/Gloss Lam. Seller Inventory # 50964761
Buy New
US$ 166.58
US$ 8.73 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 4 available
Stock Image
Finiteness and Regularity in Semigroups and Formal Languages
Print on DemandSeller: Biblios, Frankfurt am main, HESSE, Germany
Seller rating 4 out of 5 stars
Condition: New. PRINT ON DEMAND pp. 256. Seller Inventory # 1858595020
Buy New
US$ 178.13
US$ 11.55 shipping
Ships from Germany to U.S.A.
Ships from Germany to U.S.A.
Quantity: 4 available
Seller Image
Finiteness and Regularity in Semigroups and Formal Languages
Published by
Springer, Springer Gabler Sep 2011, 2011
ISBN 10: 3642641504
ISBN 13: 9783642641503
New
Taschenbuch
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -The aim of this monograph is to present some recent research work on the combinatorial aspects of the theory of semigroups which are of great inter est for both algebra and theoretical computer science. This research mainly concerns that part of combinatorics of finite and infinite words over a finite alphabet which is usually called the theory of 'unavoidable' regularities. 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. Ifone supposes that the semigroup is also periodic the study offiniteness conditions for these semigroups (or groups) is called the Burnside problem for semigroups (or groups). There exists an important relationship with the theory of finite automata because, as is well known, a language L over a fi nite alphabet is regular (that is, recognizable by a finite automaton) if and only if its syntactic monoid S(L) is finite. Hence, in principle, any finite ness condition for semigroups can be translated into a regularity condition for languages. The study of finiteness conditions for periodic languages (Le. , such that the syntactic semigroup is periodic) has been called the Burnside problem for languages.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 256 pp. Englisch. Seller Inventory # 9783642641503
Buy New
US$ 127.94
US$ 69.66 shipping
Ships from Germany to U.S.A.
Ships from Germany to U.S.A.
Quantity: 1 available
Seller Image
Finiteness and Regularity in Semigroups and Formal Languages
Published by
Springer Berlin Heidelberg, 2011
ISBN 10: 3642641504
ISBN 13: 9783642641503
New
Taschenbuch
Seller: AHA-BUCH GmbH, Einbeck, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - The aim of this monograph is to present some recent research work on the combinatorial aspects of the theory of semigroups which are of great inter est for both algebra and theoretical computer science. This research mainly concerns that part of combinatorics of finite and infinite words over a finite alphabet which is usually called the theory of 'unavoidable' regularities. 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. Ifone supposes that the semigroup is also periodic the study offiniteness conditions for these semigroups (or groups) is called the Burnside problem for semigroups (or groups). There exists an important relationship with the theory of finite automata because, as is well known, a language L over a fi nite alphabet is regular (that is, recognizable by a finite automaton) if and only if its syntactic monoid S(L) is finite. Hence, in principle, any finite ness condition for semigroups can be translated into a regularity condition for languages. The study of finiteness conditions for periodic languages (Le. , such that the syntactic semigroup is periodic) has been called the Burnside problem for languages. Seller Inventory # 9783642641503
Buy New
US$ 127.94
US$ 71.95 shipping
Ships from Germany to U.S.A.
Ships from Germany to U.S.A.
Quantity: 1 available