272,718 research outputs found
Dense-choice Counter Machines revisited
This paper clarifies the picture about Dense-choice Counter Machines, which
have been less studied than (discrete) Counter Machines. We revisit the
definition of "Dense Counter Machines" so that it now extends (discrete)
Counter Machines, and we provide new undecidability and decidability results.
Using the first-order additive mixed theory of reals and integers, we give a
logical characterization of the sets of configurations reachable by
reversal-bounded Dense-choice Counter Machines
Bounded Counter Languages
We show that deterministic finite automata equipped with two-way heads
are equivalent to deterministic machines with a single two-way input head and
linearly bounded counters if the accepted language is strictly bounded,
i.e., a subset of for a fixed sequence of symbols . Then we investigate linear speed-up for counter machines. Lower
and upper time bounds for concrete recognition problems are shown, implying
that in general linear speed-up does not hold for counter machines. For bounded
languages we develop a technique for speeding up computations by any constant
factor at the expense of adding a fixed number of counters
One-count memory circuit prevents machine mode interaction
One-count memory logic circuit used with electromechanical counter-printer machines operates in either count or print mode. The circuit advances the counter when the machine is in the count mode and provides storage for the count pulse when the machine is in the print mode
Counter Machines and Distributed Automata: A Story about Exchanging Space and Time
We prove the equivalence of two classes of counter machines and one class of
distributed automata. Our counter machines operate on finite words, which they
read from left to right while incrementing or decrementing a fixed number of
counters. The two classes differ in the extra features they offer: one allows
to copy counter values, whereas the other allows to compute copyless sums of
counters. Our distributed automata, on the other hand, operate on directed path
graphs that represent words. All nodes of a path synchronously execute the same
finite-state machine, whose state diagram must be acyclic except for
self-loops, and each node receives as input the state of its direct
predecessor. These devices form a subclass of linear-time one-way cellular
automata.Comment: 15 pages (+ 13 pages of appendices), 5 figures; To appear in the
proceedings of AUTOMATA 2018
New results on classical and quantum counter automata
We show that one-way quantum one-counter automaton with zero-error is more
powerful than its probabilistic counterpart on promise problems. Then, we
obtain a similar separation result between Las Vegas one-way probabilistic
one-counter automaton and one-way deterministic one-counter automaton.
We also obtain new results on classical counter automata regarding language
recognition. It was conjectured that one-way probabilistic one blind-counter
automata cannot recognize Kleene closure of equality language [A. Yakaryilmaz:
Superiority of one-way and realtime quantum machines. RAIRO - Theor. Inf. and
Applic. 46(4): 615-641 (2012)]. We show that this conjecture is false, and also
show several separation results for blind/non-blind counter automata.Comment: 21 page
- …