Search dblp for Publications

• > Home > Search

@article{DBLP:journals/tcs/Ayala-RinconFOV18,
  author       = {Mauricio Ayala{-}Rinc{\'{o}}n and
                  Maribel Fern{\'{a}}ndez and
                  Ana Cristina Rocha Oliveira and
                  Daniel Lima Ventura},
  title        = {Nominal essential intersection types},
  journal      = {Theor. Comput. Sci.},
  volume       = {737},
  pages        = {62--80},
  year         = {2018},
  url          = {https://doi.org/10.1016/j.tcs.2018.05.008},
  doi          = {10.1016/J.TCS.2018.05.008},
  timestamp    = {Fri, 09 Apr 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/Ayala-RinconFOV18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/BadiaN18,
  author       = {Guillermo Badia and
                  Carles Noguera},
  title        = {Fra{\"{\i}}ss{\'{e}} classes of graded relational structures},
  journal      = {Theor. Comput. Sci.},
  volume       = {737},
  pages        = {81--90},
  year         = {2018},
  url          = {https://doi.org/10.1016/j.tcs.2018.05.010},
  doi          = {10.1016/J.TCS.2018.05.010},
  timestamp    = {Wed, 25 Sep 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/BadiaN18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/ChoffrutE18,
  author       = {Christian Choffrut and
                  Zolt{\'{a}}n {\'{E}}sik},
  title        = {Two equational theories of partial words},
  journal      = {Theor. Comput. Sci.},
  volume       = {737},
  pages        = {19--39},
  year         = {2018},
  url          = {https://doi.org/10.1016/j.tcs.2018.04.010},
  doi          = {10.1016/J.TCS.2018.04.010},
  timestamp    = {Tue, 12 Jun 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/ChoffrutE18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/DAgostinoL18,
  author       = {Giovanna D'Agostino and
                  Giacomo Lenzi},
  title        = {The \emph{{\(\mu\)}}-Calculus Alternation Depth Hierarchy is infinite
                  over finite planar graphs},
  journal      = {Theor. Comput. Sci.},
  volume       = {737},
  pages        = {40--61},
  year         = {2018},
  url          = {https://doi.org/10.1016/j.tcs.2018.04.009},
  doi          = {10.1016/J.TCS.2018.04.009},
  timestamp    = {Tue, 10 Jul 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/DAgostinoL18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/PolyvyanyySW18,
  author       = {Artem Polyvyanyy and
                  Jan S{\"{u}}rmeli and
                  Matthias Weidlich},
  title        = {Interleaving isotactics - An equivalence notion on behaviour abstractions},
  journal      = {Theor. Comput. Sci.},
  volume       = {737},
  pages        = {1--18},
  year         = {2018},
  url          = {https://doi.org/10.1016/j.tcs.2018.01.005},
  doi          = {10.1016/J.TCS.2018.01.005},
  timestamp    = {Fri, 26 May 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/PolyvyanyySW18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}