13,323 research outputs found
The word problem distinguishes counter languages
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 .Comment: 8 page
On the Minimal Uncompletable Word Problem
Let S be a finite set of words over an alphabet Sigma. The set S is said to
be complete if every word w over the alphabet Sigma is a factor of some element
of S*, i.e. w belongs to Fact(S*). Otherwise if S is not complete, we are
interested in finding bounds on the minimal length of words in Sigma* which are
not elements of Fact(S*) in terms of the maximal length of words in S.Comment: 5 pages; added references, corrected typo
Groups with poly-context-free word problem
We consider the class of groups whose word problem is poly-context-free; that
is, an intersection of finitely many context-free languages. We show that any
group which is virtually a finitely generated subgroup of a direct product of
free groups has poly-context-free word problem, and conjecture that the
converse also holds. We prove our conjecture for several classes of soluble
groups, including metabelian groups and torsion-free soluble groups, and
present progress towards resolving the conjecture for soluble groups in
general. Some of the techniques introduced for proving languages not to be
poly-context-free may be of independent interest.Comment: 38 pages, no figure
- …