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

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
• APPROX-RANDOM
• 2013
• Corpus ID: 45320916
For positive integers n, d, consider the hypergrid [n] d with the coordinate-wise product partial ordering denoted by ≺. A…
2012
2012
We investigate the satisfiability problem for downward-XPath, the fragment of XPath that includes the child and descendant axes…
2011
2011
• André Seznec
• IEEE 17th International Symposium on High…
• 2011
• Corpus ID: 6667739
For the past 15 years, it has been shown that confidence estimation of branch prediction can be used for various usages such as…
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…
2002
2002
• FTRTFT
• 2002
• Corpus ID: 710894
We address the problem of verifying clique avoidance in the TTP protocol. TTP allows several stations embedded in a car to…
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…
1999
1999
• 1999
• Corpus ID: 14245380
We consider nite automata equipped with nitely many registers (or counters). Each transition can be red only if the associated…
1991
1991
• Theor. Comput. Sci.
• 1991
• Corpus ID: 5139881
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…
1973
1973
• L. Boasson
• J. Comput. Syst. Sci.
• 1973
• Corpus ID: 20245873