Transductions des langages de Chomsky
Annales de l'Institut Fourier, Tome 18 (1968) no. 1, pp. 339-455.

La feuille des applications dites K-transductions, et qu’il serait légitime d’appeler applications rationnelles, d’un monoïde libre dans un autre monoïde est étudiée de façon systématique. L’intérêt de ces applications vient de ce qu’elles transportent partie algébrique (ou C-langages) sur partie algébrique, partie rationnelle (ou K-langage) sur partie rationnelle. On étudie sous le nom de langage compilable les parties algébriques qu’une K-transduction univoque applique dans un ensemble de Dyck (noyau d’un homomorphisme dans un groupe libre). On introduit la structure associative nouvelle de produit sélectif, aussitôt utilisée à la démonstration de l’équivalence de divers automates.

@article{AIF_1968__18_1_339_0,
     author = {Nivat, Maurice},
     title = {Transductions des langages de {Chomsky}},
     journal = {Annales de l'Institut Fourier},
     pages = {339--455},
     publisher = {Institut Fourier},
     address = {Grenoble},
     volume = {18},
     number = {1},
     year = {1968},
     doi = {10.5802/aif.287},
     mrnumber = {38 #6909},
     zbl = {0313.68065},
     language = {fr},
     url = {http://www.numdam.org/articles/10.5802/aif.287/}
}
TY  - JOUR
AU  - Nivat, Maurice
TI  - Transductions des langages de Chomsky
JO  - Annales de l'Institut Fourier
PY  - 1968
SP  - 339
EP  - 455
VL  - 18
IS  - 1
PB  - Institut Fourier
PP  - Grenoble
UR  - http://www.numdam.org/articles/10.5802/aif.287/
DO  - 10.5802/aif.287
LA  - fr
ID  - AIF_1968__18_1_339_0
ER  - 
%0 Journal Article
%A Nivat, Maurice
%T Transductions des langages de Chomsky
%J Annales de l'Institut Fourier
%D 1968
%P 339-455
%V 18
%N 1
%I Institut Fourier
%C Grenoble
%U http://www.numdam.org/articles/10.5802/aif.287/
%R 10.5802/aif.287
%G fr
%F AIF_1968__18_1_339_0
Nivat, Maurice. Transductions des langages de Chomsky. Annales de l'Institut Fourier, Tome 18 (1968) no. 1, pp. 339-455. doi : 10.5802/aif.287. http://www.numdam.org/articles/10.5802/aif.287/

[1] Y. Bar Hillel, M. Perles, E. Shamir, On formal properties of simple phrase structure grammars in Y. Bar Hillel : Language and information, Addison Wesley Publishing Company (1964).

[2] N. Chomsky, Formal properties of grammars in Handbook of Mathematical Psychology, Wiley Publishing Company, New York 1963. | Zbl

[3] N. Chomsky, Mp. Schutzenberger, The algebraic theory of context-free languages in Computer Programming and Formal systems, North Holland Publishing Company, Amsterdam 1963. | Zbl

[4] Cc. Elgolt, Review of “A remark on finite transducers”, I.R.E. Trans Electronic Computers vol. EC II (1962) p. 802.

[5] Cc. Elgot et Je. Mezei, On relations defined by generalized finite automata, I.B.M. Journal of Research and development, vol. 9 (1965) p. 47-68. | MR | Zbl

[6] S. Ginsburg, Mathematical theory of context-free languages Mac Graw Hill Publishing Company, New York 1966. | MR | Zbl

[7] S. Ginsburg et E.H. Spanier, Bounded Algol like languages, Trans American Math. Society, vol. 113 (1964) p. 333-368. | MR | Zbl

[8] S. Ginsburg et Sheila A. Greibach, Deterministic Context-free languages, Information and Control, vol. (1966) p. 620-648. | MR | Zbl

[9] Sheila A. Greibach, A new normal form theorem for Context-free phrase structure grammars. Journal of the Association for computing machinery, vol. 12 (1965) p. 42-52. | MR | Zbl

[10] N. Jacobson, Structure of rings, American Mathematical Society, Providence 1956. | MR | Zbl

[11] D.E. Knuth, On the translation of languages from left to right, Information and Control, vol. 8 (1965) p. 607-639. | MR | Zbl

[12] W. Magnus, A. Karrass, D. Solitar, Combinatorial Group Theory, Interscience Publishing Company, New York 1966.

[13] J. Myhill, Finite automata and the representation of events, Wright Air Development Command Technical Report n° 57-624 (1957) p. 112-137.

[14] P. Naur, (edit), Report on the Algorithmic language Algol 60, Communications Assoc. Computing Machinery, vol. 3 (1960) p. 299-314. | MR | Zbl

[15] M. Nivat, Sur une classe de transducteurs, Séminaire Dubreil Pisot, 18ème 1964-1965. | Numdam | Zbl

[16] M. Nivat, Eléments de la théorie générale des codes, In Automata Theory (cours de l'école d'été de Ravello 1964), Academic Press New York 1966. | MR | Zbl

[17] M. Nivat, Sur l'irréductibilité de certaines représentations de monoïdes, C.R. Acad Sci. Paris, vol. 261 (1965) p. 2421-2422. | MR | Zbl

[18] P. Samuel, Progrès récents d'algèbre locale, Notas de matematica n° 19, Rio de Janeiro, (1959). | MR | Zbl

[19] Mp. Schutzenberger, A remark on finite transducers, Information and Control, vol. 4 (1961) p. 185-196. | MR | Zbl

[20] Mp. Schutzenberger, On the definition of a family of automata, Information and Control, vol. 4 (1961) p. 245-270. | MR | Zbl

[21] Mp. Schutzenberger, On a theorem of R. Jungen, Proc. American Math. Society (1962) p. 189-197. | Zbl

[22] Mp. Schutzenberger, Certain Elementary families of automata, in Proceedings of the symposium on mathematical theory of Automata, Polytechnic Institute of Brooklyn 1962.

[23] Mp. Schutzenberger, Context-free languages and pushdown automata, Information and Control, vol. 6 (1963) p. 246-264. | Zbl

[24] Mp. Schutzenberger, Sur certains sous-monoïdes libres, Bull. Société Math. France, vol. 93 (1965) p. 209-223. | Numdam | MR | Zbl

[25] Mp. Schutzenberger, Un problème de la théorie des automates, Séminaire Dubreil-Pisot, 13ème année (1959-1960). | Numdam | Zbl

[26] E. Shamir, Mathematical models of languages, in Proceedings of the third IFIP Congress, New-York, (1965). | Zbl

[27] E. Shamir, A representation theorem for algebraic and context-free power series in non commuting variates dans Arhib (ed.). Algebraic theory of machines, languages and semi-groups - Academic Press. | Zbl

[28] D.H. Younger, Recognition and parsing of Context-free languages in time n° 3 rapport n° 66-C-008, G, General Electric research and Development center, Schenectady (New-York).

  • Benso, Andrea; D’Alessandro, Flavio; Papi, Paolo Quantum Automata and Languages of Finite Index, Reachability Problems, Volume 15050 (2024), p. 88 | DOI:10.1007/978-3-031-72621-7_7
  • Néraud, Jean Topologies for error-detecting variable-length codes, Information and Computation, Volume 295 (2023), p. 22 (Id/No 105092) | DOI:10.1016/j.ic.2023.105092 | Zbl:7798819
  • Grabolle, Gustav A Nivat theorem for weighted alternating automata over commutative semirings, Logical Methods in Computer Science, Volume 19 (2023) no. 4, p. 25 (Id/No 27) | DOI:10.46298/lmcs-19(4:27)2023 | Zbl:7788999
  • Droste, Manfred; Dück, Stefan; Mandrioli, Dino; Pradella, Matteo Weighted operator precedence languages, Information and Computation, Volume 282 (2022), p. 26 (Id/No 104658) | DOI:10.1016/j.ic.2020.104658 | Zbl:1483.68162
  • Jain, Sanjay; Kuek, Shao Ning; Martin, Eric; Stephan, Frank Learners based on transducers, Information and Computation, Volume 283 (2022), p. 26 (Id/No 104676) | DOI:10.1016/j.ic.2020.104676 | Zbl:1526.68002
  • Latteux, Michel; Roos, Yves On rationally controlled one-rule insertion systems, RAIRO. Theoretical Informatics and Applications, Volume 56 (2022), p. 31 (Id/No 8) | DOI:10.1051/ita/2022008 | Zbl:1520.68063
  • Grabolle, Gustav A Nivat theorem for weighted alternating automata over commutative semirings, Proceedings of the 12th international symposium on games, automata, logics, and formal verification, GandALF, Padua, Italy, September 20–22, 2021, Waterloo: Open Publishing Association (OPA), 2021, pp. 241-257 | DOI:10.4204/eptcs.346.16 | Zbl:7954909
  • Droste, Manfred; Kuske, Dietrich Weighted automata, Handbook of automata theory. Volume I. Theoretical foundations, Berlin: European Mathematical Society (EMS), 2021, pp. 113-150 | DOI:10.4171/automata-1/4 | Zbl:1508.68189
  • Harju, Tero; Karhumäki, Juhani Finite transducers and rational transductions, Handbook of automata theory. Volume I. Theoretical foundations, Berlin: European Mathematical Society (EMS), 2021, pp. 79-111 | DOI:10.4171/automata-1/3 | Zbl:1517.68195
  • Yokomori, Takashi; Okubo, Fumiya Theory of reaction automata: a survey, Journal of Membrane Computing, Volume 3 (2021) no. 1, pp. 63-85 | DOI:10.1007/s41965-021-00070-6 | Zbl:1469.68058
  • Droste, Manfred; Kutsia, Temur; Rahonis, George; Schreiner, Wolfgang McCarthy-Kleene fuzzy automata and MSO logics, Information and Computation, Volume 272 (2020), p. 22 (Id/No 104499) | DOI:10.1016/j.ic.2019.104499 | Zbl:1443.68087
  • Ebrahimi-Fard, Kurusch; Gray, W. Steven; Manchon, Dominique Evaluating generating functions for periodic multiple polylogarithms via rational Chen-Fliess series, Periods in quantum field theory and arithmetic. Based on the presentations at the research trimester on multiple zeta values, multiple polylogarithms, and quantum field theory, ICMAT 2014, Madrid, Spain, September 15–19, 2014, Cham: Springer, 2020, pp. 445-468 | DOI:10.1007/978-3-030-37031-2_17 | Zbl:1456.11161
  • Bojańczyk, Mikołaj; Kelmendi, Edon; Stefański, Rafał; Zetzsche, Georg Extensions of ω-regular languages, Proceedings of the 2020 35th annual ACM/IEEE symposium on logic in computer science, LICS 2020, virtual event, July 8–11, 2020, New York, NY: Association for Computing Machinery (ACM), 2020, pp. 266-272 | DOI:10.1145/3373718.3394779 | Zbl:1498.03022
  • Descotte, María Emilia; Figueira, Diego; Figueira, Santiago Closure properties of synchronized relations, 36th international symposium on theoretical aspects of computer science, STACS 2019, March 13–16, 2019, Berlin, Germany, Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik, 2019, p. 17 (Id/No 22) | DOI:10.4230/lipics.stacs.2019.22 | Zbl:1547.68327
  • Barceló, Pablo; Hong, Chih-Duo; Le, Xuan-Bach; Lin, Anthony W.; Niskanen, Reino Monadic decomposability of regular relations, 46th international colloquium on automata, languages, and programming, ICALP 2019, Patras, Greece, July 9–12, 2019. Proceedings, Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2019, p. 14 (Id/No 103) | DOI:10.4230/lipics.icalp.2019.103 | Zbl:7561596
  • Fratani, Séverine; Voundy, El Makki Epsilon-reducible context-free languages and characterizations of indexed languages, Information and Computation, Volume 269 (2019), p. 19 (Id/No 104444) | DOI:10.1016/j.ic.2019.104444 | Zbl:1435.68205
  • Babari, Parvaneh; Droste, Manfred A Nivat theorem for weighted picture automata and weighted MSO logics, Journal of Computer and System Sciences, Volume 104 (2019), pp. 41-57 | DOI:10.1016/j.jcss.2017.02.009 | Zbl:1423.68242
  • Blanchette, Benjamin; Choffrut, Christian; Reutenauer, Christophe Quasi-automatic semigroups, Theoretical Computer Science, Volume 777 (2019), pp. 111-120 | DOI:10.1016/j.tcs.2019.01.002 | Zbl:1454.20115
  • Okubo, Fumiya; Yokomori, Takashi Decomposition and factorization of chemical reaction transducers, Theoretical Computer Science, Volume 777 (2019), pp. 431-442 | DOI:10.1016/j.tcs.2019.01.032 | Zbl:1425.68112
  • Blanchette, Benjamin Quasi-automatic groups are asynchronously automatic, Theoretical Computer Science, Volume 793 (2019), pp. 193-195 | DOI:10.1016/j.tcs.2019.05.026 | Zbl:1453.20083
  • Winter, Sarah Uniformization problems for synchronizations of automatic relations on words, 45th international colloquium on automata, languages, and programming. ICALP 2018, Prague, Czech Republic, July 9–13, 2018. Proceedings, Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik, 2018, p. 13 (Id/No 142) | DOI:10.4230/lipics.icalp.2018.142 | Zbl:1499.68197
  • Descotte, María Emilia; Figueira, Diego; Puppis, Gabriele Resynchronizing classes of word relations, 45th international colloquium on automata, languages, and programming. ICALP 2018, Prague, Czech Republic, July 9–13, 2018. Proceedings, Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik, 2018, p. 13 (Id/No 123) | DOI:10.4230/lipics.icalp.2018.123 | Zbl:1499.68172
  • Gilman, Robert H.; Kropholler, Robert P.; Schleimer, Saul Groups whose word problems are not semilinear, Groups, Complexity, Cryptology, Volume 10 (2018) no. 2, pp. 53-62 | DOI:10.1515/gcc-2018-0010 | Zbl:1491.20079
  • Jain, Sanjay; Kuek, Shao Ning; Martin, Eric; Stephan, Frank Learners Based on Transducers, Language and Automata Theory and Applications, Volume 10792 (2018), p. 169 | DOI:10.1007/978-3-319-77313-1_13
  • Fülöp, Zoltán; Vogler, Heiko Characterizations of recognizable weighted tree languages by logic and bimorphisms, Soft Computing, Volume 22 (2018) no. 4, pp. 1035-1046 | DOI:10.1007/s00500-015-1717-2 | Zbl:1398.68308
  • Engelfriet, Joost; Maletti, Andreas; Maneth, Sebastian Multiple context-free tree grammars: lexicalization and characterization, Theoretical Computer Science, Volume 728 (2018), pp. 29-99 | DOI:10.1016/j.tcs.2018.03.014 | Zbl:1395.68163
  • Droste, Manfred; Dück, Stefan; Mandrioli, Dino; Pradella, Matteo Weighted operator precedence languages, 42nd international symposium on mathematical foundations of computer science, MFCS 2017, August 21–25, 2017, Aalborg, Denmark, Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik, 2017, p. 15 (Id/No 31) | DOI:10.4230/lipics.mfcs.2017.31 | Zbl:1441.68121
  • Droste, Manfred; Kutsia, Temur; Rahonis, George; Schreiner, Wolfgang MK-fuzzy Automata and MSO Logics, Electronic Proceedings in Theoretical Computer Science, Volume 256 (2017), p. 106 | DOI:10.4204/eptcs.256.8
  • Benedikt, M.; Engelfriet, J.; Maneth, S. Determinacy and rewriting of functional top-down and MSO tree transformations, Journal of Computer and System Sciences, Volume 85 (2017), pp. 57-73 | DOI:10.1016/j.jcss.2016.11.001 | Zbl:1356.68050
  • Veanes, Margus; Bjørner, Nikolaj; Nachmanson, Lev; Bereg, Sergey Monadic Decomposition, Journal of the ACM, Volume 64 (2017) no. 2, p. 1 | DOI:10.1145/3040488
  • Droste, Manfred; Götze, Doreen A Nivat Theorem for Quantitative Automata on Unranked Trees, Models, Algorithms, Logics and Tools, Volume 10460 (2017), p. 22 | DOI:10.1007/978-3-319-63121-9_2
  • Droste, Manfred; Kutsia, Temur; Rahonis, George; Schreiner, Wolfgang MK-fuzzy automata and MSO logics, Proceedings of the eighth international symposium on games, automata, logics and formal verification, GandALF 2017, Roma, Italy, September 20–22, 2017, Waterloo: Open Publishing Association (OPA), 2017, pp. 106-120 | Zbl:1483.68164
  • Zetzsche, Georg; Kuske, Dietrich; Lohrey, Markus On Boolean closed full trios and rational Kripke frames, Theory of Computing Systems, Volume 60 (2017) no. 3, pp. 438-472 | DOI:10.1007/s00224-016-9694-0 | Zbl:1366.68155
  • Fratani, Séverine; Voundy, El Makki Homomorphic Characterizations of Indexed Languages, Language and Automata Theory and Applications, Volume 9618 (2016), p. 359 | DOI:10.1007/978-3-319-30000-9_28
  • Droste, Manfred; Perevoshchikov, Vitaly A logical characterization of timed pushdown languages, Computer science – theory and applications. 10th international computer science symposium in Russia, CSR 2015, Listvyanka, Russia, July 13–17, 2015. Proceedings, Cham: Springer, 2015, pp. 189-203 | DOI:10.1007/978-3-319-20297-6_13 | Zbl:1466.68050
  • Perevoshchikov, Vitaly Weight assignment logic, Developments in language theory. 19th international conference, DLT 2015, Liverpool, UK, July 27–30, 2015. Proceedings., Cham: Springer, 2015, pp. 413-425 | DOI:10.1007/978-3-319-21500-6_33 | Zbl:1434.03087
  • Droste, Manfred; Perevoshchikov, Vitaly Logics for weighted timed pushdown automata, Fields of logic and computation II. Essays dedicated to Yuri Gurevich on the occasion of his 75th birthday, Cham: Springer, 2015, pp. 153-173 | DOI:10.1007/978-3-319-23534-9_9 | Zbl:1465.68142
  • Salvati, Sylvain MIX is a 2-MCFL and the word problem in Z2 is captured by the IO and the OI hierarchies, Journal of Computer and System Sciences, Volume 81 (2015) no. 7, pp. 1252-1277 | DOI:10.1016/j.jcss.2015.03.004 | Zbl:1325.68133
  • Fagin, Ronald; Kimelfeld, Benny; Reiss, Frederick; Vansummeren, Stijn Document spanners: a formal approach to information extraction, Journal of the ACM, Volume 62 (2015) no. 2, p. 51 (Id/No 12) | DOI:10.1145/2699442 | Zbl:1333.68098
  • Droste, Manfred; Dück, Stefan Weighted Automata and Logics on Graphs, Mathematical Foundations of Computer Science 2015, Volume 9234 (2015), p. 192 | DOI:10.1007/978-3-662-48057-1_15
  • Figueira, Diego; Libkin, Leonid Synchronizing relations on words, Theory of Computing Systems, Volume 57 (2015) no. 2, pp. 287-318 | DOI:10.1007/s00224-014-9584-2 | Zbl:1335.68118
  • Droste, Manfred; Perevoshchikov, Vitaly A Nivat Theorem for Weighted Timed Automata and Weighted Relative Distance Logic, Automata, Languages, and Programming, Volume 8573 (2014), p. 171 | DOI:10.1007/978-3-662-43951-7_15
  • Veanes, Margus; Bjørner, Nikolaj; Nachmanson, Lev; Bereg, Sergey Monadic Decomposition, Computer Aided Verification, Volume 8559 (2014), p. 628 | DOI:10.1007/978-3-319-08867-9_42
  • Fagin, Ronald; Kimelfeld, Benny; Reiss, Frederick; Vansummeren, Stijn, Proceedings of the 32nd ACM SIGMOD-SIGACT-SIGAI symposium on Principles of database systems (2013), p. 37 | DOI:10.1145/2463664.2463665
  • Barceló, Pablo; Figueira, Diego; Libkin, Leonid Graph logics with rational relations and the generalized intersection problem, Proceedings of the 2012 27th annual ACM/IEEE symposium on logic in computer science, LICS 2012, Dubrovnik, Croatia, June 25–28, 2012, Los Alamitos, CA: IEEE Computer Society, 2012, pp. 115-124 | DOI:10.1109/lics.2012.23 | Zbl:1362.68063
  • Render, Elaine; Kambites, Mark Semigroup automata with rational initial and terminal sets, Theoretical Computer Science, Volume 411 (2010) no. 7-9, pp. 1004-1012 | DOI:10.1016/j.tcs.2009.11.007 | Zbl:1187.68299
  • Petre, Ion; Salomaa, Arto Algebraic Systems and Pushdown Automata, Handbook of Weighted Automata (2009), p. 257 | DOI:10.1007/978-3-642-01492-5_7
  • Fülöp, Zoltán; Vogler, Heiko Weighted Tree Automata and Tree Transducers, Handbook of Weighted Automata (2009), p. 313 | DOI:10.1007/978-3-642-01492-5_9
  • Stüber, Torsten; Vogler, Heiko; Fülöp, Zoltán Decomposition of weighted multioperator tree automata, International Journal of Foundations of Computer Science, Volume 20 (2009) no. 2, pp. 221-245 | DOI:10.1142/s012905410900653x | Zbl:1226.68039
  • Gray, W. Steven; Herencia-Zapana, Heber; Duffaut Espinosa, Luis A.; González, Oscar R. Bilinear system interconnections and generating series of weighted Petri nets, Systems Control Letters, Volume 58 (2009) no. 12, pp. 841-848 | DOI:10.1016/j.sysconle.2009.10.003 | Zbl:1191.93003
  • De Carli, F.; Frosini, A.; Rinaldi, S.; Sorbi, A. Lattices of local two-dimensional languages, Theoretical Computer Science, Volume 410 (2009) no. 27-29, pp. 2701-2713 | DOI:10.1016/j.tcs.2009.03.025 | Zbl:1172.68032
  • Gray, W. Steven; Herencia-Zapana, Heber; Duffaut Espinosa, Luis A.; Gonzalez, Oscar R., 2008 47th IEEE Conference on Decision and Control (2008), p. 4115 | DOI:10.1109/cdc.2008.4738649
  • Espinosa, L.A.D.; Gray, W.S.; Gonzalez, O.R., 2007 Thirty-Ninth Southeastern Symposium on System Theory (2007), p. 238 | DOI:10.1109/ssst.2007.352356
  • Konstantinidis, Stavros; Santean, Nicolae; Yu, Sheng Representation and uniformization of algebraic transductions, Acta Informatica, Volume 43 (2007) no. 6, pp. 395-417 | DOI:10.1007/s00236-006-0027-7 | Zbl:1106.68061
  • Lombardy, Sylvain; Sakarovitch, Jacques Sequential?, Theoretical Computer Science, Volume 356 (2006) no. 1-2, pp. 224-244 | DOI:10.1016/j.tcs.2006.01.028 | Zbl:1160.68419
  • Maletti, Andreas Hasse diagrams for classes of deterministic bottom-up tree-to-tree-series transformations, Theoretical Computer Science, Volume 339 (2005) no. 2-3, pp. 200-240 | DOI:10.1016/j.tcs.2005.02.005 | Zbl:1099.68051
  • Chemillier, Marc Synchronization of musical words, Theoretical Computer Science, Volume 310 (2004) no. 1-3, pp. 35-60 | DOI:10.1016/s0304-3975(03)00309-8 | Zbl:1071.68040
  • Foryś, Wit Some characterization of recursively enumerable sets., International Journal of Computer Mathematics, Volume 79 (2002) no. 2, pp. 157-163 | DOI:10.1080/00207160211924 | Zbl:1064.68052
  • Dams, Dennis; Lakhnech, Yassine; Steffen, Martin Iterating transducers, The Journal of Logic and Algebraic Programming, Volume 52-53 (2002), pp. 109-127 | DOI:10.1016/s1567-8326(02)00025-5 | Zbl:1008.68062
  • Fülöp, Z.; Terlutte, A. Iterated relabeling tree transducers, Theoretical Computer Science, Volume 276 (2002) no. 1-2, pp. 221-244 | DOI:10.1016/s0304-3975(01)00181-5 | Zbl:1002.68077
  • Dauchet, Max; Tison, Sophie; Tommasi, Marc Recognizable tree-languages and nonlinear morphisms, Theoretical Computer Science, Volume 281 (2002) no. 1-2, pp. 219-233 | DOI:10.1016/s0304-3975(02)00014-2 | Zbl:1014.68092
  • Curien, Pierre-Louis A short scientific biography of Maurice Nivat, Theoretical Computer Science, Volume 281 (2002) no. 1-2, pp. 3-23 | DOI:10.1016/s0304-3975(02)00004-x | Zbl:1007.01511
  • Grigorieff, Serge Modelization of deterministic rational relations, Theoretical Computer Science, Volume 281 (2002) no. 1-2, pp. 423-453 | DOI:10.1016/s0304-3975(02)00022-1 | Zbl:0997.68072
  • Kuich, Werner Cones, Semi-AFPs, and AFPs of Algebraic Power Series, Fundamentals of Computation Theory, Volume 2138 (2001), p. 204 | DOI:10.1007/3-540-44669-9_21
  • Morvan, Christophe On Rational Graphs, Foundations of Software Science and Computation Structures, Volume 1784 (2000), p. 252 | DOI:10.1007/3-540-46432-8_17
  • Fernau, Henning; Sempere, José M. Permutations and Control Sets for Learning Non-regular Language Families, Grammatical Inference: Algorithms and Applications, Volume 1891 (2000), p. 75 | DOI:10.1007/978-3-540-45257-7_7
  • Terlutte, Alain; Simplot, David Iteration of rational transductions, RAIRO. Theoretical Informatics and Applications, Volume 34 (2000) no. 2, pp. 99-129 | DOI:10.1051/ita:2000109 | Zbl:0962.68090
  • Simplot, D.; Terlutte, A. Closure under union and composition of iterated rational transductions, RAIRO. Theoretical Informatics and Applications, Volume 34 (2000) no. 3, pp. 183-212 | DOI:10.1051/ita:2000114 | Zbl:0970.68085
  • Caron, Pascal Families of locally testable languages, Theoretical Computer Science, Volume 242 (2000) no. 1-2, pp. 361-376 | DOI:10.1016/s0304-3975(98)00332-6 | Zbl:0944.68097
  • Kiraz, George Anton; Grimley-Evans, Edmund Multi-tape automata for speech and language systems: A prolog implementation, Automata Implementation, Volume 1436 (1998), p. 87 | DOI:10.1007/bfb0031383
  • Porrot, Sylvain; Dauchet, Max; Durand, Bruno; Vereshchagin, Nikolai K. Deterministic rational transducers and random sequences, Foundations of Software Science and Computation Structures, Volume 1378 (1998), p. 258 | DOI:10.1007/bfb0053555
  • Latteux, Michel; Simplot, David; Terlutte, Alain Iterated length-preserving rational transductions, Mathematical Foundations of Computer Science 1998, Volume 1450 (1998), p. 286 | DOI:10.1007/bfb0055778
  • Hazewinkel, M. A, Encyclopaedia of Mathematics (1997), p. 1 | DOI:10.1007/978-94-015-1288-6_1
  • Autebert, Jean-Michel; Berstel, Jean; Boasson, Luc Context-Free Languages and Pushdown Automata, Handbook of Formal Languages (1997), p. 111 | DOI:10.1007/978-3-642-59136-5_3
  • Mateescu, Alexandru; Salomaa, Arto Aspects of Classical Language Theory, Handbook of Formal Languages (1997), p. 175 | DOI:10.1007/978-3-642-59136-5_4
  • Yu, Sheng Regular Languages, Handbook of Formal Languages (1997), p. 41 | DOI:10.1007/978-3-642-59136-5_2
  • Harju, Tero; Karhumäki, Juhani Morphisms, Handbook of Formal Languages (1997), p. 439 | DOI:10.1007/978-3-642-59136-5_7
  • Kuich, Werner Semirings and Formal Power Series: Their Relevance to Formal Languages and Automata, Handbook of Formal Languages (1997), p. 609 | DOI:10.1007/978-3-642-59136-5_9
  • Berstel, Jean; Pin, Jean-Eric Local languages and the Berry-Sethi algorithm, Theoretical Computer Science, Volume 155 (1996) no. 2, pp. 439-446 | DOI:10.1016/0304-3975(95)00104-2 | Zbl:0872.68116
  • Wacrenier, Pierre-André Semi-trace morphisms and rational transductions, TAPSOFT '95: Theory and practice of software development. 6th international joint conference CAAP/FASE, Aarhus, Denmark, May 1995. Proceedings, Berlin: Springer-Verlag, 1995, pp. 303-317 | DOI:10.1007/3-540-59293-8_203 | Zbl:1496.68209
  • Harju, T.; Kleijn, H. C. M.; Latteux, M.; Terlutte, A. Representation of rational functions with prefix and suffix codings, Theoretical Computer Science, Volume 134 (1994) no. 2, pp. 403-413 | DOI:10.1016/0304-3975(94)90245-3 | Zbl:0823.68055
  • Vivarès, F. Modelling Jackson's programming method, Science of Computer Programming, Volume 20 (1993) no. 3, p. 173 | DOI:10.1016/0167-6423(93)90013-f
  • Keesmaat, N. W.; Kleijn, H. C. M. The effect of Vector synchronization: Residue and loss, Advances in Petri Nets 1992, Volume 609 (1992), p. 215 | DOI:10.1007/3-540-55610-9_173
  • Caspi, Paul Clocks in dataflow languages, Theoretical Computer Science, Volume 94 (1992) no. 1, pp. 125-140 | DOI:10.1016/0304-3975(92)90326-b | Zbl:0745.68032
  • Pelletier, Maryse Monoids described by pushdown automata, Aspects and Prospects of Theoretical Computer Science, Volume 464 (1990), p. 195 | DOI:10.1007/3-540-53414-8_42
  • SALOMAA, A. Formal Languages and Power Series, Formal Models and Semantics (1990), p. 103 | DOI:10.1016/b978-0-444-88074-1.50008-1
  • Nivat, M.; Saoudi, A.; Dare, V. R. Parallel generation of infinite images, International Journal of Computer Mathematics, Volume 35 (1990) no. 1-4, pp. 25-42 | DOI:10.1080/00207169008803888 | Zbl:0699.68103
  • Pierre, Laurent; Farinone, Jean-Marc Context-free languages with rational index in Θ(nλ) for algebraic numbers λ, RAIRO. Informatique Théorique et Applications, Volume 24 (1990) no. 3, pp. 275-322 | DOI:10.1051/ita/1990240302751 | Zbl:0701.68068
  • Terlutte, Alain Cyclic rational transductions and polynomials of rational functions, Theoretical Computer Science, Volume 70 (1990) no. 2, pp. 261-271 | DOI:10.1016/0304-3975(90)90126-3 | Zbl:0703.68068
  • Moriya, Tetsuo Closure property of principal cones under substitution, Information Processing Letters, Volume 29 (1988) no. 6, pp. 315-317 | DOI:10.1016/0020-0190(88)90231-1 | Zbl:0662.68075
  • Terlutte, Alain Cyclic rational transductions and polynomials of rational functions, STACS 88, Volume 294 (1988), p. 149 | DOI:10.1007/bfb0035841
  • Choffrut, C.; Schützenberger, M. P. Counting with rational functions, Theoretical Computer Science, Volume 58 (1988) no. 1-3, pp. 81-101 | DOI:10.1016/0304-3975(88)90020-5 | Zbl:0664.68057
  • Ratoandromanana, B. Quotient and bounded context-free languages, International Journal of Computer Mathematics, Volume 22 (1987) no. 3-4, pp. 213-225 | DOI:10.1080/00207168708803594 | Zbl:0656.68080
  • Sakarovitch, Jacques Kleene's theorem revisited, Trends, Techniques, and Problems in Theoretical Computer Science, Volume 281 (1987), p. 39 | DOI:10.1007/3540185356_29
  • Choffrut, C.; Schutzenberger, M. P. Counting with rational functions, Automata, Languages and Programming, Volume 226 (1986), p. 79 | DOI:10.1007/3-540-16761-7_57
  • Hotz, Günter A representation theorem of infinite dimensional algebras and applications to language theory, Journal of Computer and System Sciences, Volume 33 (1986), pp. 423-455 | DOI:10.1016/0022-0000(86)90061-9 | Zbl:0625.68054
  • Foryś, Wit Fixed point languages of rational transductions, Semigroup Forum, Volume 34 (1986), pp. 177-183 | DOI:10.1007/bf02573161 | Zbl:0618.68065
  • Johnson, J. Howard Rational equivalence relations, Theoretical Computer Science, Volume 47 (1986), pp. 39-60 | DOI:10.1016/0304-3975(86)90132-5 | Zbl:0619.68051
  • Latteux, M.; Leguy, B.; Ratoandromanana, B. The family of one-counter languages is closed under quotient, Acta Informatica, Volume 22 (1985) no. 5, p. 579 | DOI:10.1007/bf00267045
  • Johnson, J. H. Do rational equivalence relations have regular cross-sections?, Automata, Languages and Programming, Volume 194 (1985), p. 300 | DOI:10.1007/bfb0015755
  • Latteux, Michel; Leguy, Jeannine On the usefulness of bifaithful rational cones, Mathematical Systems Theory, Volume 18 (1985), pp. 19-32 | DOI:10.1007/bf01699459 | Zbl:0604.68083
  • Brauer, W.; Lange, K. -J. Non-deterministic two-tape automata are more powerful than deterministic ones, STACS 85, Volume 182 (1985), p. 71 | DOI:10.1007/bfb0023996
  • Choffrut, C.; Schutzenberger, M. P Decomposition de Fonctions Rationnelles, STACS 86, Volume 210 (1985), p. 213 | DOI:10.1007/3-540-16078-7_78
  • Brauer, Wilfried Transduktoren und Zweibandautomaten, Automatentheorie (1984), p. 407 | DOI:10.1007/978-3-322-92151-2_8
  • Gire, F.; Nivat, M. Relations rationnelles infinitaires, Calcolo, Volume 21 (1984), pp. 91-125 | DOI:10.1007/bf02575909 | Zbl:0552.68064
  • Hotz, Günter Outline of an algebraic language theory, Mathematical Foundations of Computer Science 1984, Volume 176 (1984), p. 64 | DOI:10.1007/bfb0030290
  • Hespel, Christiane Approximation de séries formelles par des séries rationnelles, RAIRO, Informatique Théorique, Volume 18 (1984), pp. 241-258 | Zbl:0549.68052
  • Hespel, Christiane Approximation de séries formelles par des séries rationnelles, RAIRO. Informatique théorique, Volume 18 (1984) no. 3, p. 241 | DOI:10.1051/ita/1984180302411
  • Gabarro, J. Pusdown space complexity and related full-A.F.L.s., STACS 84, Volume 166 (1984), p. 250 | DOI:10.1007/3-540-12920-0_23
  • Gabarro, J. Initial index: A new complexity function for languages, Automata, Languages and Programming, Volume 154 (1983), p. 226 | DOI:10.1007/bfb0036911
  • Latteux, M.; Leguy, J. On the composition of morphisms and inverse morphisms, Automata, Languages and Programming, Volume 154 (1983), p. 420 | DOI:10.1007/bfb0036926
  • Latteux, Michel On a language without star, Information Processing Letters, Volume 16 (1983), pp. 27-30 | DOI:10.1016/0020-0190(83)90008-x | Zbl:0501.68043
  • Gonczarowski, J.; Kleijn, H. C. M.; Rozenberg, G. Closure properties of selective substitution grammars. I, International Journal of Computer Mathematics, Volume 14 (1983), pp. 19-42 | DOI:10.1080/00207168308803374 | Zbl:0514.68071
  • Latteux, Michel Langages à un compteur, Journal of Computer and System Sciences, Volume 26 (1983), pp. 14-33 | DOI:10.1016/0022-0000(83)90018-1 | Zbl:0508.68050
  • Soria, Michèle Une extension des langages déterministes, RAIRO, Informatique Théorique, Volume 17 (1983), pp. 301-319 | Zbl:0545.68068
  • Soria, Michèle Une extension des langages déterministes, RAIRO. Informatique théorique, Volume 17 (1983) no. 4, p. 301 | DOI:10.1051/ita/1983170403011
  • Choffrut, Christian; Culik II, Karel Properties of Finite and Pushdown Transducers, SIAM Journal on Computing, Volume 12 (1983) no. 2, p. 300 | DOI:10.1137/0212019
  • Autebert, Jean-Michel; Beauquier, Joffroy; Boasson, Luc Formes de langages et de grammaires, Acta Informatica, Volume 17 (1982), pp. 193-213 | DOI:10.1007/bf00288970 | Zbl:0467.68065
  • Leguy, Jeannine Langages satures et cônes decroissants. Langages et cônes bifideles, Acta Informatica, Volume 18 (1982), pp. 65-78 | DOI:10.1007/bf00625281 | Zbl:0493.68084
  • Gabarro, J. Une application des notions de centre et index rationnel à certains langages algébriques, RAIRO, Informatique Théorique, Volume 16 (1982), pp. 317-330 | Zbl:0505.68033
  • Gabarro, J. Une application des notions de centre et index rationnel à certains langages algébriques, RAIRO. Informatique théorique, Volume 16 (1982) no. 4, p. 317 | DOI:10.1051/ita/1982160403171
  • Gire, F. Une extension aux mots infinis de la notion de transduction rationnelle, Theoretical Computer Science, Volume 145 (1982), p. 123 | DOI:10.1007/bfb0009639
  • Arnold, A.; Dauchet, M. Morphismes et bimorphismes d'arbres, Theoretical Computer Science, Volume 20 (1982), pp. 33-93 | DOI:10.1016/0304-3975(82)90098-6 | Zbl:0486.68072
  • Nivat, Maurice Behaviors of Processes and Synchronized Systems of Processes, Theoretical Foundations of Programming Methodology (1982), p. 473 | DOI:10.1007/978-94-009-7893-5_14
  • Istrail, Sorin Chomsky-Schotzenberger representations for families of languages and grammatical types, Automata, Languages and Programming, Volume 115 (1981), p. 333 | DOI:10.1007/3-540-10843-2_28
  • Beauquier, J. A new operation between languages, Fundamentals of Computation Theory, Volume 117 (1981), p. 400 | DOI:10.1007/3-540-10854-8_44
  • Courcelle, Bruno The simultaneous accessibility of two configurations of two equivalent DPDA's, Information Processing Letters, Volume 12 (1981), pp. 111-114 | DOI:10.1016/0020-0190(81)90105-8 | Zbl:0459.68019
  • Autebert, Jean-Michel; Beauquier, Joffroy; Boasson, Luc; Latteux, Michel Langages algébriques dominés par des langages unaires, Information and Control, Volume 48 (1981) no. 1, p. 49 | DOI:10.1016/s0019-9958(81)90588-x
  • Sakarovitch, Jacques Sur une propriété d'itération des languages algébriques déterministes, Mathematical Systems Theory, Volume 14 (1981), pp. 247-288 | DOI:10.1007/bf01752401 | Zbl:0472.68042
  • Leguy, Jeannine Transductions rationnelles decroissantes, RAIRO, Informatique Théorique, Volume 15 (1981), pp. 141-148 | Zbl:0456.68097
  • Lilin, E. Transducteurs finis d'arbres et tests d'egalite, RAIRO, Informatique Théorique, Volume 15 (1981), pp. 213-232 | Zbl:0474.68091
  • Leguy, Jeannine Transductions rationnelles décroissantes, RAIRO. Informatique théorique, Volume 15 (1981) no. 2, p. 141 | DOI:10.1051/ita/1981150201411
  • Lilin, E. Transducteurs finis d'arbres et tests d'égalité, RAIRO. Informatique théorique, Volume 15 (1981) no. 3, p. 213 | DOI:10.1051/ita/1981150302131
  • Boasson, Luc; Courcelle, Bruno; Nivat, Maurice The Rational Index: A Complexity Measure for Languages, SIAM Journal on Computing, Volume 10 (1981) no. 2, p. 284 | DOI:10.1137/0210020
  • Sakarovitch, Jacques Description des Monoïdes de Type Fini, Semigroups, Volume 855 (1981), p. 92 | DOI:10.1007/bfb0089812
  • Choffrut, C. Prefix-preservation for rational partial functions is decidable, Theoretical Computer Science, Volume 104 (1981), p. 159 | DOI:10.1007/bfb0017308
  • Beauquier, Joffroy Substitution of semi-AFL's, Theoretical Computer Science, Volume 14 (1981), pp. 187-193 | DOI:10.1016/0304-3975(81)90056-6 | Zbl:0472.68039
  • Latteux, Michel Sur les générateurs algébriques et linéaires, Acta Informatica, Volume 13 (1980), pp. 347-363 | DOI:10.1007/bf00288769 | Zbl:0414.68047
  • Maurer, H. A.; Nivat, M. Rational bijection of rational sets, Acta Informatica, Volume 13 (1980), pp. 365-378 | DOI:10.1007/bf00288770 | Zbl:0432.68051
  • Autebert, Jean-Michel; Boasson, Luc GENERATORS OF CONES AND CYLINDERS11Preparation of this paper was supported in part by the National Science Foundation under Grant No. MCS79-04012., Formal Language Theory (1980), p. 49 | DOI:10.1016/b978-0-12-115350-2.50008-7
  • Latteux, Michel Transduction rationnelle, substitution et complémentaire, Information and Control, Volume 45 (1980) no. 3, p. 285 | DOI:10.1016/s0019-9958(80)90670-1
  • Greibach, S. A., 20th Annual Symposium on Foundations of Computer Science (sfcs 1979) (1979), p. 66 | DOI:10.1109/sfcs.1979.19
  • Autebert, Jean-Michel Opérations de cylindre et applications séquentielles gauches inverses, Acta Informatica, Volume 11 (1979), pp. 241-258 | DOI:10.1007/bf00289070 | Zbl:0388.68076
  • Goldstine, Jonathan A rational theory of AFLs, Automata, Languages and Programming, Volume 71 (1979), p. 271 | DOI:10.1007/3-540-09510-1_21
  • Latteux, Michel Substitutions dans les EDT0L systèmes ultralinéaires, Information and Control, Volume 42 (1979) no. 2, p. 194 | DOI:10.1016/s0019-9958(79)90641-7
  • Beauquier, Joffroy Deux Familles de Langages Incomparables, Information and Control, Volume 43 (1979) no. 2, p. 101 | DOI:10.1016/s0019-9958(79)90642-9
  • Latteux, Michel Cônes rationnels commutatifs, Journal of Computer and System Sciences, Volume 18 (1979), pp. 307-333 | DOI:10.1016/0022-0000(79)90039-4 | Zbl:0421.68074
  • Autebert, Jean-Michel Relationships between AFDL's and cylinders, Mathematical Foundations of Computer Science 1979, Volume 74 (1979), p. 219 | DOI:10.1007/3-540-09526-8_18
  • Arnold, A.; Dauchet, M. Théorie des magmoides. II, RAIRO, Informatique Théorique, Volume 13 (1979), pp. 135-154 | Zbl:0443.68053
  • Autebert, J. M.; Beauquier, J.; Boasson, L.; Nivat, M. Quelques problèmes ouverts en théorie des langages algébriques, RAIRO, Informatique Théorique, Volume 13 (1979), pp. 363-378 | Zbl:0434.68056
  • Arnold, A.; Dauchet, M. Théorie des magmoïdes, RAIRO. Informatique théorique, Volume 13 (1979) no. 2, p. 135 | DOI:10.1051/ita/1979130201351
  • Arnold, Andre; Latteux, Michel A new proof of two theorems about rational transductions, Theoretical Computer Science, Volume 8 (1979), pp. 261-263 | DOI:10.1016/0304-3975(79)90049-5 | Zbl:0401.68057
  • Beauquier, Joffroy Générateurs algébriques et systèmes de paires iterantes, Theoretical Computer Science, Volume 8 (1979), pp. 293-323 | DOI:10.1016/0304-3975(79)90015-x | Zbl:0408.68071
  • Autebert, Jean-Michel Une note sur le cylindre des langages déterministes, Theoretical Computer Science, Volume 8 (1979), pp. 395-399 | DOI:10.1016/0304-3975(79)90020-3 | Zbl:0398.68030
  • Rodriguez, F. Familles de langages fermées par crochet ouvert, Theoretical Computer Science, Volume 9 (1979), pp. 385-398 | DOI:10.1016/0304-3975(79)90038-0 | Zbl:0413.68074
  • Latteux, M. Sur deux langages linéaires, Theoretical Computer Science 4th GI Conference, Volume 67 (1979), p. 182 | DOI:10.1007/3-540-09118-1_20
  • Sakarovitch, Jacques Theoreme de transversale rationnelle pour les automates a pile deterministes, Theoretical Computer Science 4th GI Conference, Volume 67 (1979), p. 276 | DOI:10.1007/3-540-09118-1_29
  • Arnold, A.; Dauchet, M. Sur l'inversion des morphismes d'arbres, Automata, Languages and Programming, Volume 62 (1978), p. 26 | DOI:10.1007/3-540-08860-1_3
  • Beauquier, Joffroy Ambiguite forte, Automata, Languages and Programming, Volume 62 (1978), p. 52 | DOI:10.1007/3-540-08860-1_5
  • Arnold, A.; Latteux, M. Recursivite et cônes rationnels fermés par intersection, Calcolo, Volume 15 (1978), pp. 382-394 | DOI:10.1007/bf02576519 | Zbl:0421.68075
  • Salomaa, Arto K. Abstrakte Familien von Sprachen, Formale Sprachen (1978), p. 121 | DOI:10.1007/978-3-642-67081-7_4
  • Arnold, A.; Dauchet, M. Une rélation d'équivalence decidable sur la classe des forets reconnaissables, Mathematical Systems Theory, Volume 12 (1978), pp. 103-128 | DOI:10.1007/bf01776568 | Zbl:0392.68065
  • Latteux, Michel Mots infinis et langages commutatifs, RAIRO, Informatique Théorique, Volume 12 (1978), pp. 185-192 | Zbl:0387.68051
  • Choffrut, Christian Sur les transductions reconnaissables, RAIRO, Informatique Théorique, Volume 12 (1978), pp. 203-212 | Zbl:0423.20053
  • Latteux, Michel Mots infinis et langages commutatifs, RAIRO. Informatique théorique, Volume 12 (1978) no. 3, p. 185 | DOI:10.1051/ita/1978120301851
  • Choffrut, Christian Sur les transductions reconnaissables, RAIRO. Informatique théorique, Volume 12 (1978) no. 3, p. 203 | DOI:10.1051/ita/1978120302031
  • Latteux, Michel Produit dans le cône rationnel engendre par D, Theoretical Computer Science, Volume 5 (1978), pp. 129-134 | DOI:10.1016/0304-3975(77)90003-2 | Zbl:0368.68076
  • Schützenberger, M. P. Une propriété de Hankel des rélations fonctionnelles entre monoides libres, Advances in Mathematics, Volume 24 (1977), pp. 274-280 | DOI:10.1016/s0001-8708(77)80045-5 | Zbl:0403.68057
  • Schützenberger, M.P Une propriété de Hankel des relations fonctionnelles entre monoïdes libres, Advances in Mathematics, Volume 24 (1977) no. 3, p. 274 | DOI:10.1016/0001-8708(77)90058-5
  • Takahashi, Masako Rational relations of binary trees, Automata, Languages and Programming, Volume 52 (1977), p. 524 | DOI:10.1007/3-540-08342-1_41
  • Arnold, A.; Dauchet, M. Un théorème de Chomsky-Schützenberger pour les forets algébriques, Calcolo, Volume 14 (1977), pp. 161-184 | DOI:10.1007/bf02575971 | Zbl:0363.68105
  • Berstel, J. Some recent results on recognizable formal power series, Fundamentals of Computation Theory, Volume 56 (1977), p. 39 | DOI:10.1007/3-540-08442-8_68
  • Christian, Choffrut Sur Certaines Applications Séquentielles Numériques, Information and Control, Volume 33 (1977) no. 4, p. 352 | DOI:10.1016/s0019-9958(77)90470-3
  • Blattner, Meera; Head, Tom Single-valued a-transducers, Journal of Computer and System Sciences, Volume 15 (1977), pp. 310-327 | DOI:10.1016/s0022-0000(77)80033-0 | Zbl:0367.94071
  • Boasson, L. Classification of the context-free languages, Mathematical Foundations of Computer Science 1977, Volume 53 (1977), p. 34 | DOI:10.1007/3-540-08353-7_125
  • Autebert, J.-M. Non-principalite du cylindre des langages à compteur, Mathematical Systems Theory, Volume 11 (1977), pp. 157-167 | DOI:10.1007/bf01768474 | Zbl:0351.68026
  • Latteux, Michel Cônes rationnels commutativement clos, RAIRO, Informatique Théorique, Volume 11 (1977), pp. 29-51 | Zbl:0354.68103
  • Latteux, Michel Cônes rationnels commutativement clos, RAIRO. Informatique théorique, Volume 11 (1977) no. 1, p. 29 | DOI:10.1051/ita/1977110100291
  • Sakarovitch, J. Sur les groupes infinis, consideres comme monoides syntaxiques de langages formels, Séminaire d’Algèbre Paul Dubreil Paris 1975–1976 (29ème Année), Volume 586 (1977), p. 168 | DOI:10.1007/bfb0087132
  • Schützenberger, M. P. Sur une variante des fonctions séquentielles, Theoretical Computer Science, Volume 4 (1977), pp. 47-57 | DOI:10.1016/0304-3975(77)90055-x | Zbl:0366.68043
  • Boasson, L. Un langage algebrique non-generateur, Theoretical Computer Science, Volume 48 (1977), p. 145 | DOI:10.1007/3-540-08138-0_12
  • Rodriguez, F. Familles de langages fermees par crochet et crochet ouvert, Theoretical Computer Science, Volume 48 (1977), p. 154 | DOI:10.1007/3-540-08138-0_14
  • Jacob, G. Decidabilite de la finitude des demi-groupes de matrices, Theoretical Computer Science, Volume 48 (1977), p. 259 | DOI:10.1007/3-540-08138-0_22
  • Blattner, Meera Structural similarity in context-free languages, Information and Control, Volume 30 (1976) no. 3, p. 267 | DOI:10.1016/s0019-9958(76)90518-0
  • Choffrut, C. Strongly connected G-S-M mappings preserving conjugation, Mathematical Foundations of Computer Science 1976, Volume 45 (1976), p. 224 | DOI:10.1007/3-540-07854-1_178
  • Sakarovitch, J. An algebraic framework for the study of the syntactic monoids application to the group languages, Mathematical Foundations of Computer Science 1976, Volume 45 (1976), p. 510 | DOI:10.1007/3-540-07854-1_222
  • Boasson, L. Langages algébriques, paires iterantes et transductions rationnelles, Theoretical Computer Science, Volume 2 (1976), pp. 209-223 | DOI:10.1016/0304-3975(76)90033-5 | Zbl:0378.68037
  • Jacob, Géerard Sur un Théorème de Shamir, Information and Control, Volume 27 (1975) no. 3, p. 218 | DOI:10.1016/s0019-9958(75)90140-0
  • Cohn, P. M. Progress in free associative algebras, Israel Journal of Mathematics, Volume 19 (1975), pp. 109-151 | DOI:10.1007/bf02756628 | Zbl:0303.16001
  • Ginsburg, Seymour; Goldstine, Jonathan; Greibach, Sheila Uniformly erasable AFL, Journal of Computer and System Sciences, Volume 10 (1975), pp. 165-182 | DOI:10.1016/s0022-0000(75)80038-9 | Zbl:0325.68042
  • Greibach, S. A. One counter languages and the IRS condition, Journal of Computer and System Sciences, Volume 10 (1975), pp. 237-247 | DOI:10.1016/s0022-0000(75)80042-0 | Zbl:0307.68062
  • Cremers, Armin; Ginsburg, Seymour Context-free grammar forms, Journal of Computer and System Sciences, Volume 11 (1975), pp. 86-117 | DOI:10.1016/s0022-0000(75)80051-1 | Zbl:0328.68071
  • Crestin, J. P. Ultralinear expressions, Mathematical Foundations of Computer Science, Volume 28 (1975), p. 222 | DOI:10.1007/3-540-07162-8_682
  • Boasson, L. On the largest full sub — AFL of the full AFL of context-free languages, Mathematical Foundations of Computer Science 1975 4th Symposium, Mariánské Lázně, September 1–5, 1975, Volume 32 (1975), p. 194 | DOI:10.1007/3-540-07389-2_195
  • Walter, Herman Topologies on formal languages, Mathematical Systems Theory, Volume 9 (1975), pp. 142-158 | DOI:10.1007/bf01704017 | Zbl:0346.68030
  • Durieux, J. L. Sur l'image, par une transduction rationnelle, des mots sur une lettre, Revue française d'automatique informatique recherche opérationnelle. Informatique théorique, Volume 9 (1975) no. R2, p. 25 | DOI:10.1051/ita/197509r200251
  • Cremers, Armin B.; Ginsburg, Seymour Context-Free Grammar Forms, Automata, Languages and Programming, Volume 14 (1974), p. 364 | DOI:10.1007/978-3-662-21545-6_28
  • Berstel, J.; Boasson, L. Une Suite Decroissante de Cônes Rationnels, Automata, Languages and Programming, Volume 14 (1974), p. 383 | DOI:10.1007/978-3-662-21545-6_29
  • Chapter IX Rational Relations, Automata, Languages, and Machines, Volume 59 (1974), p. 236 | DOI:10.1016/s0079-8169(08)60883-1
  • Fliess, Michel Sur divers produits de séries formelles, Bulletin de la Société Mathématique de France, Volume 102 (1974), pp. 181-191 | DOI:10.24033/bsmf.1777 | Zbl:0313.13021
  • Fliess, Michel Transductions de séries formelles, Discrete Mathematics, Volume 10 (1974), pp. 57-74 | DOI:10.1016/0012-365x(74)90020-x | Zbl:0301.16003
  • Boasson, L. The inclusion of the substitution closure of linear and one-counter languages in the largest sub-AFL of the family of algebraic languages is proper, Information Processing Letters, Volume 2 (1974) no. 5, p. 135 | DOI:10.1016/0020-0190(74)90050-7
  • Gladkii, A. V.; Dikovskii, A. Ja. Theory of formal grammars, Journal of Soviet Mathematics, Volume 2 (1974), pp. 542-563 | DOI:10.1007/bf01085017 | Zbl:0287.68044
  • Courcelle, Bruno Une forme canonique pour les grammaires simples déterministes, Revue Française d'Automatique, Informatique, Recherche Opérationnelle. Série Rouge, Volume 8 (1974) no. 1, pp. 19-36 | Zbl:0285.68033
  • Autebert, J. M.; Beauquier, J. Une caractérisation des générateurs standard, Revue Française d'Automatique, Informatique, Recherche Opérationnelle. Série Rouge, Volume 8 (1974) no. 1, pp. 63-83 | Zbl:0294.68031
  • Courcelle, Bruno Une forme canonique pour les grammaires simples déterministes, Revue française d'automatique informatique recherche opérationnelle. Informatique théorique, Volume 8 (1974) no. R1, p. 19 | DOI:10.1051/ita/197408r100191
  • Boasson, L.; Crestin, J. P.; Nivat, M. Familles de langages translatables et fermées par crochet, Acta Informatica, Volume 2 (1973), pp. 383-393 | DOI:10.1007/bf00289506 | Zbl:0311.68047
  • Autebert, J. -M. Quelques generateurs des langages algebriques, GI Gesellschaft für Informatik e. V. 1. Fachtagung über Automatentheorie und Formale Sprachen, Volume 2 (1973), p. 123 | DOI:10.1007/bfb0039146
  • Beauquier, J. Une caracterisation des langages quasi-rationnels standards, GI Gesellschaft für Informatik e. V. 1. Fachtagung über Automatentheorie und Formale Sprachen, Volume 2 (1973), p. 132 | DOI:10.1007/bfb0039147
  • Rodriguez, F. Une hierarchie infinie de cones d'Accepteurs verificateurs, GI Gesellschaft für Informatik e. V. 1. Fachtagung über Automatentheorie und Formale Sprachen, Volume 2 (1973), p. 81 | DOI:10.1007/bfb0039141
  • Garland, Stephen J.; Luckham, David C. Program schemes, recursion schemes, and formal languages, Journal of Computer and System Sciences, Volume 7 (1973), pp. 119-160 | DOI:10.1016/s0022-0000(73)80040-6 | Zbl:0277.68010
  • Boasson, L. Two iteration theorems for some families of languages, Journal of Computer and System Sciences, Volume 7 (1973), pp. 583-596 | DOI:10.1016/s0022-0000(73)80036-4 | Zbl:0298.68053
  • Berstel, Jean Une hierarchie des parties rationnelles de N2, Mathematical Systems Theory, Volume 7 (1973), pp. 114-137 | DOI:10.1007/bf01762231 | Zbl:0257.68078
  • Berstel, Jean, 13th Annual Symposium on Switching and Automata Theory (swat 1972) (1972), p. 200 | DOI:10.1109/swat.1972.11
  • Cori, Robert; Richard, Jean Enumeration des graphes planaires à l'aide des séries formelles en variables non commutatives, Discrete Mathematics, Volume 2 (1972), pp. 115-162 | DOI:10.1016/0012-365x(72)90080-5 | Zbl:0247.05140
  • Cori, Robert Sur la rationalite de certaines séries generatrices, Discrete Mathematics, Volume 3 (1972), pp. 315-332 | DOI:10.1016/0012-365x(72)90089-1 | Zbl:0255.05119
  • Greibach, Sheila A. Syntactic operators on full semiAFLs, Journal of Computer and System Sciences, Volume 6 (1972), pp. 30-76 | DOI:10.1016/s0022-0000(72)80039-4 | Zbl:0269.68046
  • Cochet, Y.; Nivat, M. Une généralisation des ensembles de Dyck, Israel Journal of Mathematics, Volume 9 (1971), pp. 389-395 | DOI:10.1007/bf02771689 | Zbl:0215.56005
  • Fliess, Michel Deux applications de la représentation matricielle d'une série rationnelle non commutative. (Two applications of matrix representations of a rational non -commutative series), Journal of Algebra, Volume 19 (1971), pp. 344-353 | DOI:10.1016/0021-8693(71)90094-9 | Zbl:0222.16001
  • Fliess, Michel, 11th Annual Symposium on Switching and Automata Theory (swat 1970) (1970), p. 81 | DOI:10.1109/swat.1970.6
  • Greibach, S. A. Chains of full AFL's, Mathematical Systems Theory, Volume 4 (1970) no. 2, p. 231 | DOI:10.1007/bf01691106
  • Fliess, Michel Transductions algébriques, Revue française d'informatique et de recherche opérationnelle. Série rouge, Volume 4 (1970) no. R1, p. 109 | DOI:10.1051/m2an/197004r101091

Cité par 222 documents. Sources : Crossref, zbMATH