Languages accepted by automata with a counter
Loading...
Date
2013
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
University of Alabama Libraries
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.
Description
Electronic Thesis or Dissertation
Keywords
Mathematics