User:Code monk 9999/Books/Automata
 | The Wikimedia Foundation's book rendering service has been withdrawn. Please upload your Wikipedia book to one of the external rendering services. |
 | You can still create and edit a book design using the Book Creator and upload it to an external rendering service:
|
| This user book is a user-generated collection of Wikipedia articles that can be easily saved, rendered electronically, and ordered as a printed book. If you are the creator of this book and need help, see Help:Books (general tips) and WikiProject Wikipedia-Books (questions and assistance). Edit this book: Book Creator · Wikitext Order a printed copy from: PediaPress [ About ] [ Advanced ] [ FAQ ] [ Feedback ] [ Help ] [ WikiProject ] [ Recent Changes ] | ||||||||
Automata
Turing et al
- Topological Abstractions
- Foundations of mathematics
- Classical logic
- Intuitionistic logic
- General set theory
- Paradoxes of set theory
- Naive set theory
- Constructive set theory
- Constructive proof
- Constructivism (mathematics)
- Countable set
- Power set
- Cardinal number
- Cartesian product
- Associative property
- Class (set theory)
- Complement (set theory)
- Union (set theory)
- Zermelo set theory
- Zermelo–Fraenkel set theory
- Fuzzy set
- Group (mathematics)
- Center (group theory)
- Group homomorphism
- Bijection
- Category theory
- Hilbert space
- Abelian group
- Abstract algebra
- Algebraic structure
- Algebraic semantics (mathematical logic)
- Heyting algebra
- Boolean algebra
- Boolean function
- Boolean satisfiability problem
- Closure (mathematics)
- Function composition
- Turing
- Information theory
- Computability theory
- Imperative programming
- Model of computation
- Computability
- Computable function
- Axiomatic system
- Axiom schema of replacement
- Axiom schema of specification
- Axiom of choice
- Computational complexity theory
- Complexity class
- NP (complexity)
- RL (complexity)
- RP (complexity)
- BPP (complexity)
- EXPTIME
- BPL (complexity)
- Burali-Forti paradox
- Brouwer–Hilbert controversy
- Entscheidungsproblem
- Automata theory
- Church–Turing thesis
- Turing machine
- Universal Turing machine
- Automaton
- Ω-automaton
- Deterministic automaton
- Deterministic finite automaton
- Deterministic pushdown automaton
- Cellular automaton
- Formal language
- Alphabet (formal languages)
- Context-free language
- Deterministic context-free language
- Context-sensitive language
- Recursively enumerable language
- Black box
- Branch (computer science)
- Alternating Turing machine
- Büchi automaton
- Binary operation
- Circuit minimization for Boolean functions
- Endomorphism
- Antinomy
- Consistency
- Four color theorem
- Byzantine fault tolerance
- Cumulative hierarchy
- Effective method
- Discrete uniform distribution
- Curry–Howard correspondence
- Automorphism
- Double negation
- Disjunction and existence properties
- Erasure code
- Finite-state machine
- Halting problem
- Access structure
- Hyperplane
- Identity element
- Identity function
- Infimum and supremum
- Infinite tree automaton
- Alternating finite automaton
- Inhabited set
- Inner automorphism
- Instruction set
- Interactive proof system
- Intersection (set theory)
- Inverse element
- Isomorphism
- Kernel (algebra)
- Kleene star
- Kripke semantics
- Lambda calculus
- Large cardinal
- Law of excluded middle
- Linear bounded automaton
- Linear map
- Logical equivalence
- Mathematical logic
- Mathematical object
- Morphism
- Multitape Turing machine
- LH (complexity)
- Muller automaton
- Multi-track Turing machine
- Abstract machine
- ZPP (complexity)
- NL (complexity)
- P (complexity)
- PSPACE
- Turing completeness
- Non-deterministic Turing machine
- Nondeterministic finite automaton
- Polynomial hierarchy
- Omega language
- Omega-regular language
- One instruction set computer
- Operation (mathematics)
- Ordinal number
- Orthogonal array
- Parallel (geometry)
- Partial function
- Powerset construction
- Proactive secret sharing
- Probabilistic Turing machine
- Propositional formula
- Pushdown automaton
- Quantum finite automata
- Coprime integers
- Quantum state
- Quantum Turing machine
- Randomized algorithm
- Read-only right moving Turing machines
- Read-only Turing machine
- Real number
- Recursion (computer science)
- Recursive language
- Recursively enumerable set
- Regular expression
- Regular language
- Rice's theorem
- Ring (mathematics)
- Ring homomorphism
- Russell's paradox
- Secret sharing
- Secret sharing using the Chinese remainder theorem
- Secure multi-party computation
- Chinese remainder theorem
- Semiautomaton
- Set (mathematics)
- Set theory
- Shamir's Secret Sharing
- State (computer science)
- State diagram
- State machine replication
- State transition table
- Stochastic
- Stochastic matrix
- Stored-program computer
- Successor ordinal
- Symmetric difference
- Symmetric group
- Symmetry
- Symmetry group
- The Principles of Mathematics
- Theorem
- Theory of justification
- Thompson's construction
- Tontine
- Transfinite induction
- Transition system
- Tree automaton
- True quantified Boolean formula
- Truth value
- Tuple
- Turing machine equivalents
- Turing machine examples
- Unambiguous Turing machine
- Unary operation
- Uncountable set
- Undecidable problem
- Unitary matrix
- Unrestricted grammar
- UP (complexity)
- Vanish (computer science)
- Vector space
- Verifiable secret sharing
- Visual cryptography
- Von Neumann architecture
- Von Neumann universe
- Von Neumann–Bernays–Gödel set theory
- Wireless sensor network
- Permutation
- Information-theoretic security
- All-or-nothing transform
- Homomorphic secret sharing