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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1978-2015
01219782015

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
Verification of algorithms, programs and informatic systems has been proposed by Turing in 1940s. It has been extensively studied… (More)
Is this relevant?
2010
2010
FLATA is a toolset for the manipulation and the analysis of non-deterministic integer programs (also known as counter automata… (More)
Is this relevant?
2009
2009
A new class of languages of infinite words is introduced, called the max-regular languages, extending the class of ω-regular… (More)
Is this relevant?
2008
2008
We present a logic interpreted over integer arrays, which allows difference bound comparisons between array elements situated… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2006
2006
Visibly pushdown automata are special pushdown automata whose stack behavior is driven by the input symbols according to a… (More)
  • figure 1
Is this relevant?
2005
2005
This paper argues that flatness appears as a central notion in the verification of counter automata. A counter automaton is… (More)
  • figure 1
Is this relevant?
2005
2005
Combinatorial property testing deals with the following relaxation of decision problems: Given a fixed property and an input f… (More)
Is this relevant?
2004
2004
We prove that a group G has a word problem that is accepted by a deterministic counter automaton with a weak inverse property if… (More)
  • figure 1
  • figure 2
Is this relevant?
1999
1999
  • Hubert Comon, Yan Jurski Lsv
  • 1999
We consider nite automata equipped with nitely many registers (or counters). Each transition can be red only if the associated… (More)
Is this relevant?