[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"detail-sidebar-cat-0-fr-114":3,"doc-seo-427528-114":48,"doc-detail-427528-fr":114},{"code":4,"msg":5,"data":6},0,"success",[7,13,18,21,24,28,32,36,40,44],{"id":8,"doc_module":4,"doc_module_name":9,"category_name":10,"show_sort_weight":11,"slug":12},67,"Document","Général",61,"general",{"id":14,"doc_module":4,"doc_module_name":9,"category_name":15,"show_sort_weight":16,"slug":17},66,"Art de vivre",60,"lifestyle",{"id":11,"doc_module":4,"doc_module_name":9,"category_name":19,"show_sort_weight":16,"slug":20},"Bande dessinée","comic",{"id":16,"doc_module":4,"doc_module_name":9,"category_name":22,"show_sort_weight":16,"slug":23},"Examen","exam",{"id":25,"doc_module":4,"doc_module_name":9,"category_name":26,"show_sort_weight":16,"slug":27},59,"Littérature","literature",{"id":29,"doc_module":4,"doc_module_name":9,"category_name":30,"show_sort_weight":16,"slug":31},64,"Recherche & Rapport","research-report",{"id":33,"doc_module":4,"doc_module_name":9,"category_name":34,"show_sort_weight":16,"slug":35},58,"Récits & Romans","story-novel",{"id":37,"doc_module":4,"doc_module_name":9,"category_name":38,"show_sort_weight":16,"slug":39},65,"Religion & Spiritualité","religion-spirituality",{"id":41,"doc_module":4,"doc_module_name":9,"category_name":42,"show_sort_weight":16,"slug":43},63,"Santé & Soins","healthcare",{"id":45,"doc_module":4,"doc_module_name":9,"category_name":46,"show_sort_weight":16,"slug":47},62,"Technologie","technology",{"code":4,"msg":49,"data":50},"ok",{"site_id":51,"language":52,"slug":53,"title":54,"keywords":55,"description":56,"schema_data":57,"social_meta":107,"head_meta":109,"extra_data":111,"updated_unix":113},114,"fr","geometric-applications-of-formal-languages-regular-features","APPLICATIONS GEOMETRIQUES DES LANGAGES FORMELS - REGULAR FEATURES","","Travaux sur la connexion entre grammaires formelles et objets géométriques via des méthodes issues de la théorie des langages formels. L’article propose des exemples de grammaires de Chomsky capables d’engendrer des figures géométriques simples, puis indique comment, en ne retenant que certains paramètres, on obtient des fonctions génératrices classiques. Il discute aussi l’obtention d’énumérations de figures plus compliquées par des techniques standards, en s’appuyant sur des suggestions et relectures de collègues mentionnés dans le texte.",{"@graph":58,"@context":106},[59,76,97],{"@type":60,"itemListElement":61},"BreadcrumbList",[62,67,70,73],{"item":63,"name":64,"@type":65,"position":66},"https://docshare.wps.com","Home","ListItem",1,{"item":68,"name":9,"@type":65,"position":69},"https://docshare.wps.com/fr/document/",2,{"item":71,"name":30,"@type":65,"position":72},"https://docshare.wps.com/fr/document/recherche-rapport/",3,{"item":74,"name":54,"@type":65,"position":75},"https://docshare.wps.com/fr/document/geometric-applications-of-formal-languages-regular-features/427528/",4,{"url":74,"name":54,"@type":77,"image":78,"author":83,"headline":54,"publisher":86,"fileFormat":89,"inLanguage":52,"description":56,"dateModified":90,"datePublished":91,"encodingFormat":89,"isAccessibleForFree":92,"interactionStatistic":93},"DigitalDocument",{"url":79,"@type":80,"width":81,"height":82},"https://docshare.wps.com/thumbnails/geometric-applications-of-formal-languages-regular-features/427528.png","ImageObject",300,407,{"name":84,"@type":85},"Anna Hans","Person",{"url":63,"name":87,"@type":88},"DocShare","Organization","application/pdf","2026-10-04","2026-09-29",true,{"@type":94,"interactionType":95,"userInteractionCount":72},"InteractionCounter",{"@type":96},"ViewAction",{"@type":98,"mainEntity":99},"FAQPage",[100],{"name":101,"@type":102,"acceptedAnswer":103},"Comment l’article définit-il une grammaire et le langage qu’elle engendre ?","Question",{"text":104,"@type":105},"Une grammaire est un ensemble fini de règles de réécriture à partir d’un axiome, et le langage associé correspond à l’ensemble des mots obtenus par applications successives des règles en commençant par l’axiome.","Answer","https://schema.org",{"og:url":74,"og:type":108,"og:title":54,"og:site_name":87,"og:description":56},"article",{"robots":110,"canonical":74},"index,follow",{"doc_id":112,"site_id":51},427528,1791023959,{"code":4,"msg":5,"data":115},{"doc_id":112,"user_id":116,"nickname":84,"user_avatar":117,"doc_module":4,"category_id":29,"category_name":30,"doc_title":54,"doc_description":56,"doc_content":118,"file_id":119,"file_url":120,"file_type":121,"file_size":122,"view_count":72,"is_deleted":4,"is_public":66,"is_downloadable":66,"audit_status":66,"page_count":123,"language":124,"language_code":52,"site_id":51,"html_lang":52,"table_of_contents":125,"faqs":126,"seo_title":127,"seo_description":56,"update_tm":128,"read_time":129},5909892332657,"https://ap-avatar.wpscdn.com/davatar_994ba38a5ba835b3df7d355c54d3ed8d","ly-September 1966Volume 5,No.3me(C去).2ematen Cnoutatan cCante CCBULLETII  \nCONTENTS  \nplications géométriques des langages formels Conjecture concerning Non-Context-FreeLanguages  \nM.Gross  \nG.H.Matthews  \nEGULAR FEATURES  \nws of Computing Laboratories andUniversities  \nws of International Organizationsview of Computersok Reviews  \nINTERNATIONAL COMPUTATION CENTRECENTRE INTERNATIONAL DECALCUL  \nJ.Abadie(France)  \nE.Sparre Andersen (Denmark)R.Bellman (USA)  \nF.L.Bauer(Germany)S.F.Beltran(Mexico)  \nC.Berge(ICC)  \nC.Blanc(Switzerland)  \nC.Böhm(Italy)  \nE.R.Caianello(Italy)S.Comét (Sweden)  \nH.B.Curry(USA)  \nB.de Finetti(Italy)R.de Possel (France)P.Erdós(Hungary)  \nA.P.Ershov(USSR)R.Fortet (France)  \nF.Genuys(France)  \nA.Ghizzetti(Italy)P.Gillis(Belgium)V.Glushkov(USSR)  \nG.Hajós(Hungary)  \nA.J.Hoffman(USA)  \nL.Karp(Mexico)S.H.Khamis(Lebanon)  \nH.Kneser(Germany)  \nK.Kondo(Japan)  \ndell'E.U.R.,Rome.Cable address:INTERCALCOLO.  \n# I.C.C.BULLETIN\n\nEDITORIAL BOARD  \nH.Kuhn(USA)  \nM.Linsman(Belgium)  \nJ.L.Lions(France)  \nF.Loonstra(Netherlands)  \nL.Lukaszewicz(Poland)R.McNaughton(USA)S.Marcus(Rumania)  \nC.Moisil (Rumania)O.Morgenstern (USA)S.Moriguti(Japan)R.Narasimhan(India)  \nJ.Neveu(Belgium)  \nA.M.Ostrowski(Switzerland)  \nM.Rabin(Israel)P.Rabinowitz(Israel)  \nA.Renyi(Hungary)  \nM.Sadosky(Argentina)  \nM.P.Schützenberger(France)  \nL.Schmetterer(Austria)S.J.Shepherdson (UK)  \nH.Takahasi(Japan)O.Taussky Todd (USA)S.Ulam(USA)P.Wolfe(USA)  \nF.Yates(UK)  \nThe opinions expressed in signed articles in the ICC Bulletin are those of the authorsand do not necesarily represent the views of the International Computation Centre.  \nThe ICC Buletin,accepts articles in English and French,and is published quarterlyby Gordon and Breach,Science Publishers,Ltd.  \nSubscribtion rate:Libraries $15.00(5.5s),Individuals S7.50(2.12s).Subscriptionsshould be sent to Gordon and Breach,Science Publishers,Ltd.,9 Kingsway,London,W.C.2,England.  \nEdiorial Ofice:International Computation Centre,Casella postale No.10053,Zona  \n# APPLICATIONS GEOMETRIQUESDES LANGAGES FORMELS¹\n\nMAURICE GROSs  \nCentre National de la Recherche Scientifique,Laboratoire de Calcul Numerique,Institut Blaise Pascal,Paris  \nDANS certains problemes combinatoires d'énumération on obtient lenombre de certains objets ayant certaines caractéristiques (nombre desC-arbres ayant n aretes)au moyen d'une fonction génératrice.M.P.Schützenberger nous a suggéré que ces fonctions de variables commu-tatives devraient pouvoir s'obtenir à partir de fonctions de variablesnon-commutatives qui dans le cas des fonctions algébriques au sens deSchützenberger s'identifient à certaines classes importantes des gram-maires formelles.  \nNous donnons ici des exemples de grammaire de Chomsky quiengendrent des figures géométriques simples,quand on ne retient de cesfigures que certains parametres,on obtient les fonctions génératricesclassiques.  \nDes techniques standards de la théorie des langages formels permet-tent d³obtenir des énumérations de figures compliquées.  \nNous sommes redevables à M.P.Schützenberger de nombreusessuggestions età A.Lentin d'avoir relu notre manuscrit et d'en avoiréclairci certains points.  \n## I.GRAMMAIRES ET LANGAGES DE CHOMSKY²\n\n### 1)Definitions Genérales\n\nCe sont des systemes qui définissent certaines sous-classes du monoidelibre.Nous rappellerons ici leur définition,pour des descriptionsprécises voir Chomsky,Chomsky et Schützenberger.  \n1 Manuscript recu le 29.11.65.  \n2 En anglais:context-free grammar,context-free language.Nous utiliserons lesabréviations:C-grammaire et C-langage.  \nM.GROSs  \nSoitun ensembleVr={a;},que nous appellerons vocabulaire terminal,Vr comporte les lettres a;;soit F(VT)le monoide libre engendré parVT,c³est Iensemble des mots sur les a;nous appellerons langage toutensemble LcF(VT).  \nPour realiser Pénumération effective d³un langage c'est-à-dire pourengendrer ce langage,nous utiliserons une grammaire qui est unespecification récursive de ce langage.Pour définir une gramm","cbCaigIHEDuSyk33","https://ap.wps.com/l/cbCaigIHEDuSyk33","pdf",4157389,80,"French","# I. GRAMMAIRES ET LANGAGES DE CHOMSKY\n## 1)Definitions Genérales\n## 2)Exemple de C-Langage","[{\"question\":\"Comment l’article définit-il une grammaire et le langage qu’elle engendre ?\",\"answer\":\"Une grammaire est un ensemble fini de règles de réécriture à partir d’un axiome, et le langage associé correspond à l’ensemble des mots obtenus par applications successives des règles en commençant par l’axiome.\"}]","APPLICATIONS GEOMETRIQUES DES LANGAGES FORMELS - REGULAR FEATURES | PDF",1790644123,123]