×

zbMATH — the first resource for mathematics

Générateurs algébriques et systèmes de paires iterantes. (French) Zbl 0408.68071

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, Math. systems theory, 11, 157-167, (1977) · Zbl 0351.68026
[2] Autebert, J.M.; Beauquier, J., Une caractérisation des générateurs standard, R.a.i.r.o., R1, 63-83, (1974) · Zbl 0294.68031
[3] Beauquier, J.; Michaelson, S.; Milner, R., Générateurs algébriques non-ambigus, Automata, languages and programming, 66-73, (1976) · Zbl 0363.68106
[4] Beauquier, J., Contribution à l’étude de la complexité structurelle des langages algébriques, ()
[5] Beauquier, J., Un générateur algébrique inhéremment ambigu, à paraître dans R.A.I.R.O., Theoret. comput. sci., (1978)
[6] Berstel, J., Transductions and context-free languages, (1978), Teubner, Verlag Stuttgart · Zbl 0424.68040
[7] Boasson, L., Une classe de langages générateurs de la famille des langages algébriques, () · Zbl 0263.68038
[8] Boasson, L., Langages algébriques, paires itérantes et transductions rationnelles, Theoret. comput. sci., 2, 209-223, (1976) · Zbl 0378.68037
[9] Boasson, L.; Crestin, J.P.; Nivat, M., Familles de langages translatables et fermées par crochet, Acta informat., 2, 383-393, (1973) · Zbl 0311.68047
[10] Boasson, L.; Nivat, M., Rational cones and full AFL’s, Communication à informatik, 71, (1971), Münich
[11] Boasson, L.; Nivat, M., Parenthesis generators, Foundations of computer sciences, (1976), Houston
[12] Boasson, L.; Nivat, M., Le cylindre des langages linéaires, Math. systems theory, 11, 147-155, (1977) · Zbl 0352.68087
[13] Eilenberg, S., Communication au congrés international des mathématiciens, (1970), Nice
[14] Ginsburg, S., The mathematical theory of CF-languages, (1966), McGraw-Hill New York · Zbl 0184.28401
[15] Ginsburg, S.; Goldstine, J.; Greibach, S., Uniformly erasable AFL, J. comput. system sci., 10, 165-182, (1975) · Zbl 0325.68042
[16] Ginsburg, S.; Greibach, S., Studies in abstract families of languages, Mem. amer. math. soc., 87, 1-32, (1969) · Zbl 0194.31402
[17] Ginsburg, S.; Greibach, S., Principal AFL, J. comput. system sci., 4, 308-338, (1970) · Zbl 0198.03102
[18] Ginsburg, S.; Greibach, S., On AFL generators for finitely encoded AFA, J. comput. system sci., 1-27, (1973) · Zbl 0249.68025
[19] Ginzburg, A., Algebraïc theory of automata, (1968), Academic Press New York · Zbl 0195.02501
[20] Greibach, S., Chains of full AFL’s, Math. systems theory, 4, 231-242, (1970) · Zbl 0203.30102
[21] Greibach, S., Syntactic operators on full semi-AFL’s, J. comput. system sci., 6, 30-76, (1972) · Zbl 0269.68046
[22] Greibach, S., The hardest context-free language, SIAM J. comput., 2, 304-310, (1973) · Zbl 0278.68073
[23] Greibach, S., Jump PDA’s and hierarchy of deterministic context-free languages, SIAM J. comput., 3, 2, 111-127, (1974) · Zbl 0288.68031
[24] Greibach, S., One counter languages and the IRS condition, J. comput. system sci., 10, 237-247, (1975) · Zbl 0307.68062
[25] Lentin, A., Equations dans le monoïde libre, (1973), Gauthier-Villars Paris, Mouton, Paris-la Haye · Zbl 0269.20057
[26] Myhill, J., Finite automata and representation of events, Wright air dev. command, technical report, 112-137, (1957)
[27] Nivat, M., Transductions des langages de chomsky, Ann. inst. Fourier, 18, 339-456, (1966) · Zbl 0313.68065
[28] Ogden, W., A helpful result for proving inherent ambiguity, Math. systems theory, 2, 191-194, (1967) · Zbl 0175.27802
[29] Schutzenberger, M.P., Sur un langage équivalent au langage de Dyck, (), 197-203
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.