The word problem distinguishes counter languages
群论
2007-05-23 v1
摘要
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 is accepted by a nondeterministic -counter automaton if and only if .
引用
@article{arxiv.math/0606415,
title = {The word problem distinguishes counter languages},
author = {Sean Cleary and Murray Elder and Gretchen Ostheimer},
journal= {arXiv preprint arXiv:math/0606415},
year = {2007}
}
备注
8 pages