Thesis (M.S.)--Virginia Polytechnic Institute and State University, 1994. / Vita. Abstract. Includes bibliographical references (leaves 164-168). Also available via the Internet.

Thesis--Bonn. / Extra t.p. with thesis statement inserted. Includes bibliographical references (p. 107-108).

Thesis (D. Min.)--Gordon-Conwell Theological Seminary, 2006. / Abstract and vita. Includes bibliographical references (leaves 245-249).

Thesis--Bonn. / Extra t.p. with thesis statement inserted. Includes bibliographical references (p. 107-108).

Thesis (Ph. D.)--University of Wisconsin--Madison, 1983. / Typescript. Vita. eContent provider-neutral record in process. Description based on print version record. Includes bibliographical references (leaves 112-113).

Thesis (M.S.)--Tennessee Technological University, 2009. / Title from title page screen (viewed on Aug. 26, 2009). Bibliography: leaves 50-51.

Thesis (Ph. D.)--University of Wisconsin--Madison, 1982. / Typescript. Vita. eContent provider-neutral record in process. Description based on print version record. Includes bibliographical references (leaf 132).

A dissertation submitted to the Faculty of Science, University of the Witwatersrand, Johannesburg, in fulfilment of requirements for the degree of Master of Science. December 2014. / Let G be a finite group and let r ∈ N. A coloring of G is any mapping : G −→ {1, 2, 3, ..., r}. Colorings of G, and are equivalent if there exists an element g in G such that (xg−1) = (x) for all x in G. A coloring of a finite group G is called symmetric with respect to an element g in G if (gx−1g) = (x) for all x ∈ G. We derive formulae for computing the number of symmetric colorings and the number of equivalence classes of symmetric colorings for some classes of finite groups

This dissertation is devoted to the groups generated by automata. The first part of the dissertation deals with L-presentations for such groups. We describe the sufficient condition for an essentially free automaton group to have an L-presentation. We also find the L-presentation for several other groups generated by three-state automata, and we describe the defining relations in the Grigorchuk groups G_w. In case when the sequence w is almost periodic these relations provide an L-presentation for the group G_w. We also describe defining relations in the series of groups which contain Grigorchuk-Erschler group and the group of iterated monodromies of the polynomial z^2 + i. The second part of the dissertation considers groups generated by 3-state automata over the alphabet of 2 letters and 2-state automata over the 3-letter alphabet. We continue the classification work started by the research group at Texas A&M University ([BGK+07a, BGK+07b]) and further reduce the number of pairwise nonisomorphic groups generated by 3-state automata over the 2-letter alphabet. We also study the groups generated by 2-state automata over the 3-letter alphabet and obtain a number of classification results for this class of group.

Thesis (Ph.D.)--Hong Kong University of Science and Technology, 2004. / Includes bibliographical references (leaves 75-76). Also available in electronic version. Access restricted to campus users.