×

zbMATH — the first resource for mathematics

Opérations de cylindre et applications séquentielles gauches inverses. (French) Zbl 0388.68076

MSC:
68Q45 Formal languages and automata
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Autebert, J-M.: Non-principalité du cylindre des langages à compteur, Mathematical Systems Theory 11, 157-167 (1977) · Zbl 0365.68076 · doi:10.1007/BF01768474
[2] Autebert, J-M.: The AFDL of deterministic realtime context-free languages is principal, soumis à publication
[3] Boasson, L.: Cônes Rationnels et Familles Agréables de Langages. Application aux Langages à Compteur, Thèse de 3ème cycle de Paris VII, 1971
[4] Boasson, L., Nivat, M.: Sur diverses familles de langages fermées par transduction rationnelle, Acta Informatica 2, 180-188 (1973) · Zbl 0242.68037
[5] Boasson, L., Nivat, M.: Le cylindre des langages linéaires, Mathematical Systems Theory 11, 147-155 (1977) · Zbl 0361.68121 · doi:10.1007/BF01768473
[6] Chandler, W.J.: Abstract families of deterministic languages, Proc. 1st ACM Conf. on Theory of Computing, Marina del Rey, Calif., p. 21-30 (1969) · Zbl 1282.68153
[7] Eilenberg, S.: Communication au Congrès International des Mathématiciens, Nice, 1970
[8] Elgot, C.C., Mezei, J.E.: On relations defined by generalized finite automata, IBM Journal of Research and Development 9, 47-68 (1962) · Zbl 0135.00704 · doi:10.1147/rd.91.0047
[9] Ginsburg, S.: The Mathematical Theory of Context-free Languages, McGraw-Hill, New York, 1966 · Zbl 0184.28401
[10] Ginsburg, S., Goldstine, J.: On the largest full sub-AFL of an AFL, Math. System Theory 6, 241-242 (1972) · Zbl 0239.68013
[11] Ginsburg, S., Greibach, S.A.: Abstract Families of Languages, in Studies in Abstract Families of Languages, Memoirs of the Amer. Math. Soc. 87, 1-32 (1969) · Zbl 0194.31402
[12] Ginsburg, S., Greibach, S.A.: Principal AFL, J. Comput. System Sci. 4, 308-338 (1970) · Zbl 0198.03102 · doi:10.1016/S0022-0000(70)80016-2
[13] Greibach, S.A.: Chains of full AFL’s, Math. System Theory 4, 231-242 (1970) · Zbl 0203.30102 · doi:10.1007/BF01691106
[14] Greibach, S.A.: The hardest C.F. language, SIAM Journal on Computing 2, 304-310 (1973) · Zbl 0278.68073 · doi:10.1137/0202025
[15] Greibach, S.A.: Jump PDA’s and hierarchies of deterministic C.F. languages, SIAM Journal on Computing 3, 111-127 (1974) · Zbl 0288.68031 · doi:10.1137/0203009
[16] Nivat, M.: Transductions des Langages de Chomsky, Annales de l’Institut Fourier 18, 339-456 (1968) · Zbl 0313.68065
[17] Salomaa, A.: Formal Languages, Academic Press, New York, 1973 · Zbl 0262.68025
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.