Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,031,210 papers from all fields of science
Search
Sign In
Create Free Account
Automaton
Known as:
Automata
, Autómata
, Atonamaton
Expand
An automaton (pronunciation: /ɔːˈtɒmətən/)(plural: automata or automatons) is a self-operating machine, or a machine or control mechanism designed to…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
49 relations
Alternating finite automaton
Amazon Mechanical Turk
Analog computer
Android (robot)
Expand
Broader (1)
Robotics
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2005
Highly Cited
2005
Self-Similar Groups
V. Nekrashevych
2005
Corpus ID: 117735841
Basic definitions and examples Algebraic theory Limit spaces Orbispaces Iterated monodromy groups Examples and applications…
Expand
Highly Cited
2005
Highly Cited
2005
Label-guided graph exploration by a finite automaton
Reuven Cohen
,
P. Fraigniaud
,
D. Ilcinkas
,
Amos Korman
,
D. Peleg
TALG
2005
Corpus ID: 9898471
A finite automaton, simply referred to as a robot, has to explore a graph, that is, visit all the nodes of the graph. The robot…
Expand
Highly Cited
2003
Highly Cited
2003
Taming heterogeneity - the Ptolemy approach
J. Eker
,
Jörn W. Janneck
,
+6 authors
Yuhong Xiong
Proceedings of the IEEE
2003
Corpus ID: 10851913
Modern embedded computing systems tend to be heterogeneous in the sense of being composed of subsystems with very different…
Expand
Review
2002
Review
2002
Automata logics, and infinite games: a guide to current research
E. Grädel
,
W. Thomas
,
T. Wilke
2002
Corpus ID: 56755592
A central aim and ever-lasting dream of computer science is to put the development of hardware and software systems on a…
Expand
Highly Cited
2002
Highly Cited
2002
On a Torsion-Free Weakly Branch Group Defined by a Three State Automaton
R. Grigorchuk
,
A. Zuk
International journal of algebra and computation
2002
Corpus ID: 31066392
We study a torsion free weakly branch group G without free subgroups defined by a three state automaton which appears in…
Expand
Highly Cited
2001
Highly Cited
2001
A fast automaton-based method for detecting anomalous program behaviors
R. Sekar
,
M. Bendre
,
Dinakar Dhurjati
,
P. Bollineni
Proceedings IEEE Symposium on Security and…
2001
Corpus ID: 15352648
Anomaly detection on system call sequences has become perhaps the most successful approach for detecting novel intrusions. A…
Expand
Highly Cited
1996
Highly Cited
1996
Does a rock implement every finite-state automaton?
D. Chalmers
Synthese
1996
Corpus ID: 17751467
Hilary Putnam has argued that computational functionalism cannot serve as a foundation for the study of the mind, as every…
Expand
Highly Cited
1991
Highly Cited
1991
An automaton for fractal patterns of fragmentation
S. Steacy
,
C. Sammis
Nature
1991
Corpus ID: 4353972
FRACTURES in the Earth's crust have a fractal structure over a wide range of length scales. A micromechanical model has been…
Expand
Review
1978
Review
1978
Automata-Theoretic Aspects of Formal Power Series
A. Salomaa
,
Matti Soittola
Texts and Monographs in Computer Science
1978
Corpus ID: 2935720
675 clarity of the exposition and the precision, which leaves no room for uncertainty. The style has sometimes been characterized…
Expand
Highly Cited
1971
Highly Cited
1971
An n log n algorithm for minimizing states in a finite automaton
J. Hopcroft
1971
Corpus ID: 62407163
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