Publisher
Springer Berlin Heidelberg
Reference9 articles.
1. Fischer, P.C., Meyer, A.R., Rosenberg, A.L.: Counter machines and counter languages. Mathematical Systems Theory 2, 265–283 (1968)
2. Greibach, S.A.: Remarks on the complexity of nondeterministic counter languages. Theoretical Computer Science 1, 269–288 (1976)
3. Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation, 3rd edn. Pearson, London (2007)
4. Hromkovič, J., Schnitger, G.: On the power of randomized multicounter machines. Theoretical Computer Science 330, 135–144 (2005)
5. Laing, R.: Realization and complexity of commutative events. Technical Report 03105-48-T, University of Michigan (1967)