%0 Journal Article %1 greibach1976a %A Greibach, S. A. %D 1976 %J Theoretical Computer Science %K computational polynomial languages; time offline; online; counter multicounter counters; complexity; machines; nondeterministic %N 4 %P 269--288 %T Remarks on the complexity of nondeterministic counter languages %V 1

@article{greibach1976a, added-at = {2006-03-09T08:15:35.000+0100}, author = {Greibach, S. A.}, bibdate = {Sat Nov 22 13:36:07 MST 1997}, biburl = {https://www.bibsonomy.org/bibtex/210660527acac847ae7905a5ad0bb83e2/snowball}, classification = {C4220 (Automata theory); C4240 (Programming and algorithm theory)}, coden = {TCSCDI}, corpsource = {Dept. of System Sci., Univ. of California, Los Angeles, CA, USA}, interhash = {73a5115b623278efc1513d24ac45bca2}, intrahash = {10660527acac847ae7905a5ad0bb83e2}, issn = {0304-3975}, journal = {Theoretical Computer Science}, keywords = {computational polynomial languages; time offline; online; counter multicounter counters; complexity; machines; nondeterministic}, month = {April}, number = 4, pages = {269--288}, pubcountry = {Netherlands}, timestamp = {2006-03-09T08:15:35.000+0100}, title = {Remarks on the complexity of nondeterministic counter languages}, treatment = {T Theoretical or Mathematical}, volume = 1, year = 1976 }