Skip to search formSkip to main contentSkip to account menu

Automaton

Known as: Automata, Autómata, Atonamaton 
An automaton (pronunciation: /ɔːˈtɒmətən/)(plural: automata or automatons) is a self-operating machine, or a machine or control mechanism designed to… 
Wikipedia (opens in a new tab)

Related topics

Related topics

49 relations
Alternating finite automatonAmazon Mechanical TurkAnalog computerAndroid (robot)

Broader (1)

Robotics

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2014
Highly Cited
2014
Learning Automata-based Opportunistic Data Aggregation and Forwarding scheme for alert generation in Vehicular Ad Hoc Networks
Highly Cited
2005
Highly Cited
2005
TAGH: A Complete Morphology for German Based on Weighted Finite State Automata
TAGH is a system for automatic recognition of German word forms. It is based on a stem lexicon with allomorphs and a… 
Highly Cited
2002
Highly Cited
2002
A formal model of computing with words
Classical automata are formal models of computing with values. Fuzzy automata are generalizations of classical automata where the… 
Highly Cited
1998
Highly Cited
1998
Cyclic linear differential automata: a simple class of hybrid dynamical systems
We introduce a new class of hybrid dynamical systems, called the hybrid systems cyclic linear differential automata (CLDA). Our… 
Highly Cited
1997
Highly Cited
1997
Joel Chadabe: Electric Sound: The Past and Promise of Electronic Music
Highly Cited
1996
Highly Cited
1996
Efficient algorithms for Lempel-Ziv encoding
We consider several basic problems for texts and show that if the input texts are given by their Lempel-Ziv codes then the… 
Highly Cited
1994
Highly Cited
1994
Decidability of Hybrid Systems with Rectangular Differential Inclusion
A hybrid system is modeled with a finite set of locations and a differential inclusion associated with each location. We discuss… 
Highly Cited
1990
Highly Cited
1990
Temporal hyperprogramming
Highly Cited
1988
Highly Cited
1988
On The Complexity of w-Automata
Automata on infinite words were introduced by Biichi in order to give a decision procedure for SlS, the monadic second-order… 
Highly Cited
1971
Highly Cited
1971
Array Automata and Array Grammars
Abstract : Finite automata having two-dimensional tapes are much less well-behaved than their one-dimensional counterparts. In… 
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)