Skip to main content Accessibility help
×
Hostname: page-component-cd9895bd7-p9bg8 Total loading time: 0 Render date: 2024-12-29T09:50:20.157Z Has data issue: false hasContentIssue false

G-automata, counter languages and the Chomsky hierarchy

Published online by Cambridge University Press:  07 May 2010

Murray Elder
Affiliation:
School of Mathematics and Statistics, University of St Andrews, Scotland
C. M. Campbell
Affiliation:
University of St Andrews, Scotland
M. R. Quick
Affiliation:
University of St Andrews, Scotland
E. F. Robertson
Affiliation:
University of St Andrews, Scotland
G. C. Smith
Affiliation:
University of Bath
Get access

Summary

Abstract

We consider how the languages of G-automata compare with other formal language classes. We prove that if the word problem of G is accepted by a machine in the class then the language of any G-automaton is in the class. It follows that the so called counter languages (languages of n-automata) are context-sensitive, and further that counter languages are indexed if and only if the word problem for n is indexed.

AMS Classification: 20F65, 20F10, 68Q45

Keywords: G-automaton; counter language; word problem for groups; Chomsky hierarchy

Introduction

In this article we compare the languages of G-automata, which include the set of counter languages, with the formal language classes of context-sensitive, indexed, context-free and regular. We prove in Theorem 6 that if the word problem of G is accepted by a machine in the class M then the language of any G-automaton is in the class M. It follows that the counter languages (languages of n-automata) are context-sensitive. Moreover it follows that counter languages are indexed if and only if the word problem for n is indexed.

The article is organized as follows. In Section 2 we define G-automata, linearly bounded automata, nested stack, stack, and pushdown automata, and the word problem for a finitely generated group. In Section 3 we prove the main theorem, and give the corollary that counter languages are indexed if and only if the word problem for ℤn is indexed for all n.

Type
Chapter
Information
Publisher: Cambridge University Press
Print publication year: 2007

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Save book to Kindle

To save this book to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

Available formats
×