One counter languages and the chevron operation
RAIRO. Informatique théorique, Tome 13 (1979) no. 2, pp. 189-194. 
@article{ITA_1979__13_2_189_0,
     author = {Greibach, S. A.},
     title = {One counter languages and the chevron operation},
     journal = {RAIRO. Informatique th\'eorique},
     pages = {189--194},
     publisher = {EDP-Sciences},
     volume = {13},
     number = {2},
     year = {1979},
     mrnumber = {543940},
     zbl = {0441.68081},
     language = {en},
     url = {http://www.numdam.org/item/ITA_1979__13_2_189_0/}
}
TY  - JOUR
AU  - Greibach, S. A.
TI  - One counter languages and the chevron operation
JO  - RAIRO. Informatique théorique
PY  - 1979
SP  - 189
EP  - 194
VL  - 13
IS  - 2
PB  - EDP-Sciences
UR  - http://www.numdam.org/item/ITA_1979__13_2_189_0/
LA  - en
ID  - ITA_1979__13_2_189_0
ER  - 
%0 Journal Article
%A Greibach, S. A.
%T One counter languages and the chevron operation
%J RAIRO. Informatique théorique
%D 1979
%P 189-194
%V 13
%N 2
%I EDP-Sciences
%U http://www.numdam.org/item/ITA_1979__13_2_189_0/
%G en
%F ITA_1979__13_2_189_0
Greibach, S. A. One counter languages and the chevron operation. RAIRO. Informatique théorique, Tome 13 (1979) no. 2, pp. 189-194. http://www.numdam.org/item/ITA_1979__13_2_189_0/

1.Y. Bar-Hillel, M. Perles and E. Shamir, On formal Properties of Simple Phrase Structure Grammars, Z. Phonetik, Sprachwiss. Kommunkationsforsch., Vol. 14, 1961, pp. 143-172. | MR | Zbl

2.L. Boasson, Two Iteration Theorems for Some Families of Languages, J. Comp. System Sc, Vol. 7, 1973, pp. 583-596. | MR | Zbl

3. L. Boasson and M. Nivat, Sur diverses familles de langages fermées par traduction rationnelle, Acta Informatica, Vol. 2 1973, pp. 180-188. | MR | Zbl

4. L. Boasson, J. P. Crestin and M. Nivat, Familles de langages translatables et fermées par crochet, Acta Informatica, Vol. 2, 1973, pp. 383-393. | MR | Zbl

5. C.C. Elgot and J. E. Mezei, On Relations Defined by Generalized Finite Automata, I.B.M. J. Res. Dev., Vol. 9, 1965, pp. 47-68. | MR | Zbl

6. S. Ginsburg and S. Greibach, Abstract Families of Languages, Memoirs Amer. Math. Soc., Vol. 87, 1969, pp. 1-32. | MR

7. S. Ginsburg and E. Spanier, Finite-Turn Pushdown Automata, S.I.A.M. J. Control, Vol. 4, 1966, pp. 429-453. | MR | Zbl

8. J. Goldstine, Substitution and Bounded Language, J. Comp. System Sc., Vol. 6, 1972, pp. 9-29. | MR | Zbl

9. S. Greibach, The Unsolvability of the Recognition of Linear Context-Free Languages, J. Assoc. Comput. Mach., Vol. 13, 1966, pp. 582-587. | MR | Zbl

10. S. Greibach, Erasing in Context-Free AFLs, Information and Control, Vol. 21, 1972, pp. 436-465. | MR | Zbl

11. S. Greibach, Erasable Context-Free Languages, Information and Control, Vol. 29, 1975, pp. 301-326. | MR | Zbl

12. M. Latteux, Produit dans le cône rationnel engendré par D1*, Theoretical Computer Sc. Vol. 5, 1977, pp. 129-134. | MR | Zbl