Skip to search formSkip to main content
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.
2018
2018
Freeze LTL is a temporal logic with registers that is suitable for specifying properties of data words. In this paper we study… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
2013
2013
For positive integers n, d, consider the hypergrid [n] d with the coordinate-wise product partial ordering denoted by ≺. A… Expand
2012
2012
We investigate the satisfiability problem for downward-XPath, the fragment of XPath that includes the child and descendant axes… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
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… Expand
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • figure 4
2010
2010
A one-counter automaton is a pushdown automaton over a singleton stack alphabet. We prove that the bisimilarity of processes… Expand
  • figure 1
Highly Cited
2005
Highly Cited
2005
This paper argues that flatness appears as a central notion in the verification of counter automata. A counter automaton is… Expand
  • figure 1
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… Expand
  • figure 1
  • figure 2
2002
2002
We address the problem of verifying clique avoidance in the TTP protocol. TTP allows several stations embedded in a car to… Expand
  • figure 1
  • figure 2
  • figure 6
  • figure 7
1991
1991
Abstract This paper investigates several properties of one-way alternating multicounter machines which operate in real time, and… Expand
1978
1978
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
  • figure 2