Home > Search Results: Elder, Murray
  Search Tips
Advanced Search
Search collections:
Sort by: Display results: Output format:
Results overview: Found 1 records in 0.02 seconds.
Research literature, 1 records found
Research literature 1 records found  
1.
7 p, 157.8 KB The word problem distinguishes counter languages / Cleary, Sean ; Elder, Murray ; Ostheimer, Gretchen ; Centre de Recerca Matemàtica
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 Zn is accepted by a nondeterministic m-counter automaton if and only if m >= n.
Centre de Recerca Matemàtica 2006 (Prepublicacions del Centre de Recerca Matemàtica ; 695)  
Detailed record - Creative Commons

Interested in being notified about new results for this query?
Set up a personal email alert or subscribe to the RSS feed.
UAB Digital Repository of Documents :: Search :: Submit :: Personalize :: Help
Powered by Invenio v1.1.6
Maintained by ddd.bib@uab.cat  :: Metadata license:
Working with