Mindmap
Mathematical Preliminaries
Inhalt der Mindmap
Mathematical Preliminaries
Set
- Finite
- Infinite
- Subset
- Cardinality
- Operations
- Closures
- Unions
- Intersections
- Differences
- Sequences and tuples
- Relations and Functions
- Methods of Proof
- Mathematical Industion
- Strong Mathematicals induction
Theory Of Computation
- Computability
- Compatibility
- Automata
- Why
- Software desiging & checkinh behavior of digital circuits
- Desigining software for checkinh large body of text
- Desiging "lexical analyzer" of a compiler for token
- History
- before 1930- Alan turing- abstract machine
- 1940's & 1950's - finite automata
- 1950's- N,chomsky- Formal Grammar
- 1969- S.cook - extended Turing to Decidable and TTracticle
- Basic Concepts of Language
- Alphabets
- Language
- Strings
- Empty
- Length of string
- Concatenation of strings
- Suffix
- Prefix
- Substrings
- Power of alphabets
- Closures
- Kleen Closure
- Positive Closure
- Why
Informationen
- Beschreibung
- Mindmap am Mathematical Preliminaries, erstellt von Gaurav Tripathee am 20/11/2014.
- Erstellt von
- Gaurav Tripathee · Nov 2014
- Aktualisiert
- 8 Jun 2016
- Aufrufe
- 9
- Bewertung