dc.contributor |
Dixon, Martyn R. |
|
dc.contributor |
Evans, Martin J. |
|
dc.contributor |
Stern, Allen B. |
|
dc.contributor |
Trace, Bruce S. |
|
dc.contributor.advisor |
Corson, Jon M. |
|
dc.contributor.author |
Ross, James Lance |
|
dc.date.accessioned |
2017-03-01T16:46:38Z |
|
dc.date.available |
2017-03-01T16:46:38Z |
|
dc.date.issued |
2013 |
|
dc.identifier.other |
u0015_0000001_0001165 |
|
dc.identifier.other |
Ross_alatus_0004D_11458 |
|
dc.identifier.uri |
https://ir.ua.edu/handle/123456789/1642 |
|
dc.description |
Electronic Thesis or Dissertation |
|
dc.description.abstract |
Automata with counter monoids, grammars and automata, context sensitive languages and word problems are examined. Included are: the non-existence of a classifying counter language for context sensitive languages, a method of forming a grammar for a language given an automaton that accepts the language, and closure properties of free products. The main result involves a form of counter that is closed under free products of word problems. |
|
dc.format.extent |
43 p. |
|
dc.format.medium |
electronic |
|
dc.format.mimetype |
application/pdf |
|
dc.language |
English |
|
dc.language.iso |
en_US |
|
dc.publisher |
University of Alabama Libraries |
|
dc.relation.ispartof |
The University of Alabama Electronic Theses and Dissertations |
|
dc.relation.ispartof |
The University of Alabama Libraries Digital Collections |
|
dc.relation.hasversion |
born digital |
|
dc.rights |
All rights reserved by the author unless otherwise indicated. |
|
dc.subject.other |
Mathematics |
|
dc.title |
Languages accepted by automata with a counter |
|
dc.type |
thesis |
|
dc.type |
text |
|
etdms.degree.department |
University of Alabama. Dept. of Mathematics |
|
etdms.degree.discipline |
Mathematics |
|
etdms.degree.grantor |
The University of Alabama |
|
etdms.degree.level |
doctoral |
|
etdms.degree.name |
Ph.D. |
|