Languages Costas Busch - LSU.

Slides:



Advertisements
Similar presentations
Formal Languages Languages: English, Spanish,... PASCAL, C,... Problem: How do we define a language? i.e. what sentences belong to a language? e.g.Large.
Advertisements

Finite-State Machines with No Output Ying Lu
Properties of Regular Languages
YES-NO machines Finite State Automata as language recognizers.
1 Languages. 2 A language is a set of strings String: A sequence of letters Examples: “cat”, “dog”, “house”, … Defined over an alphabet: Languages.
1 CSCI-2400 Models of Computation. 2 Computation CPU memory.
Fall 2006Costas Busch - RPI1 Deterministic Finite Automata And Regular Languages.
Regular Languages Sequential Machine Theory Prof. K. J. Hintz Department of Electrical and Computer Engineering Lecture 3 Comments, additions and modifications.
CS 310 – Fall 2006 Pacific University CS310 Strings, String Operators, and Languages Sections: August 30, 2006.
Regular Languages Sequential Machine Theory Prof. K. J. Hintz Department of Electrical and Computer Engineering Lecture 3 Comments, additions and modifications.
Courtesy Costas Busch - RPI1 Turing Machines. Courtesy Costas Busch - RPI2 The Language Hierarchy Regular Languages Context-Free Languages ? ?
1 Languages and Finite Automata or how to talk to machines...
CS5371 Theory of Computation Lecture 1: Mathematics Review I (Basic Terminology)
Costas Busch - RPI1 Mathematical Preliminaries. Costas Busch - RPI2 Mathematical Preliminaries Sets Functions Relations Graphs Proof Techniques.
Costas Busch - RPI1 Turing Machines. Costas Busch - RPI2 The Language Hierarchy Regular Languages Context-Free Languages ? ?
Courtesy Costas Busch - RPI1 Mathematical Preliminaries.
Theoretical Computer Science COMP 335 Fall 2004
Fall 2006Costas Busch - RPI1 Languages. Fall 2006Costas Busch - RPI2 Language: a set of strings String: a sequence of symbols from some alphabet Example:
Fall 2004COMP 3351 Languages. Fall 2004COMP 3352 A language is a set of strings String: A sequence of letters/symbols Examples: “cat”, “dog”, “house”,
Finite-State Machines with No Output Longin Jan Latecki Temple University Based on Slides by Elsa L Gunter, NJIT, and by Costas Busch Costas Busch.
UofH - COSC Dr. Verma COSC 3340: Introduction to Theory of Computation Rakesh Verma Computer Science Department University of Houston URL:
CSC312 Automata Theory Lecture # 2 Languages.
CSC312 Automata Theory Lecture # 2 Languages.
Costas Busch - LSU1 Languages. Costas Busch - LSU2 Language: a set of strings String: a sequence of symbols from some alphabet Example: Strings: cat,
Mathematical Preliminaries Strings and Languages Preliminaries 1.
Lecture Two: Formal Languages Formal Languages, Lecture 2, slide 1 Amjad Ali.
1 Strings and Languages. 2 Review Sets and sequences Functions and relations Graphs Boolean logic:      Proof techniques: – Construction, Contradiction,
Two examples English-Words English-Sentences alphabet S ={a,b,c,d,…}
1 Chapter 1 Introduction to the Theory of Computation.
Fall 2006Costas Busch - RPI1 Deterministic Finite Automaton (DFA) Input Tape “Accept” or “Reject” String Finite Automaton Output.
1 CD5560 FABER Formal Languages, Automata and Models of Computation Lecture 2 Mälardalen University 2006.
Mathematical Preliminaries. Sets Functions Relations Graphs Proof Techniques.
1 Languages. 2 A language is a set of strings String: A sequence of letters Examples: “cat”, “dog”, “house”, … Defined over an alphabet:
1 Exercise: Prove that the set S = { π : π is a permutation of {1, 2, 3, …, n} for some integer n ≥ 1 } is countable.
A Universal Turing Machine
Strings and Languages CS 130: Theory of Computation HMU textbook, Chapter 1 (Sec 1.5)
1 String v is a prefix of w if w= v y for some string y. String v is a suffix of w if w= x v for some string x. String v is a substring of w if there are.
1 CD5560 FABER Formal Languages, Automata and Models of Computation Lecture 2 Mälardalen University 2010.
1 CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 2 School of Innovation, Design and Engineering Mälardalen University 2012.
Regular Expressions Costas Busch - LSU.
Strings and Languages Denning, Section 2.7. Alphabet An alphabet V is a finite nonempty set of symbols. Each symbol is a non- divisible or atomic object.
Theory of computation Introduction theory of computation: It comprises the fundamental mathematical properties of computer hardware, software,
Introduction Why do we study Theory of Computation ?
Introduction Why do we study Theory of Computation ?
Costas Busch - LSU1 The Post Correspondence Problem.
1 Let S = { π : π is a permutation of {1, 2, 3, …, n} for some integer n ≥ 1 }. (a) List the elements of S for n= 1, 2, and 3. (b) Prove that the set S.
Languages and Strings Chapter 2. (1) Lexical analysis: Scan the program and break it up into variable names, numbers, etc. (2) Parsing: Create a tree.
Introduction Why do we study Theory of Computation ?
Costas Busch - LSU1 Deterministic Finite Automata And Regular Languages.
Alphabet, String, Language. 2 Alphabet and Strings An alphabet is a finite, non-empty set of symbols. –Denoted by  –{ 0, 1 } is a binary alphabet. –{
A Universal Turing Machine
Languages.
Languages Prof. Busch - LSU.
Properties of Regular Languages
Theory of Computation Theory of computation is mainly concerned with the study of how problems can be solved using algorithms.  Therefore, we can infer.
Reductions Costas Busch - LSU.
Languages, prefixes, sets, cardinality, functions
Some slides by Elsa L Gunter, NJIT, and by Costas Busch
Regular Expressions Prof. Busch - LSU.
Deterministic Finite Automata And Regular Languages Prof. Busch - LSU.
Properties of Regular Languages
Undecidable problems:
Mathematical Preliminaries Strings and Languages
Languages, prefixes, sets, cardinality, functions
Introduction Reading: Sections 1.5 – 1.7.
Chapter 1 Introduction to the Theory of Computation
CSC312 Automata Theory Lecture # 2 Languages.
Languages Fall 2018.
Introduction and Chapter One: Fundamentals
Terminology and Symbols
Presentation transcript:

Languages Costas Busch - LSU

Language: a set of strings String: a sequence of symbols from some alphabet Example: Strings: cat, dog, house Language: {cat, dog, house} Alphabet: Costas Busch - LSU

Languages are used to describe computation problems: Alphabet: Costas Busch - LSU

Computation is translated to set membership Example computation problem: Is number prime? Equivalent set membership problem: Costas Busch - LSU

Alphabets and Strings An alphabet is a set of symbols Example Alphabet: A string is a sequence of symbols from the alphabet String variables Example Strings Costas Busch - LSU

Decimal numbers alphabet Binary numbers alphabet Costas Busch - LSU

Unary numbers alphabet Decimal number: Costas Busch - LSU

String Operations Concatenation Costas Busch - LSU

Reverse Costas Busch - LSU

String Length Length: Examples: Costas Busch - LSU

Length of Concatenation Example: Costas Busch - LSU

Empty String A string with no letters is denoted: Acts as a neutral element Observations: Costas Busch - LSU

Substring Substring of string: a subsequence of consecutive characters Costas Busch - LSU

Prefix and Suffix string Prefixes Suffixes prefix suffix Costas Busch - LSU

Exponent Operation Example: Definition: Costas Busch - LSU

The * Operation : the set of all possible strings from alphabet Costas Busch - LSU

The + Operation : the set of all possible strings from alphabet except Costas Busch - LSU

Languages A language over alphabet is any subset of Example: Costas Busch - LSU

More Language Examples An infinite language Alphabet Costas Busch - LSU

Prime numbers Numbers divisible by 1 and itself Alphabet Language: Costas Busch - LSU

Even and odd numbers Alphabet Languages: Costas Busch - LSU

Addition (of unary numbers) Alphabet: Language: Costas Busch - LSU

Squares (of unary numbers) Alphabet: Language: Costas Busch - LSU

Size of a language (number of elements): Two special languages Language with empty string Empty language Size of a language (number of elements): Costas Busch - LSU

Note that: Sets Set size Set size String length Costas Busch - LSU

Operations on Languages The usual set operations: Complement: Costas Busch - LSU

Reverse Definition: Examples: Costas Busch - LSU

Concatenation Definition: Example: Costas Busch - LSU

Another Operation Definition: Special case: Costas Busch - LSU

Example Costas Busch - LSU

Star-Closure (Kleene *) All strings that can be constructed from Definition: Example: Costas Busch - LSU

Positive Closure Definition: Note that: Costas Busch - LSU