Find link

language:

Find link is a tool written by Edward Betts.

searching for Introduction to Automata Theory, Languages, and Computation 39 found (90 total)

alternate case: introduction to Automata Theory, Languages, and Computation

Indexed language (695 words) [view diff] case mismatch in snippet view article find links to article

(1979). Introduction to automata theory, languages, and computation. Addison-Wesley. p. 390. ISBN 978-0-201-02988-8. Introduction to automata theory, languages

Context-sensitive language (1,340 words) [view diff] exact match in snippet view article find links to article

Hopcroft, John E.; Ullman, Jeffrey D. (1979). Introduction to Automata Theory, Languages, and Computation. Addison-Wesley J. Hartmanis and H. Shank (Jul

Discrete system (193 words) [view diff] exact match in snippet view article find links to article

; Rajeev Motwani; Jeffrey D. Ullman (2001). Introduction to Automata Theory, Languages, and Computation (2nd ed.). Reading Mass: Addison-Wesley. ISBN 0-201-44124-1

Chomsky normal form (1,926 words) [view diff] no match in snippet view article find links to article

Hopcroft, John E.; Ullman, Jeffrey D. (1979). Introduction to Automata Theory, Languages and Computation. Reading, Massachusetts: Addison-Wesley Publishing

Alternation (formal language theory) (285 words) [view diff] no match in snippet view article

ISBN 9780080916613. John E. Hopcroft and Jeffrey D. Ullman, Introduction to Automata Theory, Languages and Computation, Addison-Wesley Publishing, Reading Massachusetts

Regular grammar (988 words) [view diff] exact match in snippet view article find links to article

John E. Hopcroft and Jeffrey D. Ullman (1979). Introduction to Automata Theory, Languages, and Computation. Reading/MA: Addison-Wesley. ISBN 0-201-02988-X

Co-NP (964 words) [view diff] exact match in snippet view article find links to article

Zaragoza. 26: 57–68. Hopcroft, John E. (2000). Introduction to Automata Theory, Languages, and Computation (2nd ed.). Boston: Addison-Wesley. ISBN 0-201-44124-1

Nested stack automaton (748 words) [view diff] exact match in snippet view article find links to article

John E. Hopcroft, Jeffrey D. Ullman (1979). Introduction to Automata Theory, Languages, and Computation. Addison-Wesley. ISBN 0-201-02988-X. Here:p.390

Greibach's theorem (852 words) [view diff] exact match in snippet view article find links to article

John E. Hopcroft; Jeffrey D. Ullman (1979). Introduction to Automata Theory, Languages, and Computation. Addison-Wesley. ISBN 0-201-02988-X. p.205-206

Concatenation (1,007 words) [view diff] no match in snippet view article find links to article

Hopcroft, John E.; Ullman, Jeffrey D. (1979). Introduction to Automata Theory, Languages and Computation. Addison-Wesley. ISBN 0-201-02988-X. Corcoran

Unary numeral system (1,251 words) [view diff] exact match in snippet view article find links to article

Hopcroft, John E.; Ullman, Jeffrey D. (1979), Introduction to Automata Theory, Languages, and Computation, Addison Wesley, Example 7.7, pp. 158–159,

Union theorem (290 words) [view diff] exact match in snippet view article find links to article

Hopcroft, John E.; Ullman, Jeffrey D. (1979). Introduction to Automata Theory, Languages, and Computation (1st ed.). Addison-Wesley. ISBN 0-201-02988-X

Noncontracting grammar (736 words) [view diff] exact match in snippet view article find links to article

John E. Hopcroft, Jeffrey D. Ullman (1979). Introduction to Automata Theory, Languages, and Computation. Addison-Wesley. ISBN 0-201-02988-X. Exercise

P (complexity) (1,940 words) [view diff] case mismatch in snippet view article

; Rajeev Motwani; Jeffrey D. Ullman (2001). Introduction to automata theory, languages, and computation (2. ed.). Boston: Addison-Wesley. pp. 425–426

Kleene's algorithm (998 words) [view diff] exact match in snippet view article find links to article

John E. Hopcroft, Jeffrey D. Ullman (1979). Introduction to Automata Theory, Languages, and Computation. Addison-Wesley. ISBN 0-201-02988-X. Here: Section

Ogden's lemma (1,819 words) [view diff] case mismatch in snippet view article find links to article

Retrieved 16 May 2024. Hopcroft, John E. (1979). Introduction to automata theory, languages, and computation. Jeffrey D. Ullman. Reading, Mass.: Addison-Wesley

Reachability problem (887 words) [view diff] exact match in snippet view article find links to article

Hopcroft, Rajeev Motwani, Jeffrey D. Ullman (Eds.): Introduction to Automata Theory, Languages, and Computation - 3rd International Workshop, RP 2011, Massachusetts

Earley parser (1,587 words) [view diff] exact match in snippet view article find links to article

John E. Hopcroft and Jeffrey D. Ullman (1979). Introduction to Automata Theory, Languages, and Computation. Reading/MA: Addison-Wesley. ISBN 978-0-201-02988-8

Pumping lemma for context-free languages (1,532 words) [view diff] exact match in snippet view article find links to article

John E. Hopcroft, Jeffrey D. Ullman (1979). Introduction to Automata Theory, Languages, and Computation. Addison-Wesley. ISBN 0-201-02988-X. Here: sect

Two-way finite automaton (1,619 words) [view diff] exact match in snippet view article find links to article

John E. Hopcroft; Jeffrey D. Ullman (1979). Introduction to Automata Theory, Languages, and Computation. Addison-Wesley. ISBN 978-0-201-02988-8. Here:

CYK algorithm (2,189 words) [view diff] exact match in snippet view article find links to article

Hopcroft, John E.; Ullman, Jeffrey D. (1979). Introduction to Automata Theory, Languages, and Computation. Reading/MA: Addison-Wesley. ISBN 0-201-02988-X

String operations (2,321 words) [view diff] no match in snippet view article find links to article

Hopcroft, John E.; Ullman, Jeffrey D. (1979). Introduction to Automata Theory, Languages and Computation. Reading, Massachusetts: Addison-Wesley Publishing

Evolutionary computation (2,970 words) [view diff] exact match in snippet view article find links to article

Hopcroft, J.E., R. Motwani, and J.D. Ullman (2001) Introduction to Automata Theory, Languages, and Computation, Addison Wesley, Boston/San Francisco/New York

Regular expression (8,860 words) [view diff] exact match in snippet view article find links to article

Motwani, Rajeev & Ullman, Jeffrey D. (2003). Introduction to Automata Theory, Languages, and Computation. Upper Saddle River, New Jersey: Addison Wesley

Structural induction (1,750 words) [view diff] exact match in snippet view article find links to article

; Rajeev Motwani; Jeffrey D. Ullman (2001). Introduction to Automata Theory, Languages, and Computation (2nd ed.). Reading Mass: Addison-Wesley. ISBN 978-0-201-44124-6

Turing machine equivalents (2,667 words) [view diff] no match in snippet view article find links to article

automaton John Hopcroft and Jeffrey Ullman (1979). Introduction to Automata Theory, Languages and Computation (1st ed.). Addison–Wesley, Reading Mass. ISBN 0-201-02988-X

LL grammar (1,997 words) [view diff] exact match in snippet view article find links to article

Hopcroft, John E.; Ullman, Jeffrey D. (1979). Introduction to Automata Theory, Languages, and Computation. Addison-Wesley. ISBN 978-0-201-02988-8. Kernighan

Glob (programming) (2,431 words) [view diff] exact match in snippet view article

Motwani, Rajeev; Ullman, Jeffrey D. (2000). Introduction to Automata Theory, Languages, and Computation (2nd ed.). Addison-Wesley. "Lib/fnmatch.py".

Random-access stored-program machine (2,620 words) [view diff] no match in snippet view article find links to article

232–245. John Hopcroft, Jeffrey Ullman (1979). Introduction to Automata Theory, Languages and Computation, 1st ed., Reading Mass: Addison-Wesley. ISBN 0-201-02988-X

Context-sensitive grammar (3,503 words) [view diff] exact match in snippet view article find links to article

Hopcroft, John E.; Ullman, Jeffrey D. (1979). Introduction to Automata Theory, Languages, and Computation. Addison-Wesley. ISBN 9780201029888.; p. 223–224;

Proof of impossibility (3,915 words) [view diff] exact match in snippet view article find links to article

John E. Hopcroft, Jeffrey D. Ullman (1979). Introduction to Automata Theory, Languages, and Computation. Addison-Wesley. ISBN 0-201-02988-X. "...there

String (computer science) (5,027 words) [view diff] exact match in snippet view article

John E. Hopcroft, Jeffrey D. Ullman (1979). Introduction to Automata Theory, Languages, and Computation. Addison-Wesley. ISBN 0-201-02988-X. Here: sect

Quantifier (logic) (4,559 words) [view diff] exact match in snippet view article

Hopcroft, John E.; Ullman, Jeffrey D. (1979). Introduction to Automata Theory, Languages, and Computation. Reading, Massachusetts: Addison-Wesley. p. 344

(1961) John Hopcroft, Jeffrey Ullman (1979). Introduction to Automata Theory, Languages and Computation, 1st ed., Reading Mass: Addison-Wesley. ISBN 0-201-02988-X

Probabilistic context-free grammar (5,242 words) [view diff] exact match in snippet view article find links to article

Addison-Wesley. Hopcroft J. E.; Ullman J. D. (1979). Introduction to Automata Theory, Languages, and Computation. Addison-Wesley. Giegerich R. (2000). "Explaining

Halting problem (7,356 words) [view diff] exact match in snippet view article find links to article

Hopcroft, John E.; Ullman, Jeffrey D. (1979). Introduction to Automata Theory, Languages, and Computation (1st ed.). Addison-Wesley. ISBN 81-7808-347-7

Random-access machine (7,515 words) [view diff] no match in snippet view article find links to article

232–245. John Hopcroft, Jeffrey Ullman (1979). Introduction to Automata Theory, Languages and Computation, 1st ed., Reading Mass: Addison-Wesley. ISBN 0-201-02988-X

Suffix automaton (8,334 words) [view diff] exact match in snippet view article find links to article

John Edward; Ullman, Jeffrey David (1979). Introduction to Automata Theory, Languages, and Computation (1st ed.). Massachusetts: Addison-Wesley.

LR parser (8,130 words) [view diff] exact match in snippet view article find links to article

Hopcroft, John E.; Ullman, Jeffrey D. (1979). Introduction to Automata Theory, Languages, and Computation. Addison-Wesley. ISBN 0-201-02988-X. Here: Exercise