Recherche et téléchargement d’archives de revues mathématiques numérisées

 
 
  Table des matières de ce fascicule | Article précédent | Article suivant
Brandstadt, Andreas
Closure properties of certain families of formal languages with respect to a generalization of cyclic closure. RAIRO, Informatique théorique, 15 no. 3 (1981), p. 233-252
Texte intégral djvu | pdf | Analyses MR 630064 | Zbl 0467.68066

URL stable: http://www.numdam.org/item?id=ITA_1981__15_3_233_0

Bibliographie

[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.  MR 542004 |  Zbl 0415.68040
[2] S. GINSBURG, S. A. GREIBACH, and J. E. HOPCROFT, Studies in Abstract Families of Languages, Mem. Amer. Math. Soc, Vol. 87, 1969.  MR 255329 |  Zbl 0194.31402
[3] M. A. HARRISON and O. H. IBARRA, Multitape and Multi-Head Pushdown automata, Information and Control, Vol. 13, 1968, pp. 433-470.  MR 238622 |  Zbl 0174.02701
[4] A. N. MASLOV, On the Circular Permutation of Languages (in Russian) Probl. Pered. Inform., IX, Vol. 14, 1973, pp. 81-87.  MR 334597 |  Zbl 0314.68030
[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.  MR 478788
[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.  MR 455573 |  Zbl 0365.68081
[7] B. A. TRACHTENBROT, Lectures on the Complexity of Algorithms and Computations, (in Russian), Novosibirsk, 1967.
Copyright Cellule MathDoc 2014 | Crédit | Plan du site