PlanetMath (more info)
 Math for the people, by the people. Sponsor PlanetMath
Encyclopedia | Requests | Forums | Docs | Wiki | Random | RSS  
Login
create new user
name:
pass:
forget your password?
Main Menu
sections
Encyclopædia
Papers
Books
Expositions

meta
Requests (236)
Orphanage
Unclass'd (1)
Unproven (540)
Corrections (48)
Classification

talkback
Polls
Forums
Feedback
Bug Reports

downloads
Snapshots
PM Book

information
News
Docs
Wiki
ChangeLog
TODO List
Copyright
About
Encyclopedia by subject

03D10 - Mathematical logic and foundations :: Computability and recursion theory :: Turing machines and related notions

  1. category of automata owned by bci1
  2. category of quantum automata owned by bci1
  3. combining URMs owned by CWoo
  4. constructing automata from regular languages owned by CWoo
  5. deterministic finite automaton owned by CWoo
  6. deterministic pushdown automaton owned by CWoo
  7. examples of unlimited register machines owned by CWoo
  8. Kleene's theorem owned by CWoo
  9. LL(k) owned by CWoo
  10. LR(k) owned by CWoo
  11. Markov algorithm owned by CWoo
  12. matrix characterizations of automata owned by CWoo
  13. non-deterministic finite automaton owned by mps
  14. non-deterministic pushdown automaton owned by Henry
  15. recursive function is URM-computable owned by CWoo
  16. reduced automaton owned by CWoo
  17. subset construction owned by CWoo
  18. Turing computable owned by rspuzio
  19. Turing machine owned by Henry
  20. unlimited register machine owned by CWoo
  21. URM computable owned by CWoo

Show empty categories:
[ up | top ]