Fall 2006Costas Busch - RPI1 Languages. Fall 2006Costas Busch - RPI2 Language: a set of strings String: a sequence of symbols from some alphabet Example:

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
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.
Courtesy Costas Busch - RPI1 A Universal Turing Machine.
Costas Busch - RPI1 Single Final State for NFAs. Costas Busch - RPI2 Any NFA can be converted to an equivalent NFA with a single final state.
Fall 2006Costas Busch - RPI1 Regular Expressions.
1 CSCI-2400 Models of Computation. 2 Computation CPU memory.
Fall 2006Costas Busch - RPI1 Deterministic Finite Automata And Regular Languages.
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...
Fall 2006Costas Busch - RPI1 Pushdown Automata PDAs.
CS5371 Theory of Computation Lecture 1: Mathematics Review I (Basic Terminology)
Fall 2006Costas Busch - RPI1 Properties of Regular Languages.
Costas Busch - RPI1 Mathematical Preliminaries. Costas Busch - RPI2 Mathematical Preliminaries Sets Functions Relations Graphs Proof Techniques.
Fall 2005Costas Busch - RPI1 Recursively Enumerable and Recursive Languages.
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
Topics Automata Theory Grammars and Languages Complexities
Finite Automata Costas Busch - RPI.
Fall 2005Costas Busch - RPI1 Pushdown Automata PDAs.
Fall 2004COMP 3351 Languages. Fall 2004COMP 3352 A language is a set of strings String: A sequence of letters/symbols Examples: “cat”, “dog”, “house”,
Lecture 1 String and Language. String string is a finite sequence of symbols. For example, string ( s, t, r, i, n, g) CS4384 ( C, S, 4, 3, 8) (1,
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.
1 Strings and Languages. 2 Review Sets and sequences Functions and relations Graphs Boolean logic:      Proof techniques: – Construction, Contradiction,
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.
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.
CSC312 Automata Theory Lecture # 3 Languages-II. Formal Language A formal language is a set of words—that is, strings of symbols drawn from a common alphabet.
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.
Introduction Why do we study Theory of Computation ?
Introduction Why do we study Theory of Computation ?
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.
Introduction Why do we study Theory of Computation ?
Costas Busch - LSU1 Deterministic Finite Automata And Regular Languages.
Chapter 1 INTRODUCTION TO THE THEORY OF COMPUTATION.
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. –{
Languages.
Languages Prof. Busch - LSU.
Languages Costas Busch - LSU.
Theory of Computation Theory of computation is mainly concerned with the study of how problems can be solved using algorithms.  Therefore, we can infer.
Pushdown Automata PDAs
Undecidable Problems (unsolvable problems)
Some slides by Elsa L Gunter, NJIT, and by Costas Busch
Deterministic Finite Automata And Regular Languages Prof. Busch - LSU.
The Post Correspondence Problem
A Universal Turing Machine
Properties of Context-Free languages
Mathematical Preliminaries Strings and Languages
Introduction Reading: Sections 1.5 – 1.7.
Chapter 1 Introduction to the Theory of Computation
Formal Definitions for Turing Machines
COSC 3340: Introduction to Theory of Computation
CSC312 Automata Theory Lecture # 2 Languages.
Languages Fall 2018.
Presentation transcript:

Fall 2006Costas Busch - RPI1 Languages

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

Fall 2006Costas Busch - RPI3 Languages are used to describe computation problems: Alphabet:

Fall 2006Costas Busch - RPI4 Alphabets and Strings Example Strings Example Alphabet: An alphabet is a set of symbols A string is a sequence of symbols from the alphabet

Fall 2006Costas Busch - RPI5 Decimal numbers alphabet Binary numbers alphabet

Fall 2006Costas Busch - RPI6 Unary numbers alphabet Unary number: Decimal number:

Fall 2006Costas Busch - RPI7 String Operations Concatenation

Fall 2006Costas Busch - RPI8 Reverse

Fall 2006Costas Busch - RPI9 String Length Length: Examples:

Fall 2006Costas Busch - RPI10 Length of Concatenation Example:

Fall 2006Costas Busch - RPI11 Empty String A string with no letters is denoted: Observations:

Fall 2006Costas Busch - RPI12 Substring Substring of string: a subsequence of consecutive characters String Substring

Fall 2006Costas Busch - RPI13 Prefix and Suffix Prefixes Suffixes prefix suffix

Fall 2006Costas Busch - RPI14 Another Operation Example: Definition:

Fall 2006Costas Busch - RPI15 The * Operation : the set of all possible strings from alphabet

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

Fall 2006Costas Busch - RPI17 Languages A language over alphabet is any subset of Examples: Language:

Fall 2006Costas Busch - RPI18 More Language Examples An infinite language Alphabet

Fall 2006Costas Busch - RPI19 Prime numbers Alphabet Language:

Fall 2006Costas Busch - RPI20 Even and odd numbers Alphabet

Fall 2006Costas Busch - RPI21 Unary Addition Alphabet: Language:

Fall 2006Costas Busch - RPI22 Squares Alphabet: Language:

Fall 2006Costas Busch - RPI23 Note that: Sets Set size String length

Fall 2006Costas Busch - RPI24 Operations on Languages The usual set operations Complement:

Fall 2006Costas Busch - RPI25 Reverse Definition: Examples:

Fall 2006Costas Busch - RPI26 Concatenation Definition: Example:

Fall 2006Costas Busch - RPI27 Another Operation Definition: Special case:

Fall 2006Costas Busch - RPI28

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

Fall 2006Costas Busch - RPI30 Positive Closure Definition: Same with but without the