東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

Groups and semigroups generated by a...

McCune, David.

Linked to FindBook

Google Book

Amazon

博客來

Groups and semigroups generated by automata.

Record Type:	Language materials, printed : Monograph/item
Title/Author:	Groups and semigroups generated by automata./
Author:	McCune, David.
Description:	100 p.
Notes:	Source: Dissertation Abstracts International, Volume: 72-06, Section: B, page: .
Contained By:	Dissertation Abstracts International72-06B.
Subject:	Mathematics. -
Online resource:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3450101
ISBN:	9781124584096

Groups and semigroups generated by automata.
McCune, David.

Groups and semigroups generated by automata. - 100 p.

Source: Dissertation Abstracts International, Volume: 72-06, Section: B, page: .

Thesis (Ph.D.)--The University of Nebraska - Lincoln, 2011.

In this dissertation we classify the metabelian groups arising from a restricted class of invertible synchronous automata over a binary alphabet. We give faithful, self-similar actions of Heisenberg groups and upper triangular matrix groups. We introduce a new class of semigroups given by a restricted class of asynchronous automata. We call these semigroups "expanding automaton semigroups". We show that this class strictly contains the class of automaton semigroups, and we show that the class of asynchronous automaton semigroups strictly contains the class of expanding automaton semigroups. We demonstrate that undecidability arises in the actions of expanding automaton semigroups and semigroups arising from asynchronous automata on regular rooted trees. In particular, we show that one cannot decide whether or not an element of an asynchronous automaton semigroup has a fixed point. We show that expanding automaton semigroups are residually finite, while semigroups given by asynchronous automata need not be. We show that the class of expanding automaton semigroups is not closed under taking normal ideal extensions, but the class of semigroups given by asynchronous automata is closed under taking normal ideal extensions. We show that the class of expanding automaton semigroups is closed under taking direct products, provided that the direct product is finitely generated. We show that the class of automaton semigroups is not closed under passing to residually finite Rees quotients. We show that every partially commutative monoid is an automaton semigroup, and every partially commutative semigroup is an expanding automaton semigroup.

ISBN: 9781124584096Subjects--Topical Terms:

515831
Mathematics.

Groups and semigroups generated by automata.
LDR:02713nam 2200313 4500 001 1404213
005 20111121111329.5
008 130515s2011 ||||||||||||||||| ||eng d
020 $a 9781124584096
035 $a (UMI)AAI3450101
035 $a AAI3450101
040 $a UMI $c UMI
100 1 $a McCune, David. $3 1683522
245 1 0 $a Groups and semigroups generated by automata.
300 $a 100 p.
500 $a Source: Dissertation Abstracts International, Volume: 72-06, Section: B, page: .
500 $a Advisers: Susan Hermiller; John Meakin.
502 $a Thesis (Ph.D.)--The University of Nebraska - Lincoln, 2011.
520 $a In this dissertation we classify the metabelian groups arising from a restricted class of invertible synchronous automata over a binary alphabet. We give faithful, self-similar actions of Heisenberg groups and upper triangular matrix groups. We introduce a new class of semigroups given by a restricted class of asynchronous automata. We call these semigroups "expanding automaton semigroups". We show that this class strictly contains the class of automaton semigroups, and we show that the class of asynchronous automaton semigroups strictly contains the class of expanding automaton semigroups. We demonstrate that undecidability arises in the actions of expanding automaton semigroups and semigroups arising from asynchronous automata on regular rooted trees. In particular, we show that one cannot decide whether or not an element of an asynchronous automaton semigroup has a fixed point. We show that expanding automaton semigroups are residually finite, while semigroups given by asynchronous automata need not be. We show that the class of expanding automaton semigroups is not closed under taking normal ideal extensions, but the class of semigroups given by asynchronous automata is closed under taking normal ideal extensions. We show that the class of expanding automaton semigroups is closed under taking direct products, provided that the direct product is finitely generated. We show that the class of automaton semigroups is not closed under passing to residually finite Rees quotients. We show that every partially commutative monoid is an automaton semigroup, and every partially commutative semigroup is an expanding automaton semigroup.
590 $a School code: 0138.
650 4 $a Mathematics. $3 515831
690 $a 0405
710 2 $a The University of Nebraska - Lincoln. $b Mathematics. $3 1030689
773 0 $t Dissertation Abstracts International $g 72-06B.
790 1 0 $a Hermiller, Susan, $e advisor
790 1 0 $a Meakin, John, $e advisor
790 1 0 $a Brittenham, Mark $e committee member
790 1 0 $a Radcliffe, Jamie $e committee member
790 1 0 $a Variyam, Vinodchandran $e committee member
790 $a 0138
791 $a Ph.D.
792 $a 2011
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3450101