Strings and Languages cs466(Prasad) L2Lang.

Slides:



Advertisements
Similar presentations
Properties of Regular Languages
Advertisements

1 Lecture 32 Closure Properties for CFL’s –Kleene Closure construction examples proof of correctness –Others covered less thoroughly in lecture union,
1 Languages. 2 A language is a set of strings String: A sequence of letters Examples: “cat”, “dog”, “house”, … Defined over an alphabet: Languages.
Finite Automata Section 1.1 CSC 4170 Theory of Computation.
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 Module 8 Closure Properties –Definition –Language class definition set of languages –Closure properties and first-order logic statements For all, there.
1 CSCI-2400 Models of Computation. 2 Computation CPU memory.
1 Regular Expressions. 2 Regular expressions describe regular languages Example: describes the language.
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.
Fall 2004COMP 3351 Single Final State for NFA. Fall 2004COMP 3352 Any NFA can be converted to an equivalent NFA with a single final state.
1 Languages and Finite Automata or how to talk to machines...
1 Single Final State for NFAs and DFAs. 2 Observation Any Finite Automaton (NFA or DFA) can be converted to an equivalent NFA with a single final state.
1 NFAs accept the Regular Languages. 2 Equivalence of Machines Definition: Machine is equivalent to machine if.
Costas Busch - RPI1 Mathematical Preliminaries. Costas Busch - RPI2 Mathematical Preliminaries Sets Functions Relations Graphs Proof Techniques.
Courtesy Costas Busch - RPI1 Mathematical Preliminaries.
Fall 2006Costas Busch - RPI1 Languages. Fall 2006Costas Busch - RPI2 Language: a set of strings String: a sequence of symbols from some alphabet Example:
1 Homework #1 Solutions 2 #1. True or False a)Given a language (set of strings) L, the question: “Is string w  L” is a decision problem: T F b)  =
Fall 2004COMP 3351 Languages. Fall 2004COMP 3352 A language is a set of strings String: A sequence of letters/symbols Examples: “cat”, “dog”, “house”,
1 Regular Expressions/Languages Regular languages –Inductive definitions –Regular expressions syntax semantics Not covered in lecture.
1 A Single Final State for Finite Accepters. 2 Observation Any Finite Accepter (NFA or DFA) can be converted to an equivalent NFA with a single final.
Fall 2004COMP 3351 Regular Expressions. Fall 2004COMP 3352 Regular Expressions Regular expressions describe regular languages Example: describes the language.
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,
The Data Element. 2 Data type: A description of the set of values and the basic set of operations that can be applied to values of the type. Strong typing:
Chapter 2 Languages.
The Data Element. 2 Data type: A description of the set of values and the basic set of operations that can be applied to values of the type. Strong typing:
CSE 311 Foundations of Computing I Lecture 16 Recursively Defined Sets and Structural Induction Spring
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,
1 Chapter 1 Automata: the Methods & the Madness Angkor Wat, Cambodia.
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,…}
Recursion. L162 Agenda Recursion and Induction Recursive Definitions Sets Strings.
Athasit Surarerks THEORY OF COMPUTATION 07 NON-DETERMINISTIC FINITE AUTOMATA 1.
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:
Chapter 5: Sequences, Mathematical Induction, and Recursion 5.9 General Recursive Definitions and Structural Induction 1 Erickson.
1 Module 14 Regular languages –Inductive definitions –Regular expressions syntax semantics.
Strings and Languages CS 130: Theory of Computation HMU textbook, Chapter 1 (Sec 1.5)
Chapter 4 Pumping Lemma Properties of Regular Languages Decidable questions on Regular Languages.
Mathematical Preliminaries
1 CD5560 FABER Formal Languages, Automata and Models of Computation Lecture 2 Mälardalen University 2010.
Regular Expressions Costas Busch - LSU.
Classifications LanguageGrammarAutomaton Regular, right- linear Right-linear, left-linear DFA, NFA Context-free PDA Context- sensitive LBA Recursively.
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.
Transparency No. 1 Formal Language and Automata Theory Homework 1.
1 Some Properties of Regular Languages. 2 Properties Concatenation:Star: Union: Are regular Languages For regular languages and.
Theory of Computation Lecture #
Languages.
Languages Prof. Busch - LSU.
Languages Costas Busch - LSU.
Formal Language & Automata Theory
Lecture Outline for Recurrences
Single Final State for NFA
CSE 311: Foundations of Computing
Closure Properties of Regular Languages
CSE 321 Discrete Structures
Closure Properties of Regular Languages
The Data Element.
Introduction Reading: Sections 1.5 – 1.7.
CSC 4170 Theory of Computation Finite Automata Section 1.1.
The Data Element.
Chapter 4 (Part 2): Mathematical Reasoning, Induction & Recursion
NFAs accept the Regular Languages
CSE 311 Foundations of Computing I
Languages Fall 2018.
Terminology and Symbols
Presentation transcript:

Strings and Languages cs466(Prasad) L2Lang

Alphabet String over (Finite) set of atomic elements / letters Finite sequence of elements / letters from Basis: Inductive step: Closure: … cs466(Prasad) L2Lang

Language over is a subset of . Examples cs466(Prasad) L2Lang

String Concatenation Recursive Definition (cf. defn. of +) Signature: string string string Recursive Definition (cf. defn. of +) concatenation primitive operation cs466(Prasad) L2Lang

String concatenation is associative. Implication Order of performing concatenation is immaterial. Parenthesis is redundant. Other Examples “+” and “*” on integers and matrices is associative, while “-” on integers is not. Is NAND and NOR on booleans associative? cs466(Prasad) L2Lang

Refer to the text for the proof of associativity of the concatenation operation. Refer to the text for the definition of reverse of a string and its properties. cs466(Prasad) L2Lang