The word problem distinguishes counter languages

Details The word problem distinguishes counter languages The word problem distinguishes counter languages

2006-06-17

arxiv.org/abs/math/0606415v1

Mathematics

Group Theory

8 pages

Scientific paper

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$.

Affiliated with

Also associated with

No associations

Rating

The word problem distinguishes counter languages does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The word problem distinguishes counter languages, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The word problem distinguishes counter languages will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-65739