One counter languages and the chevron operation

S. A. Greibach

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (1979)

  • Volume: 13, Issue: 2, page 189-194
  • ISSN: 0988-3754

How to cite

top

Greibach, S. A.. "One counter languages and the chevron operation." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 13.2 (1979): 189-194. <http://eudml.org/doc/92097>.

@article{Greibach1979,
author = {Greibach, S. A.},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {counter languages},
language = {eng},
number = {2},
pages = {189-194},
publisher = {EDP-Sciences},
title = {One counter languages and the chevron operation},
url = {http://eudml.org/doc/92097},
volume = {13},
year = {1979},
}

TY - JOUR
AU - Greibach, S. A.
TI - One counter languages and the chevron operation
JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY - 1979
PB - EDP-Sciences
VL - 13
IS - 2
SP - 189
EP - 194
LA - eng
KW - counter languages
UR - http://eudml.org/doc/92097
ER -

References

top
  1. 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. Zbl0106.34501MR151376
  2. 2. L. BOASSON, Two Iteration Theorems for Some Families of Languages, J. Comp. System Sc, Vol. 7, 1973, pp. 583-596. Zbl0298.68053MR386352
  3. 3. L. BOASSON and M. NIVAT, Sur diverses familles de langages fermées par traduction rationnelle, Acta Informatica, Vol. 2 1973, pp. 180-188. Zbl0242.68037MR331873
  4. 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. Zbl0311.68047MR334584
  5. 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. Zbl0135.00704MR216903
  6. 6. S. GINSBURG and S. GREIBACH, Abstract Families of Languages, Memoirs Amer. Math. Soc., Vol. 87, 1969, pp. 1-32. MR297491
  7. 7. S. GINSBURG and E. SPANIER, Finite-Turn Pushdown Automata, S.I.A.M. J. Control, Vol. 4, 1966, pp. 429-453. Zbl0147.25302MR204294
  8. 8. J. GOLDSTINE, Substitution and Bounded Language, J. Comp. System Sc., Vol. 6, 1972, pp. 9-29. Zbl0232.68030MR309367
  9. 9. S. GREIBACH, The Unsolvability of the Recognition of Linear Context-Free Languages, J. Assoc. Comput. Mach., Vol. 13, 1966, pp. 582-587. Zbl0148.00901MR205770
  10. 10. S. GREIBACH, Erasing in Context-Free AFLs, Information and Control, Vol. 21, 1972, pp. 436-465. Zbl0248.68036MR331876
  11. 11. S. GREIBACH, Erasable Context-Free Languages, Information and Control, Vol. 29, 1975, pp. 301-326. Zbl0317.68059MR386358
  12. 12. M. LATTEUX, Produit dans le cône rationnel engendré par D1*, Theoretical Computer Sc. Vol. 5, 1977, pp. 129-134. Zbl0368.68076MR464728

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.