On groups whose word problem is solved by a nested stack automaton

Mathematics – Group Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

16 pages

Scientific paper

Accessible groups for which the language of all words defining the identity
is accepted by a certain class of nested stack automata are virtually free.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

On groups whose word problem is solved by a nested stack automaton 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 On groups whose word problem is solved by a nested stack automaton, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On groups whose word problem is solved by a nested stack automaton will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-236513

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.