• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 36
  • 4
  • 4
  • 4
  • 4
  • 4
  • 4
  • 3
  • 1
  • 1
  • Tagged with
  • 48
  • 13
  • 11
  • 10
  • 10
  • 9
  • 9
  • 9
  • 9
  • 8
  • 8
  • 8
  • 8
  • 8
  • 8
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

Varieties of graph congruences

Weiss, Alex. January 1984 (has links)
Graph-monoids are introduced as algebraic objects which correspond to congruences over graphs. Varieties are defined, and a one-to-one correspondence between varieties of graph-monoids and varieties of graph-congruences is demonstrated. This is viewed as a generalization of the known correspondence between monoid varieties and congruence varieties. Some classification and effective characterizations of graph-monoid varieties are obtained. These are used to decide membership in the wreath product of certain monoids varieties and the variety of definite semigroups.
2

Membership testing in transformation monoids

Beaudry, Martin January 1987 (has links)
Given a finite set X of states, a finite set of transformations of X (generators), and another transformation f of X, we analyze the complexity of the membership problem, which consists in deciding whether f can be obtained by composition of the generators. This problem is studied for various classes (pseudovarieties) of monoids. It is shown that the complexity is NP-hard for monoids of threshold 2 or more, and NP-complete in commutative, J- and R-trivial monoids. For idempotent monoids (aperiodic of threshold one), the problem is NP-complete in the general case; subcases are analyzed, and a largest class of aperiodic monoids is identified for which the problem is in FL, as well as a largest class for which the problem is not NP-hard. / The problem which consists in characterizing an idempotent monoid is also addressed: given a set of transformations, it can be decided in NC$ sp2$ whether the monoid they generate is idempotent. Similar tests are given for three subclasses of idempotent monoids: R$ sb1$, L$ sb1$, and N$ sb3$; in all three cases, the complexity is NC$ sp1$. / A sequential upper bound is also given for each of the parallel complexities given above.
3

Membership testing in transformation monoids

Beaudry, Martin January 1987 (has links)
No description available.
4

Varieties of graph congruences

Weiss, Alex. January 1984 (has links)
No description available.
5

Abelian Monoids

Cooper, Dale Stephen 10 1900 (has links)
<p> This thesis makes a small study of various kinds of submonoids of abelian monoids, of the lattice of submonoids of an abelian monoid, and of the concept of unique factorization in abelian monoids. Also, the main concepts in category theory are examined in the special case of the category of abelian monoids and some of its subcategories. </p> / Thesis / Master of Science (MSc)
6

Singular braids and links

Keyman, Fatma Ebru January 1997 (has links)
No description available.
7

Categorical approach to automata theory

Sznajder-Glodowski, Malgorzata January 1986 (has links)
No description available.
8

On arithmetic in free monoids.

Zeamer, Richard Warwick January 1972 (has links)
No description available.
9

Some decision problems in group theory

James, Justin A. January 1900 (has links)
Thesis (Ph.D.)--University of Nebraska-Lincoln, 2006. / Title from title screen (site viewed on Sep. 12, 2006). PDF text of dissertation: 109 p. : ill. ; 0.71Mb. UMI publication number: AAT 3208081. Includes bibliographical references. Also available in microfilm, microfiche and paper format.
10

Categorical approach to automata theory

Sznajder-Glodowski, Malgorzata January 1986 (has links)
No description available.

Page generated in 0.0364 seconds