Search dblp for Publications

export results for "toc:db/journals/iandc/iandc269.bht:"

 download as .bib file

@article{DBLP:journals/iandc/AmanoT19,
  author       = {Kazuyuki Amano and
                  Shoma Tate},
  title        = {On {XOR} lemmas for the weight of polynomial threshold functions},
  journal      = {Inf. Comput.},
  volume       = {269},
  year         = {2019},
  url          = {https://doi.org/10.1016/j.ic.2019.104439},
  doi          = {10.1016/J.IC.2019.104439},
  timestamp    = {Wed, 11 Dec 2019 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iandc/AmanoT19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/iandc/BellCJ19,
  author       = {Paul C. Bell and
                  Shang Chen and
                  Lisa M. Jackson},
  title        = {Freeness properties of weighted and probabilistic automata over bounded
                  languages},
  journal      = {Inf. Comput.},
  volume       = {269},
  year         = {2019},
  url          = {https://doi.org/10.1016/j.ic.2019.104440},
  doi          = {10.1016/J.IC.2019.104440},
  timestamp    = {Sun, 02 Oct 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/iandc/BellCJ19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/iandc/BertrandHL19,
  author       = {Nathalie Bertrand and
                  Serge Haddad and
                  Engel Lefaucheux},
  title        = {A tale of two diagnoses in probabilistic systems},
  journal      = {Inf. Comput.},
  volume       = {269},
  year         = {2019},
  url          = {https://doi.org/10.1016/j.ic.2019.104441},
  doi          = {10.1016/J.IC.2019.104441},
  timestamp    = {Wed, 11 Dec 2019 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iandc/BertrandHL19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/iandc/Crespi-Reghizzi19,
  author       = {Stefano Crespi{-}Reghizzi and
                  Pierluigi {San Pietro}},
  title        = {Non-erasing Chomsky-Sch{\"{u}}tzenberger theorem with grammar-independent
                  alphabet},
  journal      = {Inf. Comput.},
  volume       = {269},
  year         = {2019},
  url          = {https://doi.org/10.1016/j.ic.2019.104442},
  doi          = {10.1016/J.IC.2019.104442},
  timestamp    = {Fri, 27 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iandc/Crespi-Reghizzi19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/iandc/CzarnetzkiK19,
  author       = {Silke Czarnetzki and
                  Andreas Krebs},
  title        = {A topological approach to non-uniform complexity},
  journal      = {Inf. Comput.},
  volume       = {269},
  year         = {2019},
  url          = {https://doi.org/10.1016/j.ic.2019.104443},
  doi          = {10.1016/J.IC.2019.104443},
  timestamp    = {Wed, 11 Dec 2019 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iandc/CzarnetzkiK19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/iandc/DediuMT19,
  author       = {Adrian{-}Horia Dediu and
                  Carlos Mart{\'{\i}}n{-}Vide and
                  Bianca Truthe},
  title        = {Special Issue: Selected papers of the 10th International Conference
                  on Language and Automata Theory and Applications, {LATA} 2016},
  journal      = {Inf. Comput.},
  volume       = {269},
  year         = {2019},
  url          = {https://doi.org/10.1016/j.ic.2019.104438},
  doi          = {10.1016/J.IC.2019.104438},
  timestamp    = {Sun, 02 Oct 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/iandc/DediuMT19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/iandc/FrataniV19,
  author       = {S{\'{e}}verine Fratani and
                  El Makki Voundy},
  title        = {Epsilon-reducible context-free languages and characterizations of
                  indexed languages},
  journal      = {Inf. Comput.},
  volume       = {269},
  year         = {2019},
  url          = {https://doi.org/10.1016/j.ic.2019.104444},
  doi          = {10.1016/J.IC.2019.104444},
  timestamp    = {Wed, 11 Dec 2019 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iandc/FrataniV19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/iandc/GotzeFD19,
  author       = {Doreen G{\"{o}}tze and
                  Zolt{\'{a}}n F{\"{u}}l{\"{o}}p and
                  Manfred Droste},
  title        = {A Kleene theorem for weighted tree automata over tree valuation monoids},
  journal      = {Inf. Comput.},
  volume       = {269},
  year         = {2019},
  url          = {https://doi.org/10.1016/j.ic.2019.104445},
  doi          = {10.1016/J.IC.2019.104445},
  timestamp    = {Wed, 11 Dec 2019 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iandc/GotzeFD19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/iandc/HerrmannVD19,
  author       = {Luisa Herrmann and
                  Heiko Vogler and
                  Manfred Droste},
  title        = {Weighted automata with storage},
  journal      = {Inf. Comput.},
  volume       = {269},
  year         = {2019},
  url          = {https://doi.org/10.1016/j.ic.2019.104447},
  doi          = {10.1016/J.IC.2019.104447},
  timestamp    = {Mon, 17 Aug 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/iandc/HerrmannVD19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/iandc/Jajcayova19,
  author       = {Tatiana Baginov{\'{a}} Jajcayov{\'{a}}},
  title        = {Sch{\"{u}}tzenberger automata for HNN-extensions of inverse monoids
                  and their use in algorithmic questions},
  journal      = {Inf. Comput.},
  volume       = {269},
  year         = {2019},
  url          = {https://doi.org/10.1016/j.ic.2019.104448},
  doi          = {10.1016/J.IC.2019.104448},
  timestamp    = {Wed, 11 Dec 2019 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iandc/Jajcayova19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/iandc/Kanazawa19,
  author       = {Makoto Kanazawa},
  title        = {Ogden's lemma, multiple context-free grammars, and the control language
                  hierarchy},
  journal      = {Inf. Comput.},
  volume       = {269},
  year         = {2019},
  url          = {https://doi.org/10.1016/j.ic.2019.104449},
  doi          = {10.1016/J.IC.2019.104449},
  timestamp    = {Wed, 11 Dec 2019 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iandc/Kanazawa19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/iandc/KreowskiL19,
  author       = {Hans{-}J{\"{o}}rg Kreowski and
                  Aaron Lye},
  title        = {Canonical mixed-polarity multi-target Toffoli circuits: Shift and
                  removal},
  journal      = {Inf. Comput.},
  volume       = {269},
  year         = {2019},
  url          = {https://doi.org/10.1016/j.ic.2019.104450},
  doi          = {10.1016/J.IC.2019.104450},
  timestamp    = {Sun, 02 Oct 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/iandc/KreowskiL19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/iandc/KupfermanS19,
  author       = {Orna Kupferman and
                  Sarai Sheinvald},
  title        = {Capacitated automata and systems},
  journal      = {Inf. Comput.},
  volume       = {269},
  year         = {2019},
  url          = {https://doi.org/10.1016/j.ic.2019.104451},
  doi          = {10.1016/J.IC.2019.104451},
  timestamp    = {Fri, 09 Apr 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/iandc/KupfermanS19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/iandc/MeerN19,
  author       = {Klaus Meer and
                  Ameen Naif},
  title        = {Periodic generalized automata over the reals},
  journal      = {Inf. Comput.},
  volume       = {269},
  year         = {2019},
  url          = {https://doi.org/10.1016/j.ic.2019.104452},
  doi          = {10.1016/J.IC.2019.104452},
  timestamp    = {Wed, 11 Dec 2019 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iandc/MeerN19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/iandc/NakamuraHW19,
  author       = {Atsuyoshi Nakamura and
                  David P. Helmbold and
                  Manfred K. Warmuth},
  title        = {Mistake bounds on the noise-free multi-armed bandit game},
  journal      = {Inf. Comput.},
  volume       = {269},
  year         = {2019},
  url          = {https://doi.org/10.1016/j.ic.2019.104453},
  doi          = {10.1016/J.IC.2019.104453},
  timestamp    = {Wed, 11 Dec 2019 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iandc/NakamuraHW19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/iandc/OsterholzerDH19,
  author       = {Johannes Osterholzer and
                  Toni Dietze and
                  Luisa Herrmann},
  title        = {Linear context-free tree languages and inverse homomorphisms},
  journal      = {Inf. Comput.},
  volume       = {269},
  year         = {2019},
  url          = {https://doi.org/10.1016/j.ic.2019.104454},
  doi          = {10.1016/J.IC.2019.104454},
  timestamp    = {Mon, 17 Aug 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/iandc/OsterholzerDH19.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.