PlanetMath:

(more info)

Math for the people, by the people.

donor list - find out how

Main Menu

Encyclopedia by subject

03D05 - Mathematical logic and foundations :: Computability and recursion theory :: Automata and formal grammars in connection with logical questions

$\epsilon$ -transition owned by CWoo artificial intelligence owned by aplant automatic presentation owned by mathcam automaton owned by CWoo Boolean operations on automata owned by CWoo category of automata owned by bci1 category of quantum automata owned by bci1 characteristic monoid owned by CWoo equivalent automata owned by CWoo equivalent grammars owned by CWoo equivalent machines owned by CWoo every $\epsilon$ -automaton is equivalent to an automaton owned by CWoo formal grammar owned by CWoo generalized sequential machine owned by CWoo juxtaposition of automata owned by CWoo Kleene star of an automaton owned by CWoo Mealy machine owned by CWoo Moore machine owned by CWoo product of automata owned by CWoo quantum automata and computation owned by bci1 rational transducer owned by CWoo semiautomaton owned by CWoo semiautomaton homomorphism owned by CWoo simplified automaton owned by CWoo state-output machine owned by CWoo strong AI thesis owned by dankomed subsemiautomaton owned by CWoo theory of formal languages owned by rspuzio
Show empty categories:
[ up \| top ]