@article{ITA_1975__9_2_5_0, author = {Greibach, S. A.}, title = {A note on the recognition of one counter languages}, journal = {Revue fran\c{c}aise d'automatique informatique recherche op\'erationnelle. Informatique th\'eorique}, pages = {5--12}, publisher = {Dunod-Gauthier-Villars}, address = {Paris}, volume = {9}, number = {R2}, year = {1975}, mrnumber = {391578}, language = {en}, url = {http://www.numdam.org/item/ITA_1975__9_2_5_0/} }
TY - JOUR AU - Greibach, S. A. TI - A note on the recognition of one counter languages JO - Revue française d'automatique informatique recherche opérationnelle. Informatique théorique PY - 1975 SP - 5 EP - 12 VL - 9 IS - R2 PB - Dunod-Gauthier-Villars PP - Paris UR - http://www.numdam.org/item/ITA_1975__9_2_5_0/ LA - en ID - ITA_1975__9_2_5_0 ER -
%0 Journal Article %A Greibach, S. A. %T A note on the recognition of one counter languages %J Revue française d'automatique informatique recherche opérationnelle. Informatique théorique %D 1975 %P 5-12 %V 9 %N R2 %I Dunod-Gauthier-Villars %C Paris %U http://www.numdam.org/item/ITA_1975__9_2_5_0/ %G en %F ITA_1975__9_2_5_0
Greibach, S. A. A note on the recognition of one counter languages. Revue française d'automatique informatique recherche opérationnelle. Informatique théorique, Tome 9 (1975) no. R2, pp. 5-12. http://www.numdam.org/item/ITA_1975__9_2_5_0/
[1]Recognition and parsing of context-free languages in time n3, Information and Control, (1967), 10, 189-208. | Zbl
,[2]Memory bounds for recognition of context-free and context-sensitive languages, IEEE Conference Record on Switching Circuit Theory and Logical Design, Ann. Arbor, Michigan, 1965, 191-202. | Zbl
, and ,[3] The Hardest Context-free Language, SIAM J. Computing, (1973), 2, 304-310. | Zbl
,[4] A note on computing time for recognition of languages generated by linear grammars, Information and Control, (1967), 10, 209-214. | Zbl
,[5] Time and tape complexity of pushdown automaton languages, Information and Control, (1968), 13, 186-206. | Zbl
, and ,[6] Counter machines and counter languages, Math Systems Theory, (1968), 2. 265-283. | Zbl
, and ,[7] Erasable context-free languagse, to appear. | Zbl
,[8] The equivalence of stack counter acceptors and quasi-realtime acceptors, J. Computer System Science, (1974), 8, 243-269. | Zbl
, and ,[9] Deterministic context-free languages, Information and Control, (1966), 9, 620-648. | Zbl
, and ,[10] On two-way multihead automata, Computer System Sciences, (1973), 7, 28-36. | Zbl
,[11] Remarks on the complexity of nondeterministic counter languages, to appear. | Zbl
,[12] The Mathematical Theory of Context-Free Languages, McGraw-Hill, New York, 1966. | Zbl
,