Stop the war!
Остановите войну!
for scientists:
default search action
Search dblp for Publications
export results for "toc:db/journals/ita/ita14.bht:"
@article{DBLP:journals/ita/AstesianoC80, author = {Egidio Astesiano and Gerardo Costa}, title = {Nondeterminism and Fully Abstract Models}, journal = {{RAIRO} Theor. Informatics Appl.}, volume = {14}, number = {4}, pages = {323--347}, year = {1980}, url = {https://doi.org/10.1051/ita/1980140403231}, doi = {10.1051/ITA/1980140403231}, timestamp = {Mon, 25 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ita/AstesianoC80.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ita/CardonC80, author = {A. Cardon and Maxime Crochemore}, title = {D{\'{e}}termination de la Repr{\'{e}}sentation Standard d'une S{\'{e}}rie Reconnaissable}, journal = {{RAIRO} Theor. Informatics Appl.}, volume = {14}, number = {4}, pages = {371--379}, year = {1980}, url = {https://doi.org/10.1051/ita/1980140403711}, doi = {10.1051/ITA/1980140403711}, timestamp = {Mon, 25 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ita/CardonC80.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ita/CulikK80, author = {Karel Cul{\'{\i}}k II and Juhani Karhum{\"{a}}ki}, title = {On the Equality Sets for Homomorphisms on Free Monoids with Two Generators}, journal = {{RAIRO} Theor. Informatics Appl.}, volume = {14}, number = {4}, pages = {349--369}, year = {1980}, url = {https://doi.org/10.1051/ita/1980140403491}, doi = {10.1051/ITA/1980140403491}, timestamp = {Wed, 24 Mar 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ita/CulikK80.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ita/Duval80, author = {Jean{-}Pierre Duval}, title = {Mots de Lyndon et P{\'{e}}riodicit{\'{e}}}, journal = {{RAIRO} Theor. Informatics Appl.}, volume = {14}, number = {2}, pages = {181--191}, year = {1980}, url = {https://doi.org/10.1051/ita/1980140201811}, doi = {10.1051/ITA/1980140201811}, timestamp = {Mon, 25 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ita/Duval80.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ita/Enjalbert80, author = {Patrice Enjalbert}, title = {Syst{\`{e}}mes de D{\'{e}}duction pour les Arbres et les Sch{\'{e}}mas de Programmes}, journal = {{RAIRO} Theor. Informatics Appl.}, volume = {14}, number = {3}, pages = {247--278}, year = {1980}, url = {https://doi.org/10.1051/ita/1980140302471}, doi = {10.1051/ITA/1980140302471}, timestamp = {Mon, 25 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ita/Enjalbert80.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ita/Heilbrunner80, author = {Stephan Heilbrunner}, title = {An Algorithm for the Solution of Fixed-Point Equations for Infinite Words}, journal = {{RAIRO} Theor. Informatics Appl.}, volume = {14}, number = {2}, pages = {131--141}, year = {1980}, url = {https://doi.org/10.1051/ita/1980140201311}, doi = {10.1051/ITA/1980140201311}, timestamp = {Mon, 25 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ita/Heilbrunner80.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ita/Hotz80, author = {G{\"{u}}nter Hotz}, title = {Verschr{\"{a}}nkte Homomorphismen Formaler Sprachen}, journal = {{RAIRO} Theor. Informatics Appl.}, volume = {14}, number = {2}, pages = {193--208}, year = {1980}, url = {https://doi.org/10.1051/ita/1980140201931}, doi = {10.1051/ITA/1980140201931}, timestamp = {Mon, 25 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ita/Hotz80.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ita/Luca80, author = {Aldo de Luca}, title = {On Some Properties of the Syntactic Semigroup of a Very Pure Subsemigroup}, journal = {{RAIRO} Theor. Informatics Appl.}, volume = {14}, number = {1}, pages = {39--56}, year = {1980}, url = {https://doi.org/10.1051/ita/1980140100391}, doi = {10.1051/ITA/1980140100391}, timestamp = {Mon, 25 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ita/Luca80.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ita/Marchand80, author = {P. Marchand}, title = {Grammaires Parenth{\'{e}}s{\'{e}}es et Bilangages R{\'{e}}guliers}, journal = {{RAIRO} Theor. Informatics Appl.}, volume = {14}, number = {1}, pages = {3--38}, year = {1980}, url = {https://doi.org/10.1051/ita/1980140100031}, doi = {10.1051/ITA/1980140100031}, timestamp = {Mon, 25 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ita/Marchand80.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ita/Monien80, author = {Burkhard Monien}, title = {Two-Way Multihead Automata Over a One-Letter Alphabet}, journal = {{RAIRO} Theor. Informatics Appl.}, volume = {14}, number = {1}, pages = {67--82}, year = {1980}, url = {https://doi.org/10.1051/ita/1980140100671}, doi = {10.1051/ITA/1980140100671}, timestamp = {Mon, 25 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ita/Monien80.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ita/Paun80, author = {Gheorghe Paun}, title = {Some Consequences of a Result of Ehrenfeucht and Rozenberg}, journal = {{RAIRO} Theor. Informatics Appl.}, volume = {14}, number = {1}, pages = {119--122}, year = {1980}, url = {https://doi.org/10.1051/ita/1980140101191}, doi = {10.1051/ITA/1980140101191}, timestamp = {Mon, 25 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ita/Paun80.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ita/Prodinger80, author = {Helmut Prodinger}, title = {Topologies on Free Monoids Induced by Closure Operators of a Special Type}, journal = {{RAIRO} Theor. Informatics Appl.}, volume = {14}, number = {2}, pages = {225--237}, year = {1980}, url = {https://doi.org/10.1051/ita/1980140202251}, doi = {10.1051/ITA/1980140202251}, timestamp = {Mon, 25 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ita/Prodinger80.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ita/Remy80, author = {Jean{-}Luc R{\'{e}}my}, title = {Construction, {\'{E}}valuation et Am{\'{e}}lioration Syst{\'{e}}matiques de Structures de Donn{\'{e}}es}, journal = {{RAIRO} Theor. Informatics Appl.}, volume = {14}, number = {1}, pages = {83--118}, year = {1980}, url = {https://doi.org/10.1051/ita/1980140100831}, doi = {10.1051/ITA/1980140100831}, timestamp = {Mon, 25 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ita/Remy80.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ita/Salle80, author = {Patrick Sall{\'{e}}}, title = {Une G{\'{e}}n{\'{e}}ralisation de la Th{\'{e}}orie des Types en {\textbackslash}lambda-Calcul (Premi{\`{e}}re partie)}, journal = {{RAIRO} Theor. Informatics Appl.}, volume = {14}, number = {2}, pages = {143--167}, year = {1980}, url = {https://doi.org/10.1051/ita/1980140201431}, doi = {10.1051/ITA/1980140201431}, timestamp = {Mon, 25 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ita/Salle80.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ita/Salle80a, author = {Patrick Sall{\'{e}}}, title = {Une G{\'{e}}n{\'{e}}ralisation de la Th{\'{e}}orie des Types en lambda-Calcul {(II)}}, journal = {{RAIRO} Theor. Informatics Appl.}, volume = {14}, number = {3}, pages = {301--314}, year = {1980}, url = {https://doi.org/10.1051/ita/1980140303011}, doi = {10.1051/ITA/1980140303011}, timestamp = {Mon, 25 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ita/Salle80a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ita/Simovici80, author = {Dan A. Simovici}, title = {Computing of Graphs of Relations Using Generative Grammars}, journal = {{RAIRO} Theor. Informatics Appl.}, volume = {14}, number = {3}, pages = {279--299}, year = {1980}, url = {https://doi.org/10.1051/ita/1980140302791}, doi = {10.1051/ITA/1980140302791}, timestamp = {Mon, 25 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ita/Simovici80.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ita/Sommerhalder80, author = {Rudolph Sommerhalder}, title = {Classes of Languages Proof Against Regular Pumping}, journal = {{RAIRO} Theor. Informatics Appl.}, volume = {14}, number = {2}, pages = {169--180}, year = {1980}, url = {https://doi.org/10.1051/ita/1980140201691}, doi = {10.1051/ITA/1980140201691}, timestamp = {Mon, 25 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ita/Sommerhalder80.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ita/Tchuente80, author = {Maurice Tchuent{\'{e}}}, title = {Sure l'{\'{E}}mitation It{\'{e}}rative des Situations de Blocage dans un Syst{\`{e}}me}, journal = {{RAIRO} Theor. Informatics Appl.}, volume = {14}, number = {1}, pages = {57--66}, year = {1980}, url = {https://doi.org/10.1051/ita/1980140100571}, doi = {10.1051/ITA/1980140100571}, timestamp = {Wed, 25 Jan 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ita/Tchuente80.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ita/Viry80, author = {Guy Viry}, title = {Factorisation des Polynomes a Plusieurs Variables}, journal = {{RAIRO} Theor. Informatics Appl.}, volume = {14}, number = {2}, pages = {209--223}, year = {1980}, url = {https://doi.org/10.1051/ita/1980140202091}, doi = {10.1051/ITA/1980140202091}, timestamp = {Mon, 25 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ita/Viry80.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.