Automata-theoretic tools have been deeply utilized in literature for studying algebraic matters, in particular free monoids and free groups. In this book we propose to study finitely generated submonoids of free monoids and finitely generated subgroups of free groups, and their intersection. Free monoids play an important role in combinatorics on words and in formal language theory. The study of submonoids of free monoids has been deepened by using combinatorial and automata methods in the setting of the theory of variable-length codes, started by M.P.Schützenberger. We investigate the intersection of two finitely generated submonoids of the free monoid on a finite alphabet by using an automata-theoretic approach. For what concerns free groups, several open problems have been solved and moreover several algorithms concerning group’s problems have been optimized using automata. We focus on algorithms constructing particular bases for a subgroup of a free group and in particular strongly reduced Nielsen bases. Using inverse automata we furnish two algorithms for the construction of a strongly Nielsen basis for a finitely generated subgroup.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Laura Giambruno is a researcher interested in different fields of computer science like language theory, combinatorics, algorithms on words.. After the attainment of the degree in mathematics and the Ph.D. in computer science, supported by various post-docs, she visited different laboratories in Italy and France acquiring a wide experience.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
Anbieter: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Deutschland
Taschenbuch. Zustand: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Automata-theoretic tools have been deeply utilized in literature for studying algebraic matters, in particular free monoids and free groups. In this book we propose to study finitely generated submonoids of free monoids and finitely generated subgroups of free groups, and their intersection. Free monoids play an important role in combinatorics on words and in formal language theory. The study of submonoids of free monoids has been deepened by using combinatorial and automata methods in the setting of the theory of variable-length codes, started by M.P.Schützenberger. We investigate the intersection of two finitely generated submonoids of the free monoid on a finite alphabet by using an automata-theoretic approach. For what concerns free groups, several open problems have been solved and moreover several algorithms concerning group's problems have been optimized using automata. We focus on algorithms constructing particular bases for a subgroup of a free group and in particular strongly reduced Nielsen bases. Using inverse automata we furnish two algorithms for the construction of a strongly Nielsen basis for a finitely generated subgroup. 128 pp. Englisch. Bestandsnummer des Verkäufers 9783848431656
Anzahl: 2 verfügbar
Anbieter: Books Puddle, New York, NY, USA
Zustand: New. pp. 128. Bestandsnummer des Verkäufers 26127774218
Anzahl: 4 verfügbar
Anbieter: moluna, Greven, Deutschland
Zustand: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Giambruno LauraLaura Giambruno is a researcher interested in different fields of computer science like language theory, combinatorics, algorithms on words. After the attainment of the degree in mathematics and the Ph.D. in computer . Bestandsnummer des Verkäufers 5521708
Anzahl: Mehr als 20 verfügbar
Anbieter: Majestic Books, Hounslow, Vereinigtes Königreich
Zustand: New. Print on Demand pp. 128 2:B&W 6 x 9 in or 229 x 152 mm Perfect Bound on Creme w/Gloss Lam. Bestandsnummer des Verkäufers 132780501
Anzahl: 4 verfügbar
Anbieter: Biblios, Frankfurt am main, HESSE, Deutschland
Zustand: New. PRINT ON DEMAND pp. 128. Bestandsnummer des Verkäufers 18127774208
Anzahl: 4 verfügbar
Anbieter: buchversandmimpf2000, Emtmannsberg, BAYE, Deutschland
Taschenbuch. Zustand: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Automata-theoretic tools have been deeply utilized in literature for studying algebraic matters, in particular free monoids and free groups. In this book we propose to study finitely generated submonoids of free monoids and finitely generated subgroups of free groups, and their intersection. Free monoids play an important role in combinatorics on words and in formal language theory. The study of submonoids of free monoids has been deepened by using combinatorial and automata methods in the setting of the theory of variable-length codes, started by M.P.Schützenberger. We investigate the intersection of two finitely generated submonoids of the free monoid on a finite alphabet by using an automata-theoretic approach. For what concerns free groups, several open problems have been solved and moreover several algorithms concerning group's problems have been optimized using automata. We focus on algorithms constructing particular bases for a subgroup of a free group and in particular strongly reduced Nielsen bases. Using inverse automata we furnish two algorithms for the construction of a strongly Nielsen basis for a finitely generated subgroup.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 128 pp. Englisch. Bestandsnummer des Verkäufers 9783848431656
Anzahl: 1 verfügbar
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Taschenbuch. Zustand: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Automata-theoretic tools have been deeply utilized in literature for studying algebraic matters, in particular free monoids and free groups. In this book we propose to study finitely generated submonoids of free monoids and finitely generated subgroups of free groups, and their intersection. Free monoids play an important role in combinatorics on words and in formal language theory. The study of submonoids of free monoids has been deepened by using combinatorial and automata methods in the setting of the theory of variable-length codes, started by M.P.Schützenberger. We investigate the intersection of two finitely generated submonoids of the free monoid on a finite alphabet by using an automata-theoretic approach. For what concerns free groups, several open problems have been solved and moreover several algorithms concerning group's problems have been optimized using automata. We focus on algorithms constructing particular bases for a subgroup of a free group and in particular strongly reduced Nielsen bases. Using inverse automata we furnish two algorithms for the construction of a strongly Nielsen basis for a finitely generated subgroup. Bestandsnummer des Verkäufers 9783848431656
Anzahl: 1 verfügbar