GlobalView

Showing items 1 - 3 of 3.

Add to Quick Collection   All 3 Results

  • First
  • Previous
  • 1
  • Next
  • Last
Sort:
 Add All Items to Quick Collection
Date: 2008
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.13/926900
Description: We study finitely generated groups whose word problems are accepted by counter automata. We show that a group has word problem accepted by a blind n-counter automaton in the sense of Greibach if and o... More
Full Text: Full Text
Reviewed: Reviewed
Image Thumbnail
Creators: Elder, Murray
Date: 2007
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.13/931353
Description: We consider how the languages of G-automata compare with other formal language classes. We prove that if the word problem of G is accepted by a machine in the class ℳ then the language of any G-automa... More
Full Text: Full Text
Reviewed: Reviewed
Image Thumbnail
Creators: Elder, Murray
Date: 2005
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.13/926875
Description: We give a language of unique geodesic normal forms for the Baumslag–Solitar group BS(1,2) that is context-free and 1-counter. We discuss the classes of context-free, 1-counter and counter languages, a... More
Full Text: Full Text
Reviewed: Reviewed
Image Thumbnail
  • First
  • Previous
  • 1
  • Next
  • Last