1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.FL2014★ 1 cited
Unary Pushdown Automata and Straight-Line Programs
Dmitry Chistikov, Rupak Majumdar
We consider decision problems for deterministic pushdown automata over a unary alphabet (udpda, for short). Udpda are a simple computation model that accept exactly the unary regul…
cs.CC2010
Learning Read-Once Functions Using Subcube Identity Queries
Dmitry V. Chistikov, Andrey A. Voronenko
We consider the problem of exact identification for read-once functions over arbitrary Boolean bases. We introduce a new type of queries (subcube identity ones), discuss its connec…