Counter automaton

In computer science, a counter automaton is a pushdown automaton with only two symbols, and the initial symbol in , the finite set of stack symbols…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2016

One-counter nets (OCN) are finite automata equipped with a counter that can store non-negative integer values, and that cannot be…

2015

We prove new decidability and undecidability results concerning the finite-ambiguity problem in acceptors, and the finite…

2015

We consider the LTL synthesis problem for one-counter automata with integer-valued parameters, where counter values range over…

2013

Alon et al. (SICOMP 2001) showed that all regular languages are testable with a constant number of queries. On the other hand…

2011

A biologically motivated computational model of wirelessly communicating self-reproducing mobile embodied automata…

2003

We identify a necessary condition for when a given BPP process can be expressed as a BPA process. We provide an effective…

2002

The chapter studies relations between billiard ball model, reversible cellular automata, conservative and reversible logics and…

2001

This paper investigates closure property of the classes of sets accepted by space-bounded two-dimensional alternating Turing…

1999

We consider nite automata equipped with nitely many registers (or counters). Each transition can be red only if the associated…

1985