Matches in DBpedia 2016-04 for { <http://books.google.com/books?vid=ISBN0-534-94728-X> ?p ?o }
Showing triples 1 to 93 of
93
with 100 triples per page.
- books?vid=ISBN0-534-94728-X at "Section 8.4: The Classes L and NL, pp. 294–296".
- books?vid=ISBN0-534-94728-X author Michael_Sipser.
- books?vid=ISBN0-534-94728-X author "Michael Sipser".
- books?vid=ISBN0-534-94728-X author "Sipser, M.".
- books?vid=ISBN0-534-94728-X authorLink "Michael Sipser".
- books?vid=ISBN0-534-94728-X authorlink "Michael Sipser".
- books?vid=ISBN0-534-94728-X authorlink1 "Michael Sipser".
- books?vid=ISBN0-534-94728-X chapter "1.4: Nonregular Languages".
- books?vid=ISBN0-534-94728-X chapter "Chapter 1: Regular Languages".
- books?vid=ISBN0-534-94728-X chapter "Decidability".
- books?vid=ISBN0-534-94728-X chapter "Section 10.6.3: One-way functions".
- books?vid=ISBN0-534-94728-X chapter "Section 4.2: The Halting Problem".
- books?vid=ISBN0-534-94728-X chapter "Sections 8.4–8.6: The Classes L and NL, NL-completeness, NL equals coNL".
- books?vid=ISBN0-534-94728-X contribution "Section 8.1: Savitch's Theorem".
- books?vid=ISBN0-534-94728-X contribution "Section 8.3: PSPACE-completeness".
- books?vid=ISBN0-534-94728-X contribution "Theorem 1.19".
- books?vid=ISBN0-534-94728-X date "1997".
- books?vid=ISBN0-534-94728-X edition "1.0".
- books?vid=ISBN0-534-94728-X edition "Second".
- books?vid=ISBN0-534-94728-X first "M.".
- books?vid=ISBN0-534-94728-X first "Michael".
- books?vid=ISBN0-534-94728-X first1 "Michael".
- books?vid=ISBN0-534-94728-X isCitedBy Algorithm.
- books?vid=ISBN0-534-94728-X isCitedBy Alternating_Turing_machine.
- books?vid=ISBN0-534-94728-X isCitedBy Automata_theory.
- books?vid=ISBN0-534-94728-X isCitedBy BPP_(complexity).
- books?vid=ISBN0-534-94728-X isCitedBy Big_O_notation.
- books?vid=ISBN0-534-94728-X isCitedBy CYK_algorithm.
- books?vid=ISBN0-534-94728-X isCitedBy Chomsky_normal_form.
- books?vid=ISBN0-534-94728-X isCitedBy Clique_problem.
- books?vid=ISBN0-534-94728-X isCitedBy Computability.
- books?vid=ISBN0-534-94728-X isCitedBy Context-free_grammar.
- books?vid=ISBN0-534-94728-X isCitedBy Context-free_language.
- books?vid=ISBN0-534-94728-X isCitedBy Deterministic_finite_automaton.
- books?vid=ISBN0-534-94728-X isCitedBy Deterministic_pushdown_automaton.
- books?vid=ISBN0-534-94728-X isCitedBy EXPSPACE.
- books?vid=ISBN0-534-94728-X isCitedBy Halting_problem.
- books?vid=ISBN0-534-94728-X isCitedBy Interactive_proof_system.
- books?vid=ISBN0-534-94728-X isCitedBy L_(complexity).
- books?vid=ISBN0-534-94728-X isCitedBy NL_(complexity).
- books?vid=ISBN0-534-94728-X isCitedBy NP-completeness.
- books?vid=ISBN0-534-94728-X isCitedBy NP_(complexity).
- books?vid=ISBN0-534-94728-X isCitedBy Negligible_function.
- books?vid=ISBN0-534-94728-X isCitedBy Noam_Chomsky.
- books?vid=ISBN0-534-94728-X isCitedBy One-way_function.
- books?vid=ISBN0-534-94728-X isCitedBy PSPACE.
- books?vid=ISBN0-534-94728-X isCitedBy PSPACE-complete.
- books?vid=ISBN0-534-94728-X isCitedBy Philosophy_of_mind.
- books?vid=ISBN0-534-94728-X isCitedBy Powerset_construction.
- books?vid=ISBN0-534-94728-X isCitedBy Programming_language.
- books?vid=ISBN0-534-94728-X isCitedBy Pumping_lemma_for_context-free_languages.
- books?vid=ISBN0-534-94728-X isCitedBy Pumping_lemma_for_regular_languages.
- books?vid=ISBN0-534-94728-X isCitedBy Pushdown_automaton.
- books?vid=ISBN0-534-94728-X isCitedBy Recursive_language.
- books?vid=ISBN0-534-94728-X isCitedBy Regular_expression.
- books?vid=ISBN0-534-94728-X isCitedBy Regular_language.
- books?vid=ISBN0-534-94728-X isCitedBy Savitchs_theorem.
- books?vid=ISBN0-534-94728-X isCitedBy Space_hierarchy_theorem.
- books?vid=ISBN0-534-94728-X isCitedBy Syntax_(programming_languages).
- books?vid=ISBN0-534-94728-X isCitedBy Time_hierarchy_theorem.
- books?vid=ISBN0-534-94728-X isCitedBy Turing_machine.
- books?vid=ISBN0-534-94728-X isbn "0-534-94728-X".
- books?vid=ISBN0-534-94728-X last "Sipser".
- books?vid=ISBN0-534-94728-X last1 "Sipser".
- books?vid=ISBN0-534-94728-X location "Boston".
- books?vid=ISBN0-534-94728-X location "Boston, Mass.".
- books?vid=ISBN0-534-94728-X nopp "true".
- books?vid=ISBN0-534-94728-X page "102".
- books?vid=ISBN0-534-94728-X page "99".
- books?vid=ISBN0-534-94728-X pages "151–170".
- books?vid=ISBN0-534-94728-X pages "173–182".
- books?vid=ISBN0-534-94728-X pages "279–281".
- books?vid=ISBN0-534-94728-X pages "283–294".
- books?vid=ISBN0-534-94728-X pages "294–302".
- books?vid=ISBN0-534-94728-X pages "31–90".
- books?vid=ISBN0-534-94728-X pages "374–376".
- books?vid=ISBN0-534-94728-X pages "55–56".
- books?vid=ISBN0-534-94728-X pages "77–83".
- books?vid=ISBN0-534-94728-X pages "Sections 7.4–7.5 , pp. 248–271".
- books?vid=ISBN0-534-94728-X publisher The_Thomson_Corporation.
- books?vid=ISBN0-534-94728-X publisher "IPS".
- books?vid=ISBN0-534-94728-X publisher "PWS Publishing Co.".
- books?vid=ISBN0-534-94728-X publisher "PWS Publishing Company".
- books?vid=ISBN0-534-94728-X publisher "PWS Publishing".
- books?vid=ISBN0-534-94728-X publisher "PWS".
- books?vid=ISBN0-534-94728-X ref "harv".
- books?vid=ISBN0-534-94728-X title Introduction_to_the_Theory_of_Computation.
- books?vid=ISBN0-534-94728-X title "Introduction to the Theory of Computation".
- books?vid=ISBN0-534-94728-X year "1996".
- books?vid=ISBN0-534-94728-X year "1997".
- books?vid=ISBN0-534-94728-X year "1998".
- books?vid=ISBN0-534-94728-X year "2006".
- books?vid=ISBN0-534-94728-X zbl "1169.68300".