Automata - State

Card Puncher Data Processing

About

The state page in automata.

Syntax

Set

Q is the symbol for the set of states

Start

q is the symbol for the start state.

State after a serie of transitions

The state that the automaton <math>A</math> is in after processing input <math>w</math> is expressed by the below expression: <MATH>\delta(A,w)</MATH>

where: <math>\delta</math> is a symbol for a transition function

Property

in one of this state, the automaton will operate:

  • final
  • accepting

Entering one of these states after a sequence of inputs indicates that the input sequence is good in some way

It is conventional to designate accepting states by a double circle





Discover More
Word Recognition Automaton
Automata - Finite Automata

A finite automaton is an automaton that has a set of states and its control moves from state to state in response to external inputs. It has a start and an end state and there are only a finite number...



Share this page:
Follow us:
Task Runner