Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 225,894,280 papers from all fields of science
Search
Sign In
Create Free Account
Counter machine
A counter machine is an abstract machine used in formal logic and theoretical computer science to model computation. It is the most primitive of the…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
29 relations
Abstract machine
Algorithm characterizations
Andrey Ershov
Arthur Burks
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
On effective construction of the greatest solution of language inequality XA ⊆ BX
Olivier Ly
,
Zhilin Wu
Theoretical Computer Science
2014
Corpus ID: 1477673
2013
2013
Deterministic Counter Machines and Parallel Matching Computations
S. Crespi-Reghizzi
,
P. S. Pietro
International Conference on Implementation and…
2013
Corpus ID: 46452115
For the classical family of languages recognized by quasi-realtime deterministic multi-counter machines of the partially blind…
Expand
2011
2011
Formal Modeling and Analysis of Biological Regulatory Networks Using SPIN
Usman Rauf
,
U. Siddique
,
Jamil Ahmad
,
U. Niazi
IEEE International Conference on Bioinformatics…
2011
Corpus ID: 6605078
In the last two decades, formal verification has emerged as an important technique for the formal modeling and analysis of real…
Expand
2009
2009
Reachability for Continuous and Hybrid Systems
O. Maler
Reachability Problems
2009
Corpus ID: 12812147
In this talk I present some past, present and future work concerning reachability computation for continuous and hybrid systems.
2009
2009
FOUR BASIC LOGICAL ISSUES
R. Brady
,
Penelope Rush
The Review of Symbolic Logic
2009
Corpus ID: 23607761
The paper addresses what we see as the four major issues in logic. The overriding issue is that of the choice of logic. We start…
Expand
2007
2007
Automated Reasoning with Analytic Tableaux and Related Methods
Nicola Olivetti
2007
Corpus ID: 27641932
Invited Talks.- Nonmonotonic Description Logics - Requirements, Theory, and Implementations.- Our Quest for the Holy Grail of…
Expand
1997
1997
On the Foundations of Termination Analysis of Active Database Rules
J. Bailey
1997
Corpus ID: 59906959
Traditional database systems provide a mechanism for storing large amounts of data and an interface for querying and manipulating…
Expand
1981
1981
Reversal complexity of counter machines
T. Chan
Symposium on the Theory of Computing
1981
Corpus ID: 10149871
It has long been known that deterministic 1-way counter machines recognize exactly all r.e. sets. Here we investigate counter…
Expand
1981
1981
Interpretation of particle growth and aggregation patterns obtained from the Coulter counter: a simple theoretical model.
Ryall Rl
,
Ryall Rg
,
Marshall Vr
1981
Corpus ID: 234750474
We used a simple theoretical model to stimulate the changes in particle size distribution that occur when crystals grow, or…
Expand
1974
1974
Note on analogue memory automata
S. Tamura
,
Kokichi Tanaka
Information Sciences
1974
Corpus ID: 41534048
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE
or Only Accept Required