Computer Science > Summary > Automata theory (All)

Automata theory

Document Content and Description Below

The term "Automata" is derived from the Greek word "αὐτόματα" which means "selfacting". An automaton (Automata in plural) is an abstract self-propelled computing device which follows a pre ... determined sequence of operations automatically. An automaton with a finite number of states is called a Finite Automaton (FA) or Finite State Machine (FSM). Formal definition of a Finite Automaton An automaton can be represented by a 5-tuple (Q, Σ, δ, q0, F), where:  Q is a finite set of states.  Σ is a finite set of symbols, called the alphabet of the automaton.  δ is the transition function.  q0 is the initial state from where any input is processed (q0 ∈ Q).  F is a set of final state/states of Q (F ⊆ Q). [Show More]

Last updated: 2 years ago

Preview 1 out of 2 pages

Buy Now

Instant download

We Accept: