PlanetMath:

PlanetMath

(more info)

Math for the people, by the people.

Encyclopedia | Requests | Forums | Docs | Wiki | Random | RSS

Login

Main Menu

sections Encyclopædia
Papers
Books
Expositions

meta Requests (235)
Orphanage
Unclass'd
Unproven (515)
Corrections (23)
Classification

talkback Polls
Forums
Feedback
Bug Reports

downloads Snapshots
PM Book

information News
Docs
Wiki
ChangeLog
TODO List
Legalese
About

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 category of automata owned by bci1 category of quantum automata owned by bci1 complement of an automaton owned by CWoo equivalent automata owned by CWoo equivalent grammars owned by CWoo formal grammar owned by CWoo juxtaposition of automata owned by CWoo Kleene star of an automaton owned by CWoo product of automata owned by CWoo quantum automata and quantum computation owned by bci1 semiautomaton owned by CWoo state machine owned by CWoo strong AI thesis owned by dankomed theory of formal languages owned by rspuzio
Show empty categories:
[ up \| top ]