Developmental Models of Herbaceous Plants for Computer Imagery Purposes
|
|
- Shanon Alexander
- 6 years ago
- Views:
Transcription
1 Developmental Models of Herbaceous Plants for Computer Imagery Purposes P. Prusinkiewicz, A. Lindenmayer, J. Hanan Proc. SIGGRAPH 1988
2 Overview Introduction Branching Structures Plant Development Geometrical Interpretation Developmental Models Modeling Organs Christopher Clement 2
3 Introduction Goal: Model herbaceous plants suitable for: Generating realistic plant images Animate developmental processes Realism: Simulate plant growth mechanisms L-systems: Models plant architecture, leaves, and flowers Christopher Clement 3
4 Branching Structures Rooted Trees Axial Trees Christopher Clement 4
5 Rooted Trees Labeled, Directed Root Node Terminal Nodes Edges Branch Segments Terminal Segments Christopher Clement 5
6 Axial Trees A type of rooted tree Each node has: At most one straight segment Zero or more lateral (side) segments Axis: Starts at root or lateral segment Rest composed of straight segments Last segment not followed by any straight segment Christopher Clement 6
7 Axial Trees (cont.) Christopher Clement 7
8 Plant Development Achieved via an edge rewriting mechanism Tree Productions: replace an edge (predecessor) with an axial tree (successor) Context-free Context-sensitive: consists of a left context, right context, and strict predecessor Productions applied in parallel Christopher Clement 8
9 Plant Development (cont.) Christopher Clement 9
10 Plant Development (cont.) Christopher Clement 10
11 L-systems A parallel rewriting system Can be deterministic or non-deterministic String representation consists of: Edge labels Brackets [ and ], which denote branches Context sensitive productions have the form: L < S > R Christopher Clement 11
12 L-system Examples Represented by ABC[DE][SG[HI[JK]L]MNO] Matches a production with predecessor BC < S > G[H]M Christopher Clement 12
13 L-system Examples (cont.) ω : S ω : A p 1 : S S[S]S[S]S p 1 : A S[A]S[A]A p 2 : S SS T 0 :S T 1 : S[S]S[S]S T 2 : S[S[S]S[S]S]S[S]S[S]S[S[S]S[S]S]S[S]S[S]S T 0 : A T 1 : S[A]S[A]A T 2 : SS[S[A]S[A]A]SS[S[A]S[A]A]S[A]S[A]A Christopher Clement 13
14 L-system Examples (cont.) Christopher Clement 14
15 L-system Examples (cont.) ω : J[I]I[I]I[I]I p 1 : J < I J ω : I[I]I[I]I[I]J p 1 : I > J J T 0 : J[I]I[I]I[I]I T 1 : J[J]J[I]I[I]I T 2 : J[J]J[J]J[I]I T 3 : J[J]J[J]J[J]J T 0 : I[I]I[I]I[I]J T 1 : I[I]I[I]J[I]J T 2 : I[I]J[I]J[I]J T 3 : J[I]J[I]J[I]J Christopher Clement 15
16 Geometrical Interpretation Generate 3D image from L-system string Symbols interpreted as commands to maneuver a LOGO-like turtle Turtle maintains state: Position Orientation: heading (H), left (L), up (U) vectors Other attributes (current color, line width, etc.) Christopher Clement 16
17 Moving the Turtle Symbol segment symbol + - ^ & \ / Action move forward a distance d while drawing turn left around U by angle increment δ turn right around U by angle increment δ turn 180 around U pitch up around L by angle increment δ pitch down around L by angle increment δ roll right around H by angle increment δ roll left around H by angle increment δ [ push current state onto stack ] pop state from stack; set as current state Christopher Clement 17
18 Interpretation Example Additional symbols: ': increment color table index!: decrease diameter of segments Christopher Clement 18
19 Developmental Models Sequential Growth Delays Qualitative Changes Interactions Signals Model Variation Christopher Clement 19
20 Sequential Growth An indefinite number of flowers are produced sequentially from a single stem Christopher Clement 20
21 Sequential Growth (cont.) Similar effect: leaves on zero and first order axes Christopher Clement 21
22 Delays Model delayed growth with additional states Christopher Clement 22
23 Qualitative Changes Change development at a point in time Christopher Clement 23
24 Qualitative Changes (cont.) Modeled via: Delay Mechanism Stochastic Mechanism Environmental Change Christopher Clement 24
25 Interactions via Signals Use signals to time developmental switches Christopher Clement 25
26 Model Variation Introduce variation into plants generated by deterministic L-systems In this case, π 1, π 2, and π 3 = 1/3 Christopher Clement 26
27 Modeling Organs Account for surfaces and volumes Simplest approach: predefine models Requires stages to be modeled individually Other approaches: Fill polygons consisting of L-system lines Define additional edges Christopher Clement 27
28 Modeling Organs (cont.) Fill polygon defined between { and }. Christopher Clement 28
29 Modeling Organs (cont.)? and # define the endpoints of new edges to be added. Christopher Clement 29
30 Any Questions? Christopher Clement 30
11. Automata and languages, cellular automata, grammars, L-systems
11. Automata and languages, cellular automata, grammars, L-systems 11.1 Automata and languages Automaton (pl. automata): in computer science, a simple model of a machine or of other systems. ( a simplification
More informationDepartment of Computer Sciences Graphics Fall 2005 (Lecture 8) Fractals
Fractals Consider a complex number z = a + bi as a point (a, b) or vector in the Real Euclidean plane [1, i] with modulus z the length of the vector and equal to a 2 + b 2. Complex arithmetic rules: (a
More informationCMSC 425: Lecture 11 Procedural Generation: Fractals and L-Systems
CMSC 425: Lecture 11 Procedural Generation: ractals and L-Systems Reading: The material on fractals comes from classic computer-graphics books. The material on L-Systems comes from Chapter 1 of The Algorithmic
More informationCPSC 453: L-Systems. Mark Matthews Office Hours: 3:15-4:00PM TR Office: 680J
CPSC 453: L-Systems Mark Matthews matthews@cpsc.ucalgary.ca Office Hours: 3:15-4:00PM TR Office: 680J www.cpsc.ucalgary.ca/~sheelagh/courses/453 Procedural Modeling Is it efficient to model these objects
More informationChapter 6 Animation of plant development
Chapter 6 Animation of plant development The sequences of images used in Chapters 3 and 5 to illustrate the development of inflorescences and compound leaves suggest the possibility of using computer animation
More informationChapter 8. Fractals. 8.1 Introduction
Chapter 8 Fractals 8.1 Introduction Nested patterns with some degree of self-similarity are not only found in decorative arts, but in many natural patterns as well (see Figure 8.1). In mathematics, nested
More informationAnimation of Tree Development
Animation of Tree Development Zhuming Lam and Scott A. King Computer Science Department, University of Dunedin, Dunedin, New Zealand zlam@cs.otago.ac.nz, sking@cs.otago.ac.nz Abstract The Lindenmayer system
More information1. Draw a parse tree for the following derivation: S C A C C A b b b b A b b b b B b b b b a A a a b b b b a b a a b b 2. Show on your parse tree u,
1. Draw a parse tree for the following derivation: S C A C C A b b b b A b b b b B b b b b a A a a b b b b a b a a b b 2. Show on your parse tree u, v, x, y, z as per the pumping theorem. 3. Prove that
More informationLanguage-Restricted Iterated Function Systems, Koch Constructions, and L-systems
Language-Restricted Iterated Function Systems, Koch Constructions, and L-systems Przemyslaw Prusinkiewicz and Mark Hammel Department of Computer Science University of Calgary Calgary, Alberta, Canada T2N
More informationTheory, Concepts and Terminology
GIS Workshop: Theory, Concepts and Terminology 1 Theory, Concepts and Terminology Suggestion: Have Maptitude with a map open on computer so that we can refer to it for specific menu and interface items.
More informationNotes on the Catalan problem
Notes on the Catalan problem Daniele Paolo Scarpazza Politecnico di Milano March 16th, 2004 Daniele Paolo Scarpazza Notes on the Catalan problem [1] An overview of Catalan problems
More informationIntegrating Markov Chain Models and L-systems to Simulate the Architectural Development of Apple Trees
Integrating Markov Chain Models and L-systems to Simulate the Architectural Development of Apple Trees M. Renton *, E. Costes *, Y. Guédon ** and C. Godin ** * UMR Unité Mixte de Recherche *UMR BEPC INRA/AgroM/CIRAD/IRD,
More informationCISC4090: Theory of Computation
CISC4090: Theory of Computation Chapter 2 Context-Free Languages Courtesy of Prof. Arthur G. Werschulz Fordham University Department of Computer and Information Sciences Spring, 2014 Overview In Chapter
More informationFoundations of Informatics: a Bridging Course
Foundations of Informatics: a Bridging Course Week 3: Formal Languages and Semantics Thomas Noll Lehrstuhl für Informatik 2 RWTH Aachen University noll@cs.rwth-aachen.de http://www.b-it-center.de/wob/en/view/class211_id948.html
More informationCS500 Homework #2 Solutions
CS500 Homework #2 Solutions 1. Consider the two languages Show that L 1 is context-free but L 2 is not. L 1 = {a i b j c k d l i = j k = l} L 2 = {a i b j c k d l i = k j = l} Answer. L 1 is the concatenation
More informationbiologically-inspired computing lecture 6 Informatics luis rocha 2015 INDIANA UNIVERSITY biologically Inspired computing
lecture 6 -inspired Sections I485/H400 course outlook Assignments: 35% Students will complete 4/5 assignments based on algorithms presented in class Lab meets in I1 (West) 109 on Lab Wednesdays Lab 0 :
More informationChapter 3. September 11, ax + b = 0.
Chapter 3 September 11, 2017 3.1 Solving equations Solving Linear Equations: These are equations that can be written as ax + b = 0. Move all the variables to one side of the equation and all the constants
More informationDiscrete Mathematics. CS204: Spring, Jong C. Park Computer Science Department KAIST
Discrete Mathematics CS204: Spring, 2008 Jong C. Park Computer Science Department KAIST Today s Topics Sequential Circuits and Finite-State Machines Finite-State Automata Languages and Grammars Nondeterministic
More informationTSP Water Project Report Snowflakes and Fractals
TSP Water Project Report Snowflakes and Fractals Group Leader: Group Members: David Curtin Thomas Clement Julian Gibbons Jeff Gordon Enoch Lau Ozan Onay John Sun Due Date: Thursday, 20 May 2004 Word Count:
More informationOutline. CS21 Decidability and Tractability. Machine view of FA. Machine view of FA. Machine view of FA. Machine view of FA.
Outline CS21 Decidability and Tractability Lecture 5 January 16, 219 and Languages equivalence of NPDAs and CFGs non context-free languages January 16, 219 CS21 Lecture 5 1 January 16, 219 CS21 Lecture
More informationA Proposal of a Botanical Tree Growth Control Method by Hormone Distribution Supplied from the Root
A Proposal of a Botanical Tree Growth Control Method by Hormone Distribution Supplied from the Root Ji-Joon Kim Nanzan University kim@it.nanzan-u.ac.jp Abstract In this paper I propose a growth control
More informationVariants of Turing Machine (intro)
CHAPTER 3 The Church-Turing Thesis Contents Turing Machines definitions, examples, Turing-recognizable and Turing-decidable languages Variants of Turing Machine Multi-tape Turing machines, non-deterministic
More informationTheory of Computation (VI) Yijia Chen Fudan University
Theory of Computation (VI) Yijia Chen Fudan University Review Forced handles Definition A handle h of a valid string v = xhy is a forced handle if h is the unique handle in every valid string xhŷ where
More informationLR2: LR(0) Parsing. LR Parsing. CMPT 379: Compilers Instructor: Anoop Sarkar. anoopsarkar.github.io/compilers-class
LR2: LR(0) Parsing LR Parsing CMPT 379: Compilers Instructor: Anoop Sarkar anoopsarkar.github.io/compilers-class Parsing - Roadmap Parser: decision procedure: builds a parse tree Top-down vs. bottom-up
More informationSelf Similarity In Plants: Integrating Mathematical And Biological Perspectives
Self Similarity In Plants: Integrating Mathematical And Biological Perspectives Przemyslaw Prusinkiewicz Department of Computer Science, University of Calgary 500 University Drive N.W., Calgary, Alberta,
More informationOn my honor, as an Aggie, I have neither given nor received unauthorized aid on this academic work
Lab 5 : Linking Name: Sign the following statement: On my honor, as an Aggie, I have neither given nor received unauthorized aid on this academic work 1 Objective The main objective of this lab is to experiment
More informationMATH 150 Pre-Calculus
MATH 150 Pre-Calculus Fall, 2014, WEEK 3 JoungDong Kim Week 3: 2B, 3A Chapter 2B. Solving Inequalities a < b a is less than b a b a is less than or equal to b a > b a is greater than b a b a is greater
More information8.G.1. Illustrative Mathematics Unit 1. 8.G.1a 8.G.2 8.G.3. 8.G.1c. Illustrative Mathematics Unit 2 8.G.2
Illustrative Mathematics Unit 3 Illustrative Mathematics Unit 2 Illustrative Mathematics Unit 1 8.G.1 8.G.1a 8.G.1b 8.G.1c 8.G.2 8.G.3 8.G.1 8.G.2 8.G.3 8.EE.5 8.EE.6 1st Nine Weeks Rigid Transformations
More informationComputing Static Single Assignment (SSA) Form
Computing Static Single Assignment (SSA) Form Overview What is SSA? Advantages of SSA over use-def chains Flavors of SSA Dominance frontiers revisited Inserting φ-nodes Renaming the variables Translating
More informationCPS 220 Theory of Computation Pushdown Automata (PDA)
CPS 220 Theory of Computation Pushdown Automata (PDA) Nondeterministic Finite Automaton with some extra memory Memory is called the stack, accessed in a very restricted way: in a First-In First-Out fashion
More informationarxiv: v2 [cs.ai] 4 Dec 2017
New Techniques for Inferring L-Systems Using Genetic Algorithm Jason Bernard and Ian McQuillan Department of Computer Science, University of Saskatchewan, Saskatoon, Canada jason.bernard@usask.ca, mcquillan@cs.usask.ca
More informationChapter 11. Modern Atomic Theory
Chapter 11 Modern Atomic Theory Chapter Map Atomic Theory To see a World in a Grain of Sand And a Heaven in a Wild Flower Hold Infinity in the palm of your hand And Eternity in an hour William Blake Auguries
More informationAutomata-Theoretic LTL Model-Checking
Automata-Theoretic LTL Model-Checking Arie Gurfinkel arie@cmu.edu SEI/CMU Automata-Theoretic LTL Model-Checking p.1 LTL - Linear Time Logic (Pn 77) Determines Patterns on Infinite Traces Atomic Propositions
More informationChapter 6: Probability The Study of Randomness
Chapter 6: Probability The Study of Randomness 6.1 The Idea of Probability 6.2 Probability Models 6.3 General Probability Rules 1 Simple Question: If tossing a coin, what is the probability of the coin
More informationSchool of Mechanical Engineering Purdue University. DC Motor Position Control The block diagram for position control of the servo table is given by:
Root Locus Motivation Sketching Root Locus Examples ME375 Root Locus - 1 Servo Table Example DC Motor Position Control The block diagram for position control of the servo table is given by: θ D 0.09 See
More informationEverything You Always Wanted to Know About Parsing
Everything You Always Wanted to Know About Parsing Part IV : Parsing University of Padua, Italy ESSLLI, August 2013 Introduction First published in 1968 by Jay in his PhD dissertation, Carnegie Mellon
More informationHistogram, cumulative frequency, frequency, 676 Horizontal number line, 6 Hypotenuse, 263, 301, 307
INDEX A Abscissa, 76 Absolute value, 6 7, 55 Absolute value function, 382 386 transformations of, reflection, 386 scaling, 386 translation, 385 386 Accuracy, 31 Acute angle, 249 Acute triangle, 263 Addition,
More informationContext-Free Languages (Pre Lecture)
Context-Free Languages (Pre Lecture) Dr. Neil T. Dantam CSCI-561, Colorado School of Mines Fall 2017 Dantam (Mines CSCI-561) Context-Free Languages (Pre Lecture) Fall 2017 1 / 34 Outline Pumping Lemma
More informationPLANTS FORM AND FUNCTION PLANT MORPHOLOGY PART I: BASIC MORPHOLOGY. Plant Form & Function Activity #1 page 1
AP BIOLOGY PLANTS FORM AND FUNCTION ACTIVITY #1 NAME DATE HOUR PLANT MORPHOLOGY PART I: BASIC MORPHOLOGY Plant Form & Function Activity #1 page 1 PART II: ROOTS 1. Examine the examples of the two root
More informationComputational Models - Lecture 4
Computational Models - Lecture 4 Regular languages: The Myhill-Nerode Theorem Context-free Grammars Chomsky Normal Form Pumping Lemma for context free languages Non context-free languages: Examples Push
More information4R & 4A Math Pacing Guides
GRADING PERIOD: 1st Nine Weeks Getting to Know You - Community Building 4.14- Data a. Collect data, using observations, surveys, measurement, polls, or questionnaires. b. Organize data into a chart or
More informationPushdown Automata (Pre Lecture)
Pushdown Automata (Pre Lecture) Dr. Neil T. Dantam CSCI-561, Colorado School of Mines Fall 2017 Dantam (Mines CSCI-561) Pushdown Automata (Pre Lecture) Fall 2017 1 / 41 Outline Pushdown Automata Pushdown
More informationThis lecture covers Chapter 6 of HMU: Pushdown Automata
This lecture covers Chapter 6 of HMU: ushdown Automata ushdown Automata (DA) Language accepted by a DA Equivalence of CFs and the languages accepted by DAs Deterministic DAs Additional Reading: Chapter
More informationModeling of spatial structure and development of plants
Modeling of spatial structure and development of plants Przemyslaw Prusinkiewicz Abstract Developmental models of plant structure capture the spatial arrangement of plant components and their development
More informationCSE 105 THEORY OF COMPUTATION
CSE 105 THEORY OF COMPUTATION Spring 2016 http://cseweb.ucsd.edu/classes/sp16/cse105-ab/ Today's learning goals Sipser Ch 2 Define push down automata Trace the computation of a push down automaton Design
More informationClinton Community School District K-8 Mathematics Scope and Sequence
6_RP_1 6_RP_2 6_RP_3 Domain: Ratios and Proportional Relationships Grade 6 Understand the concept of a ratio and use ratio language to describe a ratio relationship between two quantities. Understand the
More information5 Context-Free Languages
CA320: COMPUTABILITY AND COMPLEXITY 1 5 Context-Free Languages 5.1 Context-Free Grammars Context-Free Grammars Context-free languages are specified with a context-free grammar (CFG). Formally, a CFG G
More informationMIT Loop Optimizations. Martin Rinard
MIT 6.035 Loop Optimizations Martin Rinard Loop Optimizations Important because lots of computation occurs in loops We will study two optimizations Loop-invariant code motion Induction variable elimination
More informationGrammatical Induction with Error Correction for Deterministic Context-free L-systems
, October 24-26, 2012, San Francisco, US Grammatical Induction with Error Correction for Deterministic Context-free L-systems Ryohei Nakano and Shinya Suzumura bstract This paper addresses grammatical
More informationECE414/514 Electronics Packaging Spring 2012 Lecture 6 Electrical D: Transmission lines (Crosstalk) Lecture topics
ECE414/514 Electronics Packaging Spring 2012 Lecture 6 Electrical D: Transmission lines (Crosstalk) James E. Morris Dept of Electrical & Computer Engineering Portland State University 1 Lecture topics
More informationOn the Effectiveness of Symmetry Breaking
On the Effectiveness of Symmetry Breaking Russell Miller 1, Reed Solomon 2, and Rebecca M Steiner 3 1 Queens College and the Graduate Center of the City University of New York Flushing NY 11367 2 University
More informationChapter 33 - Electric Fields and Potential. Chapter 34 - Electric Current
Chapter 33 - Electric Fields and Potential Chapter 34 - Electric Current Electric Force acts through a field An electric field surrounds every electric charge. It exerts a force that causes electric charges
More informationGrade 8 Big Ideas + HMH Algebra SY
Topics and Chapters/Units Days in Dates Grade 8 Big Ideas + HMH Algebra 1 2017-2018 SY Benchmark 1 Benchmark 2 Benchmark 3 4 September 5 - October 31 BM Window Nov 1-17 November 2 - January 26 BM Window
More informationPOLYNOMIAL SPACE QSAT. Games. Polynomial space cont d
T-79.5103 / Autumn 2008 Polynomial Space 1 T-79.5103 / Autumn 2008 Polynomial Space 3 POLYNOMIAL SPACE Polynomial space cont d Polynomial space-bounded computation has a variety of alternative characterizations
More informationSlope Fields and Differential Equations. Copyright Cengage Learning. All rights reserved.
Slope Fields and Differential Equations Copyright Cengage Learning. All rights reserved. Objectives Review verifying solutions to differential equations. Review solving differential equations. Review using
More informationPushdown Automata. We have seen examples of context-free languages that are not regular, and hence can not be recognized by finite automata.
Pushdown Automata We have seen examples of context-free languages that are not regular, and hence can not be recognized by finite automata. Next we consider a more powerful computation model, called a
More informationSyntax Analysis Part III
Syntax Analysis Part III Chapter 4: Top-Down Parsing Slides adapted from : Robert van Engelen, Florida State University Eliminating Ambiguity stmt if expr then stmt if expr then stmt else stmt other The
More informationThe descriptions below provide an overview of the concepts and skills that students explore throughout the 8 th grade.
Mathematics Grade 8 The descriptions below provide an overview of the concepts and skills that students explore throughout the 8 th grade. The Number System This is the culminating area for the number
More informationDefinition: A grammar G = (V, T, P,S) is a context free grammar (cfg) if all productions in P have the form A x where
Recitation 11 Notes Context Free Grammars Definition: A grammar G = (V, T, P,S) is a context free grammar (cfg) if all productions in P have the form A x A V, and x (V T)*. Examples Problem 1. Given the
More informationVectors and the Geometry of Space
Vectors and the Geometry of Space Many quantities in geometry and physics, such as area, volume, temperature, mass, and time, can be characterized by a single real number scaled to appropriate units of
More informationComplexity (Pre Lecture)
Complexity (Pre Lecture) Dr. Neil T. Dantam CSCI-561, Colorado School of Mines Fall 2018 Dantam (Mines CSCI-561) Complexity (Pre Lecture) Fall 2018 1 / 70 Why? What can we always compute efficiently? What
More informationSection 1 (closed-book) Total points 30
CS 454 Theory of Computation Fall 2011 Section 1 (closed-book) Total points 30 1. Which of the following are true? (a) a PDA can always be converted to an equivalent PDA that at each step pops or pushes
More informationDoctoral Course in Speech Recognition. May 2007 Kjell Elenius
Doctoral Course in Speech Recognition May 2007 Kjell Elenius CHAPTER 12 BASIC SEARCH ALGORITHMS State-based search paradigm Triplet S, O, G S, set of initial states O, set of operators applied on a state
More informationMathematics KSHSSA Key Stage 3 Grade Descriptors
Developing Fluency, reasoning Mathematically and Problem Solving consolidate their numerical and mathematical capability from develop their mathematical knowledge, in part through key stage 2 and extend
More informationAutomata, Logic and Games: Theory and Application
Automata, Logic and Games: Theory and Application 1. Büchi Automata and S1S Luke Ong University of Oxford TACL Summer School University of Salerno, 14-19 June 2015 Luke Ong Büchi Automata & S1S 14-19 June
More informationEvolutionary Plantographics
Evolutionary Plantographics Abstract This letter describes an evolutionary system for creating lifelike three-dimensional plants and flowers, our main goal being the facilitation of producing realistic
More information(pp ) PDAs and CFGs (Sec. 2.2)
(pp. 117-124) PDAs and CFGs (Sec. 2.2) A language is context free iff all strings in L can be generated by some context free grammar Theorem 2.20: L is Context Free iff a PDA accepts it I.e. if L is context
More informationPushdown Automata: Introduction (2)
Pushdown Automata: Introduction Pushdown automaton (PDA) M = (K, Σ, Γ,, s, A) where K is a set of states Σ is an input alphabet Γ is a set of stack symbols s K is the start state A K is a set of accepting
More informationAutomata Theory CS S-12 Turing Machine Modifications
Automata Theory CS411-2015S-12 Turing Machine Modifications David Galles Department of Computer Science University of San Francisco 12-0: Extending Turing Machines When we added a stack to NFA to get a
More informationChapter 3 Deterministic planning
Chapter 3 Deterministic planning In this chapter we describe a number of algorithms for solving the historically most important and most basic type of planning problem. Two rather strong simplifying assumptions
More informationCS481F01 Prelim 2 Solutions
CS481F01 Prelim 2 Solutions A. Demers 7 Nov 2001 1 (30 pts = 4 pts each part + 2 free points). For this question we use the following notation: x y means x is a prefix of y m k n means m n k For each of
More informationUNIT III. CS1117 VIRTUAL REALITY 7 th SEM CSE
UNIT III CS1117 VIRTUAL REALITY 7 th SEM CSE VIRTUAL ENVIRONMENT The Dynamics of Numbers Numerical Interpolation Linear Interpolation Non-Linear Interpolation The Animation of Objects Linear Translation
More informationCS5371 Theory of Computation. Lecture 9: Automata Theory VII (Pumping Lemma, Non-CFL, DPDA PDA)
CS5371 Theory of Computation Lecture 9: Automata Theory VII (Pumping Lemma, Non-CFL, DPDA PDA) Objectives Introduce the Pumping Lemma for CFL Show that some languages are non- CFL Discuss the DPDA, which
More informationInterest Grabber. Analyzing Inheritance
Interest Grabber Section 11-1 Analyzing Inheritance Offspring resemble their parents. Offspring inherit genes for characteristics from their parents. To learn about inheritance, scientists have experimented
More information8th Grade Math Definitions
8th Grade Math Definitions Absolute Value: 1. A number s distance from zero. 2. For any x, is defined as follows: x = x, if x < 0; x, if x 0. Acute Angle: An angle whose measure is greater than 0 and less
More informationPartitioning the Positive Integers with the Collatz Algorithm Jim Rock
Partitioning the Positive Integers with the Collatz Algorithm Jim Rock Abstract. Collatz sequences are formed by applying the Collatz algorithm to a positive integer. If it is even repeatedly divide by
More informationTheory of Computation
Theory of Computation Lecture #10 Sarmad Abbasi Virtual University Sarmad Abbasi (Virtual University) Theory of Computation 1 / 43 Lecture 10: Overview Linear Bounded Automata Acceptance Problem for LBAs
More informationSCHEME FOR INTERNAL ASSESSMENT TEST 3
SCHEME FOR INTERNAL ASSESSMENT TEST 3 Max Marks: 40 Subject& Code: Automata Theory & Computability (15CS54) Sem: V ISE (A & B) Note: Answer any FIVE full questions, choosing one full question from each
More informationCMSC 330: Organization of Programming Languages. Pushdown Automata Parsing
CMSC 330: Organization of Programming Languages Pushdown Automata Parsing Chomsky Hierarchy Categorization of various languages and grammars Each is strictly more restrictive than the previous First described
More informationRatios and Proportions. To write ratios and solve proportions
7-1 Ratios and Proportions Content Standard Prepares for G.SRT. Use... similarity criteria for triangles to solve problems and to prove relationships in geometric figures. Objective To write ratios and
More informationDiscrete Mathematics
Discrete Mathematics Yi Li Software School Fudan University March 13, 2017 Yi Li (Fudan University) Discrete Mathematics March 13, 2017 1 / 1 Review of Lattice Ideal Special Lattice Boolean Algebra Yi
More informationRecursive Definitions. Recursive Definition A definition is called recursive if the object is defined in terms of itself.
Recursion Recursive Definitions Recursive Definition A definition is called recursive if the object is defined in terms of itself. Base Case Recursive definitions require a base case at which to either
More informationDon t Plan for the Unexpected: Planning Based on Plausibility Models
Don t Plan for the Unexpected: Planning Based on Plausibility Models Thomas Bolander, DTU Informatics, Technical University of Denmark Joint work with Mikkel Birkegaard Andersen and Martin Holm Jensen
More information3 Vectors. 18 October 2018 PHY101 Physics I Dr.Cem Özdoğan
Chapter 3 Vectors 3 Vectors 18 October 2018 PHY101 Physics I Dr.Cem Özdoğan 2 3 3-2 Vectors and Scalars Physics deals with many quantities that have both size and direction. It needs a special mathematical
More informationcse303 ELEMENTS OF THE THEORY OF COMPUTATION Professor Anita Wasilewska
cse303 ELEMENTS OF THE THEORY OF COMPUTATION Professor Anita Wasilewska LECTURE 14 SMALL REVIEW FOR FINAL SOME Y/N QUESTIONS Q1 Given Σ =, there is L over Σ Yes: = {e} and L = {e} Σ Q2 There are uncountably
More informationRecursive Definitions. Recursive Definition A definition is called recursive if the object is defined in terms of itself.
Recursion Recursive Definitions Recursive Definition A definition is called recursive if the object is defined in terms of itself. Base Case Recursive definitions require a base case at which to either
More informationFundamentele Informatica II
Fundamentele Informatica II Answer to selected exercises 5 John C Martin: Introduction to Languages and the Theory of Computation M.M. Bonsangue (and J. Kleijn) Fall 2011 5.1.a (q 0, ab, Z 0 ) (q 1, b,
More informationThe plant body has a hierarchy of organs, tissues, and cells. Plants, like multicellular animals:
Chapter 28 The plant body has a hierarchy of organs, tissues, and cells Plants, like multicellular animals: o Have organs composed of different tissues, which are in turn composed of cells 3 basic organs:
More information(pp ) PDAs and CFGs (Sec. 2.2)
(pp. 117-124) PDAs and CFGs (Sec. 2.2) A language is context free iff all strings in L can be generated by some context free grammar Theorem 2.20: L is Context Free iff a PDA accepts it I.e. if L is context
More informationRepeat tentative ideas from earlier - expand to better understand the term fractal.
Fractals Clouds are not spheres, mountains are not cones, coastlines are not circles, and bark is not smooth, nor does lightning travel in a straight line. (Mandelbrot, 1983) Repeat tentative ideas from
More informationNotes for Comp 497 (Comp 454) Week 12 4/19/05. Today we look at some variations on machines we have already seen. Chapter 21
Notes for Comp 497 (Comp 454) Week 12 4/19/05 Today we look at some variations on machines we have already seen. Errata (Chapter 21): None known Chapter 21 So far we have seen the equivalence of Post Machines
More informationThe Formation of A Tree Leaf
The Formation of A Tree Leaf Qinglan Xia University of California at Davis November 9, 2005 The beauty of tree leaves Observation: Tree leaves have diverse and elaborate venation patterns and shapes. Question:
More informationAutomata Theory (2A) Young Won Lim 5/31/18
Automata Theory (2A) Copyright (c) 2018 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later
More informationEinführung in die Computerlinguistik
Einführung in die Computerlinguistik Context-Free Grammars (CFG) Laura Kallmeyer Heinrich-Heine-Universität Düsseldorf Summer 2016 1 / 22 CFG (1) Example: Grammar G telescope : Productions: S NP VP NP
More information7th Grade Advanced Pacing Guide
1st Nine Weeks Equations 8.EE.7 Solve linear equations in one variable including rational coefficients. a. Give examples of linear equations in one variable with one solution, infinitely many solutions,
More informationContext Free Languages (CFL) Language Recognizer A device that accepts valid strings. The FA are formalized types of language recognizer.
Context Free Languages (CFL) Language Recognizer A device that accepts valid strings. The FA are formalized types of language recognizer. Language Generator: Context free grammars are language generators,
More informationWed Feb The vector spaces 2, 3, n. Announcements: Warm-up Exercise:
Wed Feb 2 4-42 The vector spaces 2, 3, n Announcements: Warm-up Exercise: 4-42 The vector space m and its subspaces; concepts related to "linear combinations of vectors" Geometric interpretation of vectors
More informationChapter 10. Right Triangles
Chapter 10 Right Triangles If we looked at enough right triangles and experimented a little, we might eventually begin to notice some relationships developing. For instance, if I were to construct squares
More informationMildly Context-Sensitive Grammar Formalisms: Thread Automata
Idea of Thread Automata (1) Mildly Context-Sensitive Grammar Formalisms: Thread Automata Laura Kallmeyer Sommersemester 2011 Thread automata (TA) have been proposed in [Villemonte de La Clergerie, 2002].
More informationCurriculum Summary Seventh Grade Pre-Algebra
Curriculum Summary Seventh Grade Pre-Algebra Students should know and be able to demonstrate mastery in the following skills by the end of Seventh Grade: Ratios and Proportional Relationships Analyze proportional
More information