Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/journals/ita/ita20.bht:"
download as .bib file
@article{DBLP:journals/ita/AalbersbergW86,
author = {IJsbrand Jan Aalbersberg and
Emo Welzl},
title = {Trace Languages Defined by Regular String Languages},
journal = {{RAIRO} Theor. Informatics Appl.},
volume = {20},
number = {2},
pages = {103--119},
year = {1986},
url = {https://doi.org/10.1051/ita/1986200201031},
doi = {10.1051/ITA/1986200201031},
timestamp = {Mon, 25 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ita/AalbersbergW86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/AfratiCPPP86,
author = {Foto N. Afrati and
Stavros S. Cosmadakis and
Christos H. Papadimitriou and
George Papageorgiou and
Nadia Papakostantinou},
title = {The Complexity of the Travelling Repairman Problem},
journal = {{RAIRO} Theor. Informatics Appl.},
volume = {20},
number = {1},
pages = {79--87},
year = {1986},
url = {https://doi.org/10.1051/ita/1986200100791},
doi = {10.1051/ITA/1986200100791},
timestamp = {Mon, 25 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ita/AfratiCPPP86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/Arques86,
author = {Didier Arqu{\`{e}}s},
title = {D{\'{e}}nombrements de Chemins Dans -Real \({}^{\mbox{2}}\) Soumis
{A} Contraintes},
journal = {{RAIRO} Theor. Informatics Appl.},
volume = {20},
number = {4},
pages = {473--482},
year = {1986},
url = {https://doi.org/10.1051/ita/1986200404731},
doi = {10.1051/ITA/1986200404731},
timestamp = {Mon, 25 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ita/Arques86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/Arsac86,
author = {Jacques J. Arsac},
title = {La Fonction D'ackermann: Un Nouveau Mode de D{\'{e}}r{\'{e}}cursivation},
journal = {{RAIRO} Theor. Informatics Appl.},
volume = {20},
number = {2},
pages = {149--156},
year = {1986},
url = {https://doi.org/10.1051/ita/1986200201491},
doi = {10.1051/ITA/1986200201491},
timestamp = {Mon, 25 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ita/Arsac86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/BoonyavatanaS86,
author = {R. Boonyavatana and
Giora Slutzki},
title = {Ogden's Lemma for Monterminal Bounded Languages},
journal = {{RAIRO} Theor. Informatics Appl.},
volume = {20},
number = {4},
pages = {457--471},
year = {1986},
url = {https://doi.org/10.1051/ita/1986200404571},
doi = {10.1051/ITA/1986200404571},
timestamp = {Mon, 25 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ita/BoonyavatanaS86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/BrzozowskiK86,
author = {Janusz A. Brzozowski and
Robert Knast},
title = {Graph Congruences and Pair Testing},
journal = {{RAIRO} Theor. Informatics Appl.},
volume = {20},
number = {2},
pages = {129--147},
year = {1986},
url = {https://doi.org/10.1051/ita/1986200201291},
doi = {10.1051/ITA/1986200201291},
timestamp = {Mon, 25 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ita/BrzozowskiK86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/Darondeau86,
author = {Philippe Darondeau},
title = {Une Critique de La Notion de Test de Processus Fond{\'{e}}e Sur
La Non S{\'{e}}parabilit{\'{e}} de Certaines Classes de
Langages},
journal = {{RAIRO} Theor. Informatics Appl.},
volume = {20},
number = {3},
pages = {291--317},
year = {1986},
url = {https://doi.org/10.1051/ita/1986200302911},
doi = {10.1051/ITA/1986200302911},
timestamp = {Mon, 25 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ita/Darondeau86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/DauchetT86,
author = {Max Dauchet and
Erick Timmerman},
title = {Continuous Monoids and Yields of Infinite Trees},
journal = {{RAIRO} Theor. Informatics Appl.},
volume = {20},
number = {3},
pages = {251--274},
year = {1986},
url = {https://doi.org/10.1051/ita/1986200302511},
doi = {10.1051/ITA/1986200302511},
timestamp = {Mon, 25 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ita/DauchetT86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/EhrenfeuchtHR86,
author = {Andrzej Ehrenfeucht and
Hendrik Jan Hoogeboom and
Grzegorz Rozenberg},
title = {Coordinated Pair Systems; Part {I:} Dyck Works and Classical Pumping},
journal = {{RAIRO} Theor. Informatics Appl.},
volume = {20},
number = {4},
pages = {405--424},
year = {1986},
url = {https://doi.org/10.1051/ita/1986200404051},
doi = {10.1051/ITA/1986200404051},
timestamp = {Mon, 25 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ita/EhrenfeuchtHR86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/EhrenfeuchtHR86a,
author = {Andrzej Ehrenfeucht and
Hendrik Jan Hoogeboom and
Grzegorz Rozenberg},
title = {Coordinated Pair Systems; Part {II:} Sparse Structure of Dyck Words
and Ogden's Lemma},
journal = {{RAIRO} Theor. Informatics Appl.},
volume = {20},
number = {4},
pages = {425--439},
year = {1986},
url = {https://doi.org/10.1051/ita/1986200404251},
doi = {10.1051/ITA/1986200404251},
timestamp = {Mon, 25 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ita/EhrenfeuchtHR86a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/EhrenfeuchtR86,
author = {Andrzej Ehrenfeucht and
Grzegorz Rozenberg},
title = {Each Regular Code Is Included in {A} Maximal Regular Code},
journal = {{RAIRO} Theor. Informatics Appl.},
volume = {20},
number = {1},
pages = {89--96},
year = {1986},
url = {https://doi.org/10.1051/ita/1986200100891},
doi = {10.1051/ITA/1986200100891},
timestamp = {Mon, 25 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ita/EhrenfeuchtR86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/Francon86,
author = {Jean Fran{\c{c}}on},
title = {Une Approche Quantitative de L'Exclusion Mutuelle},
journal = {{RAIRO} Theor. Informatics Appl.},
volume = {20},
number = {3},
pages = {275--289},
year = {1986},
url = {https://doi.org/10.1051/ita/1986200302751},
doi = {10.1051/ITA/1986200302751},
timestamp = {Mon, 25 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ita/Francon86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/GoralcikGK86,
author = {Pavel Goralcik and
A. Goralcikov{\'{a}} and
V{\'{a}}clav Koubek},
title = {How much Semigroup Structure is Needed to Encode Graphs?},
journal = {{RAIRO} Theor. Informatics Appl.},
volume = {20},
number = {2},
pages = {191--206},
year = {1986},
url = {https://doi.org/10.1051/ita/1986200201911},
doi = {10.1051/ITA/1986200201911},
timestamp = {Mon, 25 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ita/GoralcikGK86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/GreibachW86,
author = {Sheila A. Greibach and
Celia Wrathall},
title = {Single-Tape Reset Machines},
journal = {{RAIRO} Theor. Informatics Appl.},
volume = {20},
number = {1},
pages = {55--77},
year = {1986},
url = {https://doi.org/10.1051/ita/1986200100551},
doi = {10.1051/ITA/1986200100551},
timestamp = {Mon, 25 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ita/GreibachW86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/HarjuL86,
author = {Tero Harju and
Matti Linna},
title = {On the Periodicity of Morphisms on Free Monoids},
journal = {{RAIRO} Theor. Informatics Appl.},
volume = {20},
number = {1},
pages = {47--54},
year = {1986},
url = {https://doi.org/10.1051/ita/1986200100471},
doi = {10.1051/ITA/1986200100471},
timestamp = {Mon, 25 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ita/HarjuL86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/Head86,
author = {Tom Head},
title = {The Topological Structure of Adherences of Regular Languages},
journal = {{RAIRO} Theor. Informatics Appl.},
volume = {20},
number = {1},
pages = {31--41},
year = {1986},
url = {https://doi.org/10.1051/ita/1986200100311},
doi = {10.1051/ITA/1986200100311},
timestamp = {Mon, 25 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ita/Head86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/HebrardC86,
author = {Jean{-}Jacques H{\'{e}}brard and
Maxime Crochemore},
title = {Calcul de La Distance Par Les Sous-Mots},
journal = {{RAIRO} Theor. Informatics Appl.},
volume = {20},
number = {4},
pages = {441--456},
year = {1986},
url = {https://doi.org/10.1051/ita/1986200404411},
doi = {10.1051/ITA/1986200404411},
timestamp = {Mon, 25 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ita/HebrardC86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/Honkala86,
author = {Juha Honkala},
title = {A Decision Method for The Recognizability of Sets Defined by Number
Systems},
journal = {{RAIRO} Theor. Informatics Appl.},
volume = {20},
number = {4},
pages = {395--403},
year = {1986},
url = {https://doi.org/10.1051/ita/1986200403951},
doi = {10.1051/ITA/1986200403951},
timestamp = {Mon, 25 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ita/Honkala86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/JurgensenK86,
author = {Helmut J{\"{u}}rgensen and
M. Kunze},
title = {{\"{U}}ber die Implementierung Redundanzfreier Codes zur Datenverschl{\"{u}}sselung},
journal = {{RAIRO} Theor. Informatics Appl.},
volume = {20},
number = {1},
pages = {5--30},
year = {1986},
url = {https://doi.org/10.1051/ita/1986200100051},
doi = {10.1051/ITA/1986200100051},
timestamp = {Mon, 25 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ita/JurgensenK86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/Kortelainen86,
author = {Juha Kortelainen},
title = {Every Commutative Quasirational Language is Regular},
journal = {{RAIRO} Theor. Informatics Appl.},
volume = {20},
number = {3},
pages = {319--337},
year = {1986},
url = {https://doi.org/10.1051/ita/1986200303191},
doi = {10.1051/ITA/1986200303191},
timestamp = {Mon, 25 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ita/Kortelainen86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/Lieu86,
author = {Choun Tong Lieu},
title = {Point-Fixe Sur Un Ensemble Restreint},
journal = {{RAIRO} Theor. Informatics Appl.},
volume = {20},
number = {4},
pages = {383--394},
year = {1986},
url = {https://doi.org/10.1051/ita/1986200403831},
doi = {10.1051/ITA/1986200403831},
timestamp = {Mon, 25 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ita/Lieu86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/Metivier86,
author = {Yves M{\'{e}}tivier},
title = {Une Condition Suffisante de Reconnaissabilit{\'{e}} Dans un Mono{\"{\i}}de
Partiellement Commutatif},
journal = {{RAIRO} Theor. Informatics Appl.},
volume = {20},
number = {2},
pages = {121--127},
year = {1986},
url = {https://doi.org/10.1051/ita/1986200201211},
doi = {10.1051/ITA/1986200201211},
timestamp = {Mon, 25 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ita/Metivier86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/Pansiot86,
author = {Jean{-}Jacques Pansiot},
title = {Decidability of Periodicity for Infinite Words},
journal = {{RAIRO} Theor. Informatics Appl.},
volume = {20},
number = {1},
pages = {43--46},
year = {1986},
url = {https://doi.org/10.1051/ita/1986200100431},
doi = {10.1051/ITA/1986200100431},
timestamp = {Mon, 25 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ita/Pansiot86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/ProtasiT86,
author = {Marco Protasi and
Maurizio Talamo},
title = {A Parametric Analysis of the Largest Induced Tree Problem in Random
Graphs},
journal = {{RAIRO} Theor. Informatics Appl.},
volume = {20},
number = {3},
pages = {211--219},
year = {1986},
url = {https://doi.org/10.1051/ita/1986200302111},
doi = {10.1051/ITA/1986200302111},
timestamp = {Mon, 25 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ita/ProtasiT86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/Rozoy86,
author = {Brigitte Rozoy},
title = {Outils et R{\'{e}}sultats Pour Les Transducteurs Boustrophedons},
journal = {{RAIRO} Theor. Informatics Appl.},
volume = {20},
number = {3},
pages = {221--249},
year = {1986},
url = {https://doi.org/10.1051/ita/1986200302211},
doi = {10.1051/ITA/1986200302211},
timestamp = {Mon, 25 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ita/Rozoy86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/Seebold86,
author = {Patrice S{\'{e}}{\'{e}}bold},
title = {Compl{\'{e}}ment {A} L'{\'{e}}tude des Suites de Thue-Morse
G{\'{e}}n{\'{e}}ralis{\'{e}}es},
journal = {{RAIRO} Theor. Informatics Appl.},
volume = {20},
number = {2},
pages = {157--181},
year = {1986},
url = {https://doi.org/10.1051/ita/1986200201571},
doi = {10.1051/ITA/1986200201571},
timestamp = {Mon, 25 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ita/Seebold86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/Staiger86,
author = {Ludwig Staiger},
title = {On Infinitary Finite Length Codes},
journal = {{RAIRO} Theor. Informatics Appl.},
volume = {20},
number = {4},
pages = {483--494},
year = {1986},
url = {https://doi.org/10.1051/ita/1986200404831},
doi = {10.1051/ITA/1986200404831},
timestamp = {Mon, 25 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ita/Staiger86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/Thomas86,
author = {Wolfgang Thomas},
title = {On Frontiers of Regular Trees},
journal = {{RAIRO} Theor. Informatics Appl.},
volume = {20},
number = {4},
pages = {371--381},
year = {1986},
url = {https://doi.org/10.1051/ita/1986200403711},
doi = {10.1051/ITA/1986200403711},
timestamp = {Mon, 25 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ita/Thomas86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/Walter86,
author = {Hermann K.{-}G. Walter},
title = {A Simple Proof of Valiant's Lemma},
journal = {{RAIRO} Theor. Informatics Appl.},
volume = {20},
number = {2},
pages = {183--190},
year = {1986},
url = {https://doi.org/10.1051/ita/1986200201831},
doi = {10.1051/ITA/1986200201831},
timestamp = {Mon, 25 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ita/Walter86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/Weiss86,
author = {Alex Weiss},
title = {The Local And Global Varieties Induced by Nilpotent Monoids},
journal = {{RAIRO} Theor. Informatics Appl.},
volume = {20},
number = {3},
pages = {339--355},
year = {1986},
url = {https://doi.org/10.1051/ita/1986200303391},
doi = {10.1051/ITA/1986200303391},
timestamp = {Mon, 25 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ita/Weiss86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/WeissT86,
author = {Alex Weiss and
Denis Th{\'{e}}rien},
title = {Varieties of Finite Categories},
journal = {{RAIRO} Theor. Informatics Appl.},
volume = {20},
number = {3},
pages = {357--366},
year = {1986},
url = {https://doi.org/10.1051/ita/1986200303571},
doi = {10.1051/ITA/1986200303571},
timestamp = {Mon, 25 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ita/WeissT86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
retrieved on 2024-05-05 10:20 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
