Search dblp for Publications

export results for "toc:db/journals/ita/ita38.bht:"

 download as .bib file

@article{DBLP:journals/ita/Abel04,
  author       = {Andreas Abel},
  title        = {Termination checking with types},
  journal      = {{RAIRO} Theor. Informatics Appl.},
  volume       = {38},
  number       = {4},
  pages        = {277--319},
  year         = {2004},
  url          = {https://doi.org/10.1051/ita:2004015},
  doi          = {10.1051/ITA:2004015},
  timestamp    = {Mon, 25 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ita/Abel04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/BloomE04,
  author       = {Stephen L. Bloom and
                  Zolt{\'{a}}n {\'{E}}sik},
  title        = {Axiomatizing omega and omega-op powers of words},
  journal      = {{RAIRO} Theor. Informatics Appl.},
  volume       = {38},
  number       = {1},
  pages        = {3--17},
  year         = {2004},
  url          = {https://doi.org/10.1051/ita:2004005},
  doi          = {10.1051/ITA:2004005},
  timestamp    = {Mon, 25 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ita/BloomE04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/BonizzoniFMZ04,
  author       = {Paola Bonizzoni and
                  Clelia de Felice and
                  Giancarlo Mauri and
                  Rosalba Zizza},
  title        = {Circular splicing and regularity},
  journal      = {{RAIRO} Theor. Informatics Appl.},
  volume       = {38},
  number       = {3},
  pages        = {189--228},
  year         = {2004},
  url          = {https://doi.org/10.1051/ita:2004010},
  doi          = {10.1051/ITA:2004010},
  timestamp    = {Mon, 25 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ita/BonizzoniFMZ04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/BrandtDW04,
  author       = {Ulrike Brandt and
                  Ghislain Delepine and
                  Hermann K.{-}G. Walter},
  title        = {Weightreducing grammars and ultralinear languages},
  journal      = {{RAIRO} Theor. Informatics Appl.},
  volume       = {38},
  number       = {1},
  pages        = {19--25},
  year         = {2004},
  url          = {https://doi.org/10.1051/ita:2004001},
  doi          = {10.1051/ITA:2004001},
  timestamp    = {Mon, 25 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ita/BrandtDW04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/DassowMPS04,
  author       = {J{\"{u}}rgen Dassow and
                  Victor Mitrana and
                  Gheorghe Paun and
                  Ralf Stiebe},
  title        = {On differentiation functions, structure functions, and related languages
                  of context-free grammars},
  journal      = {{RAIRO} Theor. Informatics Appl.},
  volume       = {38},
  number       = {3},
  pages        = {257--267},
  year         = {2004},
  url          = {https://doi.org/10.1051/ita:2004013},
  doi          = {10.1051/ITA:2004013},
  timestamp    = {Mon, 25 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ita/DassowMPS04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/DorkenooER04,
  author       = {Marius Dorkenoo and
                  Marie{-}Christine Eglin{-}Leclerc and
                  Eric R{\'{e}}mila},
  title        = {Algebraic tools for the construction of colored flows with boundary
                  constraints},
  journal      = {{RAIRO} Theor. Informatics Appl.},
  volume       = {38},
  number       = {3},
  pages        = {229--243},
  year         = {2004},
  url          = {https://doi.org/10.1051/ita:2004011},
  doi          = {10.1051/ITA:2004011},
  timestamp    = {Mon, 25 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ita/DorkenooER04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/EsikWE04,
  author       = {Zolt{\'{a}}n {\'{E}}sik and
                  Igor Walukiewicz},
  title        = {Foreword},
  journal      = {{RAIRO} Theor. Informatics Appl.},
  volume       = {38},
  number       = {4},
  pages        = {275--276},
  year         = {2004},
  url          = {https://doi.org/10.1051/ita:2004019},
  doi          = {10.1051/ITA:2004019},
  timestamp    = {Mon, 25 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ita/EsikWE04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/Forys04,
  author       = {Wit Forys},
  title        = {Asymptotic behaviour of bi-infinite words},
  journal      = {{RAIRO} Theor. Informatics Appl.},
  volume       = {38},
  number       = {1},
  pages        = {27--48},
  year         = {2004},
  url          = {https://doi.org/10.1051/ita:2004002},
  doi          = {10.1051/ITA:2004002},
  timestamp    = {Mon, 25 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ita/Forys04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/FrougnyMP04,
  author       = {Christiane Frougny and
                  Zuzana Mas{\'{a}}kov{\'{a}} and
                  Edita Pelantov{\'{a}}},
  title        = {Complexity of infinite words associated with beta-expansions},
  journal      = {{RAIRO} Theor. Informatics Appl.},
  volume       = {38},
  number       = {2},
  pages        = {163--185},
  year         = {2004},
  url          = {https://doi.org/10.1051/ita:2004009},
  doi          = {10.1051/ITA:2004009},
  timestamp    = {Mon, 25 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ita/FrougnyMP04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/FrougnyMP04a,
  author       = {Christiane Frougny and
                  Zuzana Mas{\'{a}}kov{\'{a}} and
                  Edita Pelantov{\'{a}}},
  title        = {Erratum: Corrigendum: Complexity of infinite words associated with
                  beta-expansions},
  journal      = {{RAIRO} Theor. Informatics Appl.},
  volume       = {38},
  number       = {3},
  pages        = {269--271},
  year         = {2004},
  url          = {https://doi.org/10.1051/ita:2004014},
  doi          = {10.1051/ITA:2004014},
  timestamp    = {Mon, 25 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ita/FrougnyMP04a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/GhaniU04,
  author       = {Neil Ghani and
                  Tarmo Uustalu},
  title        = {Coproducts of Ideal Monads},
  journal      = {{RAIRO} Theor. Informatics Appl.},
  volume       = {38},
  number       = {4},
  pages        = {321--342},
  year         = {2004},
  url          = {https://doi.org/10.1051/ita:2004016},
  doi          = {10.1051/ITA:2004016},
  timestamp    = {Mon, 25 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ita/GhaniU04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/GroheS04,
  author       = {Martin Grohe and
                  Nicole Schweikardt},
  title        = {Comparing the succinctness of monadic query languages over finite
                  trees},
  journal      = {{RAIRO} Theor. Informatics Appl.},
  volume       = {38},
  number       = {4},
  pages        = {343--373},
  year         = {2004},
  url          = {https://doi.org/10.1051/ita:2004017},
  doi          = {10.1051/ITA:2004017},
  timestamp    = {Mon, 25 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ita/GroheS04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/Kralovic04,
  author       = {Richard Kr{\'{a}}lovic},
  title        = {Time and space complexity of reversible pebbling},
  journal      = {{RAIRO} Theor. Informatics Appl.},
  volume       = {38},
  number       = {2},
  pages        = {137--161},
  year         = {2004},
  url          = {https://doi.org/10.1051/ita:2004008},
  doi          = {10.1051/ITA:2004008},
  timestamp    = {Mon, 25 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ita/Kralovic04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/Lam04,
  author       = {Nguyen Huong Lam},
  title        = {Finite Completion of comma-free codes. Part 1},
  journal      = {{RAIRO} Theor. Informatics Appl.},
  volume       = {38},
  number       = {2},
  pages        = {91--115},
  year         = {2004},
  url          = {https://doi.org/10.1051/ita:2004006},
  doi          = {10.1051/ITA:2004006},
  timestamp    = {Mon, 25 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ita/Lam04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/Lam04a,
  author       = {Nguyen Huong Lam},
  title        = {Finite Completion of comma-free codes. Part 2},
  journal      = {{RAIRO} Theor. Informatics Appl.},
  volume       = {38},
  number       = {2},
  pages        = {117--136},
  year         = {2004},
  url          = {https://doi.org/10.1051/ita:2004007},
  doi          = {10.1051/ITA:2004007},
  timestamp    = {Mon, 25 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ita/Lam04a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/MoggiS04,
  author       = {Eugenio Moggi and
                  Amr Sabry},
  title        = {An abstract monadic semantics for value recursion},
  journal      = {{RAIRO} Theor. Informatics Appl.},
  volume       = {38},
  number       = {4},
  pages        = {375--400},
  year         = {2004},
  url          = {https://doi.org/10.1051/ita:2004018},
  doi          = {10.1051/ITA:2004018},
  timestamp    = {Sat, 05 Sep 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ita/MoggiS04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/Okhotin04,
  author       = {Alexander Okhotin},
  title        = {On the equivalence of linear conjunctive grammars and trellis automata},
  journal      = {{RAIRO} Theor. Informatics Appl.},
  volume       = {38},
  number       = {1},
  pages        = {69--88},
  year         = {2004},
  url          = {https://doi.org/10.1051/ita:2004004},
  doi          = {10.1051/ITA:2004004},
  timestamp    = {Mon, 25 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ita/Okhotin04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/ParkesST04,
  author       = {Duncan W. Parkes and
                  V. Yu. Shavrukov and
                  Richard M. Thomas},
  title        = {Monoid presentations of groups by finite special string-rewriting
                  systems},
  journal      = {{RAIRO} Theor. Informatics Appl.},
  volume       = {38},
  number       = {3},
  pages        = {245--256},
  year         = {2004},
  url          = {https://doi.org/10.1051/ita:2004012},
  doi          = {10.1051/ITA:2004012},
  timestamp    = {Mon, 25 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ita/ParkesST04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/Silva04,
  author       = {Pedro V. Silva},
  title        = {Free group languages: Rational versus recognizable},
  journal      = {{RAIRO} Theor. Informatics Appl.},
  volume       = {38},
  number       = {1},
  pages        = {49--67},
  year         = {2004},
  url          = {https://doi.org/10.1051/ita:2004003},
  doi          = {10.1051/ITA:2004003},
  timestamp    = {Mon, 25 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ita/Silva04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics