You are currently offline. Some features of the site may not work correctly.

# 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… Expand
Wikipedia

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
• 31st Annual ACM/IEEE Symposium on Logic in…
• 2016
• Corpus ID: 16064043
We study the computational and descriptional complexity of the following transformation: Given a one-counter automaton (OCA… Expand
Is this relevant?
2012
2012
Condon and Lipton (FOCS 1989) showed that the class of languages having a space-bounded interactive proof system (IPS) is a… Expand
Is this relevant?
2010
2010
• CONCUR
• 2010
• Corpus ID: 17942185
A one-counter automaton is a pushdown automaton over a singleton stack alphabet. We prove that the bisimilarity of processes… Expand
Is this relevant?
2010
2010
• WING@ETAPS/IJCAR
• 2010
• Corpus ID: 28792425
FLATA is a toolset for the manipulation and the analysis of non-deterministic integer programs (also known as counter automata… Expand
Is this relevant?
2008
2008
• IJAC
• 2008
• Corpus ID: 9814644
We study finitely generated groups whose word problems are accepted by counter automata. We show that a group has word problem… Expand
Is this relevant?
Highly Cited
2005
Highly Cited
2005
• ATVA
• 2005
• Corpus ID: 12842720
This paper argues that flatness appears as a central notion in the verification of counter automata. A counter automaton is… Expand
Is this relevant?
2004
2004
• Theor. Comput. Sci.
• 2004
• Corpus ID: 9929427
We prove that a group G has a word problem that is accepted by a deterministic counter automaton with a weak inverse property if… Expand
Is this relevant?
2001
2001
• Int. J. Pattern Recognit. Artif. Intell.
• 2001
• Corpus ID: 539025
This paper investigates closure property of the classes of sets accepted by space-bounded two-dimensional alternating Turing… Expand
Is this relevant?
1993
1993
a) f1(x, y) = 5x + y ∀x, y ≥ 0 b) f2(x, y) = x− 2y ∀y ≥ 0, x ≥ 2y c) f3(x, y) = x · y ∀x, y ≥ 0 Here you may want to use… Expand
Is this relevant?
1978
1978
• SIAM J. Comput.
• 1978
• Corpus ID: 22795181
Correction of a string x into a language L is the problem of finding a string $y \in L$ to which x can be edited at least cost… Expand
Is this relevant?