The word problem distinguishes counter languages

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

Counter automata are more powerful versions of finite-state automata where addition and subtraction operations are permitted on a set of n integer registers, called counters. We show that the word problem of $\Z^n$ is accepted by a nondeterministic $m$-counter automaton if and only if $m \geq n$.
8 pages

Keywords

Group Theory, 20F10, 68Q45

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/113921

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0606415
 http://arxiv.org/abs/math/0606415

Collections

arXiv