×

zbMATH — the first resource for mathematics

Familles de langages translatables et fermées par crochet. (French) Zbl 0311.68047

MSC:
68Q45 Formal languages and automata
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Boasson, L., Nivat, M.: Sur diverses familles de langages fermées par transduction rationnelle. Acta Informatica 2, 180-188 (1973) · Zbl 0242.68037
[2] Crestin, J. B.: Sur un langage quasi-rationnel d’ambiguité non bornée. Thèse de 3ème cycle. Faculté des Sciences de Toulouse 1967 (miméographiée)
[3] Elgot, C., Mezei, J.: On relations defined by generalized finite automata. IBM Journal of R. and D. 9, 47-68 (1965) · Zbl 0135.00704 · doi:10.1147/rd.91.0047
[4] Ginsburg, S., Greibach, S.: Abstract families of languages. Memoirs Amer. Math. Soc. 87, 1-32 (1969)
[5] Ginsburg, S., Spanier, E.: Finite turn push-down automata. SIAM J. Control 4, 429-453 (1966) · Zbl 0147.25302 · doi:10.1137/0304034
[6] Ginsburg, S., Greibach, S.: Principal AFL. J. Computer and System Sciences 4, 308-338 (1970) · Zbl 0198.03102 · doi:10.1016/S0022-0000(70)80016-2
[7] Greibach, S.: Chains of full AFL’s. Math. Systems Theory 4, 231-242 (1970) · Zbl 0203.30102 · doi:10.1007/BF01691106
[8] Greibach, S.: Syntactic operators on full semi AFL’s. J. Computer and System Sciences 6, 30-76 (1972) · Zbl 0269.68046 · doi:10.1016/S0022-0000(72)80039-4
[9] Goldstine, J.: Substitution and bounded languages. J.Computer and System Sciences 6, 9-29 (1972) · Zbl 0232.68030 · doi:10.1016/S0022-0000(72)80038-2
[10] Nivat, M.: Transductions des langages de Chomsky. Annales de l’Institut Fourier 18, 339-456 (1968) · Zbl 0313.68065
[11] Nivat, M.: Transductions des langages de Chomsky, Chapitre VI. Thèse de doctorat, Paris 1967 (miméographiée)
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.