Automata and Computability
-10%
portes grátis
Automata and Computability
A Programmer's Perspective
Gopalakrishnan, Ganesh
Taylor & Francis Ltd
02/2019
348
Dura
Inglês
9781138552425
15 a 20 dias
1140
Descrição não disponível.
I Foundations
1 What Machines Think
2 Defining Languages: Patterns in Sets of Strings
3 Kleene Star: Basic Method of defining Repetitious Patterns
II Machines
4 Basics of DFAs
5 Designing DFA
6 Operations on DFA
7 Nondeterministic Finite Automata
8 Regular Expressions and NFA
9 NFA to RE conversion
10 Derivative-based Regular Expression Matching
11 Context-Free Languages and Grammars
12 Pushdown Automata
13 Turing Machines
III Concepts
14 Interplay Between Formal Languages
15 Post Correspondence, and Other Undecidability Proofs
16 NP-Completeness
17 Binary Decision Diagrams as Minimal DFA
18 Computability using Lambdas
1 What Machines Think
2 Defining Languages: Patterns in Sets of Strings
3 Kleene Star: Basic Method of defining Repetitious Patterns
II Machines
4 Basics of DFAs
5 Designing DFA
6 Operations on DFA
7 Nondeterministic Finite Automata
8 Regular Expressions and NFA
9 NFA to RE conversion
10 Derivative-based Regular Expression Matching
11 Context-Free Languages and Grammars
12 Pushdown Automata
13 Turing Machines
III Concepts
14 Interplay Between Formal Languages
15 Post Correspondence, and Other Undecidability Proofs
16 NP-Completeness
17 Binary Decision Diagrams as Minimal DFA
18 Computability using Lambdas
Este título pertence ao(s) assunto(s) indicados(s). Para ver outros títulos clique no assunto desejado.
SAT Solver;NFA State;theory of computation;Pushdown Automaton;autonoma;NFA;discrete math;Turing Machine;Python;Context Sensitive Language;Turing machines;PDA;lambdas;Context Free Languages;automata theory;Regular Language;derivative-based parsing;Boolean Satisfiability;functional programming code;Context Free Grammar;Lambda reducer;Re;Mapping Reduction;Non-final State;BDD.;Input String;Lambda Calculus;DFA;Deterministic Finite State Automaton;Infinite Tape;State St3;Proof Sketch;BDD;Boolean Function;Lambda Expression
I Foundations
1 What Machines Think
2 Defining Languages: Patterns in Sets of Strings
3 Kleene Star: Basic Method of defining Repetitious Patterns
II Machines
4 Basics of DFAs
5 Designing DFA
6 Operations on DFA
7 Nondeterministic Finite Automata
8 Regular Expressions and NFA
9 NFA to RE conversion
10 Derivative-based Regular Expression Matching
11 Context-Free Languages and Grammars
12 Pushdown Automata
13 Turing Machines
III Concepts
14 Interplay Between Formal Languages
15 Post Correspondence, and Other Undecidability Proofs
16 NP-Completeness
17 Binary Decision Diagrams as Minimal DFA
18 Computability using Lambdas
1 What Machines Think
2 Defining Languages: Patterns in Sets of Strings
3 Kleene Star: Basic Method of defining Repetitious Patterns
II Machines
4 Basics of DFAs
5 Designing DFA
6 Operations on DFA
7 Nondeterministic Finite Automata
8 Regular Expressions and NFA
9 NFA to RE conversion
10 Derivative-based Regular Expression Matching
11 Context-Free Languages and Grammars
12 Pushdown Automata
13 Turing Machines
III Concepts
14 Interplay Between Formal Languages
15 Post Correspondence, and Other Undecidability Proofs
16 NP-Completeness
17 Binary Decision Diagrams as Minimal DFA
18 Computability using Lambdas
Este título pertence ao(s) assunto(s) indicados(s). Para ver outros títulos clique no assunto desejado.
SAT Solver;NFA State;theory of computation;Pushdown Automaton;autonoma;NFA;discrete math;Turing Machine;Python;Context Sensitive Language;Turing machines;PDA;lambdas;Context Free Languages;automata theory;Regular Language;derivative-based parsing;Boolean Satisfiability;functional programming code;Context Free Grammar;Lambda reducer;Re;Mapping Reduction;Non-final State;BDD.;Input String;Lambda Calculus;DFA;Deterministic Finite State Automaton;Infinite Tape;State St3;Proof Sketch;BDD;Boolean Function;Lambda Expression
