Электронный архив

Просмотр по автору "Yakaryılmaz A."

Просмотр по автору "Yakaryılmaz A."

Отсортировать по:Сортировать:Результаты поиска на странице:

  • Affine Automata Verifiers 
    Khadieva A.; Yakaryılmaz A. (2021)
    We initiate the study of the verification power of Affine finite automata (AfA) as a part of Arthur-Merlin (AM) proof systems. We show that every unary language is verified by a real-valued AfA verifier. Then, we focus on ...
  • New Size Hierarchies for Two Way Automata 
    Ibrahimov R.; Khadiev K.; Yakaryılmaz A. (2018)
    © 2018, Pleiades Publishing, Ltd. We introduce a new type of nonuniform two-way automaton that can use a different transition function for each tape square. We also enhance this model by allowing to shuffle the given input ...
  • Nondeterministic unitary OBDDs 
    Gainutdinova A.; Yakaryılmaz A. (2017)
    © Springer International Publishing AG 2017.We investigate the width complexity of nondeterministic uni-tary OBDDs (NUOBDDs). Firstly, we present a generic lower bound on their widths based on the size of strong 1-fooling ...
  • Unary probabilistic and quantum automata on promise problems 
    Gainutdinova A.; Yakaryılmaz A. (2015)
    © Springer International Publishing Switzerland 2015. We continue the systematic investigation of probabilistic and quantum finite automata (PFAs and QFAs) on promise problems by focusing on unary languages. We show that ...
  • Very narrow quantum OBDDs and width hierarchies for classical OBDDs 
    Ablayev F.; Gainutdinova A.; Khadiev K.; Yakaryılmaz A. (2016)
    © 2016, Pleiades Publishing, Ltd.In the paper we investigate Ordered Binary Decision Diagrams (OBDDs)–a model for computing Boolean functions. We present a series of results on the comparative complexity for several variants ...

Поиск в электронном архиве

Просмотр

Моя учетная запись