Finiteness and Regularity in Semigroups and Formal Languages (Monographs in Theoretical Computer Science. An EATCS Series) - Softcover
Inhaltsangabe
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.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Weitere beliebte Ausgaben desselben Titels
Suchergebnisse für Finiteness and Regularity in Semigroups and Formal...
Beispielbild für diese ISBN
Finiteness and Regularity in Semigroups and Formal Languages (eng)
Print-on-DemandAnbieter: Brook Bookstore On Demand, Napoli, NA, Italien
Verkäuferbewertung 3 von 5 Sternen
Zustand: new. Questo è un articolo print on demand. Bestandsnummer des Verkäufers CRE7KOUTHR
Neu kaufen
EUR 86,24
EUR 5,50 Versand
Versand von Italien nach USA
Versand von Italien nach USA
Anzahl: Mehr als 20 verfügbar
Beispielbild für diese ISBN
Finiteness and Regularity in Semigroups and Formal Languages (Monographs in Theoretical Computer Science. An EATCS Series)
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. In. Bestandsnummer des Verkäufers ria9783642641503_new
Neu kaufen
EUR 115,41
EUR 13,86 Versand
Versand von Vereinigtes Königreich nach USA
Versand von Vereinigtes Königreich nach USA
Anzahl: Mehr als 20 verfügbar
Foto des Verkäufers
Finiteness and Regularity in Semigroups and Formal Languages
Verlag:
Springer Berlin Heidelberg Sep 2011, 2011
ISBN 10: 3642641504
ISBN 13: 9783642641503
Neu
Taschenbuch
Anbieter: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Taschenbuch. Zustand: 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. Bestandsnummer des Verkäufers 9783642641503
Neu kaufen
EUR 106,99
EUR 23,00 Versand
Versand von Deutschland nach USA
Versand von Deutschland nach USA
Anzahl: 2 verfügbar
Foto des Verkäufers
Finiteness and Regularity in Semigroups and Formal Languages
Print-on-DemandAnbieter: moluna, Greven, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Zustand: 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. Bestandsnummer des Verkäufers 5066399
Neu kaufen
EUR 92,27
EUR 48,99 Versand
Versand von Deutschland nach USA
Versand von Deutschland nach USA
Anzahl: Mehr als 20 verfügbar
Beispielbild für diese ISBN
Finiteness and Regularity in Semigroups and Formal Languages
Anbieter: Books Puddle, New York, NY, USA
Verkäuferbewertung 4 von 5 Sternen
Zustand: New. pp. 256. Bestandsnummer des Verkäufers 2658595014
Neu kaufen
EUR 142,66
EUR 3,44 Versand
Versand innerhalb von USA
Versand innerhalb von USA
Anzahl: 4 verfügbar
Beispielbild für diese ISBN
Finiteness and Regularity in Semigroups and Formal Languages
Print-on-DemandAnbieter: Majestic Books, Hounslow, Vereinigtes Königreich
Verkäuferbewertung 4 von 5 Sternen
Zustand: 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. Bestandsnummer des Verkäufers 50964761
Neu kaufen
EUR 147,79
EUR 7,52 Versand
Versand von Vereinigtes Königreich nach USA
Versand von Vereinigtes Königreich nach USA
Anzahl: 4 verfügbar
Beispielbild für diese ISBN
Finiteness and Regularity in Semigroups and Formal Languages
Print-on-DemandAnbieter: Biblios, Frankfurt am main, HESSE, Deutschland
Verkäuferbewertung 4 von 5 Sternen
Zustand: New. PRINT ON DEMAND pp. 256. Bestandsnummer des Verkäufers 1858595020
Neu kaufen
EUR 148,96
EUR 9,95 Versand
Versand von Deutschland nach USA
Versand von Deutschland nach USA
Anzahl: 4 verfügbar
Foto des Verkäufers
Finiteness and Regularity in Semigroups and Formal Languages
Verlag:
Springer, Springer Gabler Sep 2011, 2011
ISBN 10: 3642641504
ISBN 13: 9783642641503
Neu
Taschenbuch
Anbieter: buchversandmimpf2000, Emtmannsberg, BAYE, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Taschenbuch. Zustand: 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. Bestandsnummer des Verkäufers 9783642641503
Neu kaufen
EUR 106,99
EUR 60,00 Versand
Versand von Deutschland nach USA
Versand von Deutschland nach USA
Anzahl: 1 verfügbar
Foto des Verkäufers
Finiteness and Regularity in Semigroups and Formal Languages
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Taschenbuch. Zustand: 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. Bestandsnummer des Verkäufers 9783642641503
Neu kaufen
EUR 106,99
EUR 61,97 Versand
Versand von Deutschland nach USA
Versand von Deutschland nach USA
Anzahl: 1 verfügbar