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

Просмотр по теме "pushdown automata"

Просмотр по теме "pushdown automata"

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

  • Exact Affine Counter Automata 
    Nakanishi Masaki; Khadiev Kamil Ravilevich; Prūsis Krišjānis; Vihrovs Jevgenijs; Yakaryılmaz Abuzer (2017)
    We introduce an affine generalization of counter automata, and analyze their ability as well as affine finite automata. Our contributions are as follows. We show that there is a language that can be recognized by exact ...
  • A TURING MACHINE IS JUST A FINITE AUTOMATON WITH TWO STACKS: A COMMENT ON TEACHING THEORY OF COMPUTATION 
    Kreinovich Vladik; Kosheleva Olga (2018)
    Traditionally, when we teach Theory of Computations we start with finite automata, we show that they are not sufficient, then we switch to pushdown automata (i.e., automata-with-stacks). Automata-with-stacks are also not ...

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

Просмотр

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