Finite State Automata Languages

] > Finite State Automata Languages

A string is accepted by a finite state automaton, if it can be consumed by a path from the start state to some accepting state
The language accepted by a finite state automata consists of the set of all the strings accepted by the finite state automaton

-b||- b||-
- |- -- |-|
- | a|||-- |
-|| O ----- - oO
--a--
--|| O - -a||- a||-
----b | - |- -- |-|
-||- | b|||-- |
O ----- - oO

{a b^{i} a b^{j} | i, j \geq 0} \cup {b a^{i} b a^{j} | i, j \geq 0}

||||||||----1------
|-|| |-----1-----| -|||||||
|||||| ||| |||
--||- oO ---1-|| O ---1-|| O --1--|- O

{1^{3 x + 4 y} | x, y \geq 0}