Closure properties of certain families of formal languages with respect to a generalization of cyclic closure

Andreas Brandstadt

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

  • Volume: 15, Issue: 3, page 233-252
  • ISSN: 0988-3754

How to cite

top

Brandstadt, Andreas. "Closure properties of certain families of formal languages with respect to a generalization of cyclic closure." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 15.3 (1981): 233-252. <http://eudml.org/doc/92143>.

@article{Brandstadt1981,
author = {Brandstadt, Andreas},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {circular closure; permutation of k parts; generalized circular closure; context-free languages; strong hierarchy},
language = {eng},
number = {3},
pages = {233-252},
publisher = {EDP-Sciences},
title = {Closure properties of certain families of formal languages with respect to a generalization of cyclic closure},
url = {http://eudml.org/doc/92143},
volume = {15},
year = {1981},
}

TY - JOUR
AU - Brandstadt, Andreas
TI - Closure properties of certain families of formal languages with respect to a generalization of cyclic closure
JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY - 1981
PB - EDP-Sciences
VL - 15
IS - 3
SP - 233
EP - 252
LA - eng
KW - circular closure; permutation of k parts; generalized circular closure; context-free languages; strong hierarchy
UR - http://eudml.org/doc/92143
ER -

References

top
  1. [1] J. DASSOW, On the Circular Closure of Languages, EIK-Journal of Information Processing and Cybernetics, EIK, Vol. 15, 1979, 1/2, pp. 87-94. Zbl0415.68040MR542004
  2. [2] S. GINSBURG, S. A. GREIBACH, and J. E. HOPCROFT, Studies in Abstract Families of Languages, Mem. Amer. Math. Soc, Vol. 87, 1969. Zbl0194.31402MR255329
  3. [3] M. A. HARRISON and O. H. IBARRA, Multitape and Multi-Head Pushdown automata, Information and Control, Vol. 13, 1968, pp. 433-470. Zbl0174.02701MR238622
  4. [4] A. N. MASLOV, On the Circular Permutation of Languages (in Russian) Probl. Pered. Inform., IX, Vol. 14, 1973, pp. 81-87. Zbl0314.68030MR334597
  5. [5] T. OSHIBA, Closure Property of the Family of Context-Free Languages under the Cyclic Shift Operation, Trans, Inst. Electron, and Commun. Engrs., Jap., Vol. D 55,4, 1972, pp. 233-237. MR478788
  6. [6] K. RUOKONEN, On Circular Words and (ω + ω*)-Powers of Words, EIK-Journal of Information Processing and Cybernetics, EIK, Vol. 13, 1977, 1/2, pp.3-12. Zbl0365.68081MR455573
  7. [7] B. A. TRACHTENBROT, Lectures on the Complexity of Algorithms and Computations, (in Russian), Novosibirsk, 1967. 

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.