Finite State Automata Automata Theory Theoretical Computer Science

Finite state automata (FSA) are devices that can be in one of a finite number of states, one of which is called the start state and one or more are called final states. Transitions are defined for each state when the FSA reads a symbol from an input language. If a word, or input string of symbols from the input language, is provided to the FSA and if it starts at a start state and arrives at a final state after reading the word, we say the word is accepted by the FSA. Languages of words accepted by FSA are called regular languages.

• Top/Computers/Computer Science/Theoretical/Formal Language Theory/Regular Languages

• Finite-State Automata and Regular Languages - Basic definitions and theorems connecting FSA and regular languages.
• Nondeterministic Finite Automata - Virginia Tech class notes with definitions, examples and theoretical exercises.[PDF]
• Deterministic Finite Automata - Virginia Tech course notes on FSA.[PDF]
• Nondeterministic Finite State Machines - A Wikipedia article on nondeterministic FSA.
• Finite State Automata - An introduction to deterministic and nondeterministic FSA, with theoretical simple examples.

   MySQL - Cache Direct