- Copyright 2000 All Rights Reserved Copyright 2000 All Rights Reserved
- arXiv:1002.3769v2[cs.CC]11Apr2011 Polyominoes Simulating Arbitrary-Neighborhood
- Frontiers in Computational Neuroscience www.frontiersin.org November 2009 | Volume 3 | Article 20 | 1 COMPUTATIONAL NEUROSCIENCE
- International Journal of Foundations of Computer Science c World Scientific Publishing Company
- Bond-Free Languages: Formalizations, Maximality and Construction Methods
- Copyright by SIAM. Unauthorized reproduction of this article is prohibited. SIAM J. COMPUT. c 2009 Society for Industrial and Applied Mathematics
- Theoretical Computer Science 334 (2005) 131159 www.elsevier.com/locate/tcs
- Coding Properties of DNA Languages Salah Hussini1
- 72 communications of the acm | october 2008 | vol. 51 | no. 10 review articles
- A computer scientist's guide to molecular biology L. Kari, R. Kitto, G. Gloor
- Fundamenta Informaticae 72 (2006) 114 1 Block Substitutions and Their Properties
- Electronic copy available at: http://ssrn.com/abstract=1552384 Who counts your votes?
- Generalized derivatives Academy of Finland and Department of Mathematics,
- DNA Computing: A ResearchDNA Computing: A Research SnapshotSnapshotSnapshotSnapshot
- Theoretical Computer Science 410 (2009) 23932400 Contents lists available at ScienceDirect
- arXiv:1006.2897v3[cs.CC]25Nov2010 The Power of Nondeterminism in Self-Assembly
- PROD. TYPE: COM PP:1-22 (col.fig.: nil) YJCSS2023 DTD VER: 5.0.1
- Future Generation Computer Systems 17 (2001) 823834 DNA computing in vitro and in vivo
- Acta Informatica 35, 401420 (1998) c Springer-Verlag 1998
- Preventing Undesirable Bonds Between DNA Codewords
- DOI: 10.1142/S0129054111008131 International Journal of Foundations of Computer Science
- Dr. Kathleen Hill Associate Professor
- Power of controlled insertion and deletion Academy of Finland and Department of Mathematics1
- Two lower bounds on distributive generation of Juraj Hromkovic+
- DIMACS Series in Discrete Mathematics and Theoretical Computer Science
- DNA computing based on insertions and deletions Department of Computer Science, University of Western Ontario
- A Computer Scientist's Guide to Molecular Biology \Lambda
- arXiv:1002.4996v1[cs.DM]26Feb2010 Triangular Self-Assembly
- DNA computing: the arrival of biological mathematics
- K-catenation and applications: k-prefix codes Lila Kari and Gabriel Thierrin
- May 16, 2011 15:27 WSPC/INSTRUCTION FILE 15 International Journal of Foundations of Computer Science
- Bond-Free Languages: Formalizations, Maximality and Construction Methods
- arXiv:1002.2746v1[cs.DS]14Feb2010 Negative Interactions in Irreversible Self-Assembly
- Omega-syntactic congruences Lila Kari and Gabriel Thierrin
- Fundamenta Informaticae XX (2005) 111 1 Results on Transforming NFA into DFCA
- Twin-roots of words and their properties Lila Kari a
- On the regularity of iterated hairpin completion of a single word
- Block Insertion and Deletion on Trajectories , Lila Kari
- INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE Volume 22, Number 1, January 2011
- Towards a neighborhood simplification of tile systems: From Moore to quasi-linear dependencies
- Watson-Crick bordered words and their syntactic Lila Kari and Kalpana Mahalingam
- Journal of Computer and System Sciences 75 (2009) 113121 Contents lists available at ScienceDirect
- International Journal of Foundations of Computer Science c World Scientific Publishing Company
- Acta Informatica (2007) 44:153166 DOI 10.1007/s00236-007-0041-4
- Journal of Computer and System Sciences 70 (2005) 157178 www.elsevier.com/locate/jcss
- Theoretical Computer Science 330 (2005) 251266 www.elsevier.com/locate/tcs
- Journal of Automata, Languages and Combinatorics u (v) w, xy Otto-von-Guericke-Universitat Magdeburg
- Digital Object Identifier (DOI) 10.1007/s00236-003-0118-7 Acta Informatica 40, 119157 (2003)
- Intern. J. Computer Morh., Vol. 78, pp. 165-189 Reprints availabledirectly from the publisher
- Word insertions and primitivity Lila Kari and Gabriel Thierrin
- journal of computer and system sciences 53, 487 496 (1996) Maximal and Minimal Solutions to Language Equations*
- information and computation 131, 47 61 (1996) Contextual InsertionsDeletions
- The power of restricted splicing with rules from a regular Department of Mathematics University of Western Ontario
- Test Tube Distributed Systems Based on Splicing1
- K-insertion and k-deletion closure of languages Lila Kari and Gabriel Thierrin
- TlleOR?tical Computer Science
- On parallel deletions applied to a word1 , Alexandru Mateescu
- On language equations with invertible operations Academy of Finland and Department of Mathematics1
- Deletion operations: closure properties Academy of Finland and Department of Mathematics1
- Semi-Commutativity Sets of Morphisms over Finitely Generated Free Monoids1
- The Impact of the Number of Cooperating Grammars on the Generative Power
- One-Reversal Counter Machines and Multihead Automata: Revisited
- I. McQuillan and G. Pighizzini (Eds.): 12th International Workshop on Descriptional Complexity of Formal Systems (DCFS 2010)
- Scalable, Time-Responsive, Digital, Energy-Efficient Molecular Circuits using DNA Strand Displacement
- On the Reversibility of Parallel Insertion, and Its Relation to Comma Codes
- Duplication in DNA Sequences Masami Ito1
- Watson-Crick Conjugate and Commutative Lila Kari and Kalpana Mahalingam
- DNA Codes and Their Properties Lila Kari and Kalpana Mahalingam
- Hairpin Structures in DNA Words , Stavros Konstantinidis2
- Substitutions, Trajectories and Noisy Channels , Stavros Konstantinidis2
- Proceedings of the 25" Annual International Conference of the IEEEEMBS Cancun, Mexico * September 17-21,2003
- Some Properties of Ciliate Bio-operations Mark Daley and Lila Kari
- DNA Computing Based on Splicing: Universality Results
- Morphisms and associated congruences Lila Kari and Gabriel Thierrin
- Subapicai Bracketed L-Systems Przemyslaw PrusinkiewiczI and Lila Kari2
- Some Hierarchies for the Communication Complexity Measures of Cooperating Grammar
- On the Universality of P Systems with Minimal Symport/Antiport Rules
- Substitution on Trajectories , Stavros Konstantinidis2
- Codes, Involutions, and DNA Encodings Lila Kari, Rob Kitto, and Gabriel Thierrin
- Universal Molecular Computation in Ciliates Laura F. Landweber, Lila Kari
- Circular contextual insertions/deletions with applications to biomolecular computation1
- Languages and compatible relations on monoids Lila Kari and Gabriel Thierrin
- Aperiodic languages and generalizations Lila Kari and Gabriel Thierrin
- How to Compute with DNA , Mark Daley1
- From Micro-soft to Bio-soft: Computing with Department of Computer Science, University of Western Ontario
- DNA computers, tomorrow's reality "Come forth into the light of things
- Insertion operations: closure properties Academy of Finland and Mathematics Department1
- In the prehistory of formal language theory: Gauss languages
- Parallel Communicating Grammar Systems Lila Santean
- Secret Selling of Secrets with Several Buyers Arto Salomaa and Lila Santean
- Acknowledgements I would like to acknowledge my indebtedness and render my warmest thanks
- 1 Introduction 9 1.1 Synopsis . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9
- The University of Western Ontario Computer Science 9881b, Winter 2011
- DNA computing: the arrival of biological mathematics
- Reversible Molecular Computation in Ciliates Jarkko Kari \Lambda , Lila Kari y , Laura F. Landweber z
- De Bruijn Sequences Revisited The University of Western Ontario,
- Some hierarchies for the communication complexity measures of cooperating grammar
- Department of Mathematics, University of Western Ontario London, Ontario, N6A 5B7 Canada
- The spectrum of genomic signatures: from dinucleotides to chaos game representation
- Fundamenta Informaticae XX (2011) 118 1 Pseudopower Avoidance
- Secret Ballot Elections in Computer Networks Hannu Nurmi
- ELSEVIER Theoretical Computer Science 183 (1997) 3-19 Theoretical
- Invertible insertion and deletion operations Academy of Finland and Department of Mathematics1
- Insertion and Deletion of Words: Determinism and Reversibility
- Languages and monoids with disjunctive identity Lila Kari and Gabriel Thierrin
- DNA computing: the arrival of biological mathematics
- Theoretical Computer Science 231 (2000) 193203 www.elsevier.com/locate/tcs
- Theoretical Computer Science 245 (2000) 115133 www.elsevier.com/locate/tcs
- String Operations Suggested by DNA Biochemistry: The Balanced Cut Operation1
- WatsonCrick palindromes in DNA computing Lila Kari Kalpana Mahalingam
- On the Weight of Universal Insertion Grammars Petr Sos k1;2
- On a Special Class of Primitive Words Elena Czeizler, Lila Kari, and Shinnosuke Seki
- Negative Interactions in Irreversible Self-Assembly Beno^it Masson
- A Hierarchy of Unary Primitive Recursive String-functions
- Insertion and Deletion for Involution Codes Lila Kari and Kalpana Mahalingam
- Theoretical Computer Science 332 (2005) 4761 www.elsevier.com/locate/tcs
- Involution Solid Codes Lila Kari and Kalpana Mahalingam
- Theoretical Computer Science 320 (2004) 5169 www.elsevier.com/locate/tcs
- Nanocomputing by Self-Assembly Dept. of Computer Science
- Recombinant DNA Genetic Engineeringg g
- Computing with DNA 413 From: Methods in Molecular Biology, vol. 132: Bioinformatics Methods and Protocols
- Reversible Molecular Computation in Ciliates Jarkko Kari, Lila Kari
- Towards a DNA Solution to the Shortest Common Superstring Greg Gloor1
- Involution Solid and Join Codes Natasa Jonoska1
- PARALLEL COMMUNICATING GRAMMAR SYSTEMS
- Fundamenta Informaticae ??? (???) 10011018 1001 K-Comma Codes and Their Generalizations
- Chapter 3 Sequential and parallel
- International Journal of Foundations of Computer Science c World Scienti c Publishing Company
- DIMACS Series in Discrete Mathematics and Theoretical Computer Science
- Fundamenta Informaticae 71 (2006) 453475 453 A Formal Language Analysis of DNA Hairpin Structures
- On the decidability of self-assembly of infinite ribbons Leonard Adleman
- Biocomputing: An Application for Micro-arrays?
- Towards the Sequence Design Preventing Pseudoknot Formation
- Descriptional Complexity of Formal Systems (Draft) Deadline for submissions: April 7, 2008
- On Hairpin-Free Words and Languages , Stavros Konstantinidis2
- Generalized DOL trees , Grzegorz Rozenberg2
- Theoretical Computer Science 410 (2009) 32503260 Contents lists available at ScienceDirect
- BioSystems 52 (1999) 313 The evolution of cellular computing: nature's solution to a
- The Many Facets of Natural Computing Department of Computer Science
- P. Dmsi, Sz. Ivn (Eds.): Automata and Formal Languages. AFL 2011, Debrecen, Hungary, August 1722, 2011. Proceedings, pages 241 254
- Relativized Codes M. Daley, H. Jurgensen, L. Kari, K. Mahalingam
- Iterated Hairpin Completions of Non-crossing , Steffen Kopecki2
- A Hierarchy of Unary Primitive Recursive String-functions
- Triangular and Hexagonal Tile Self-Assembly Systems Triangular and Hexagonal Tile Self-Assembly Systems
- Lila Kari, and Kalpana Mahalingam University of Western Ontario,
- State Complexity of Union of Star and Intersection of Yuan Gao, Lila Kari, Sheng Yu
- DNA Computing: A Research University of Western Ontario
- Relativized Codes Mark Daley a
- December 1, 2011 13:9 WSPC/INSTRUCTION FILE muldebrunew De Bruijn Sequences Revisited
- Fundamenta Informaticae 114 (2012) 118 1 DOI 10.3233/FI-2011-608
- State Complexity of Combined Operations with Two Basic Operations$
- Triangular and Hexagonal Tile Self-assembly Lila Kari, Shinnosuke Seki, and Zhi Xu
- International Journal of Foundations of Computer Science Vol. 22, No. 7 (2011) 16551668
- Iterated Hairpin Completions of Non-crossing , Steffen Kopecki1,2
- State complexity of union and intersection of square and reversal on k regular languages$
- Prenex normal form It is often more convenient to deal with formulas in
- If A j=jA 0 and B j=jB 0 , then 1. :A j=j:A .
- Propositional language ffl By using connectives, we can combine propositions,
- UNIVERSITY OF WESTERN ONTARIO Computer Science 209b, Winter 2001
- UNIVERSITY OF WESTERN ONTARIO Computer Science 209b, Winter 2000
- 9free prenex normal form Recall that a sentence is a formula without free
- The Satisfiability Problem ffl Definition A formula F 2Form(L p ) is called
- UNIVERSITY OF WESTERN ONTARIO Computer Science 209b, Winter 2000
- UNIVERSITY OF WESTERN ONTARIO Computer Science 209b, Winter 2002
- UNIVERSITY OF WESTERN ONTARIO Computer Science 209b, Winter 2000
- Logic and bit operations ffl Computers represent information by bits.
- UNIVERSITY OF WESTERN ONTARIO Computer Science 209b, Winter 2002
- UNIVERSITY OF WESTERN ONTARIO Computer Science 209b, Winter 2000
- UNIVERSITY OF WESTERN ONTARIO Computer Science 209b, Winter 2002
- UNIVERSITY OF WESTERN ONTARIO Computer Science 209b, Winter 2001
- *) Probe by induction that n 2 2n + 3 for n 3. *) Prove by induction on n that for every n 1,
- Why binary? ffl Why are we bothering to use binary numbers?
- UNIVERSITY OF WESTERN ONTARIO Computer Science 209b, Winter 2002
- UNIVERSITY OF WESTERN ONTARIO Computer Science 209b, Winter 2002
- UNIVERSITY OF WESTERN ONTARIO Computer Science 209b, Winter 2000
- Some important logical arguments Example (A)
- UNIVERSITY OF WESTERN ONTARIO Computer Science 209b, Winter 2002
- UNIVERSITY OF WESTERN ONTARIO Computer Science 209b, Winter 2002
- UNIVERSITY OF WESTERN ONTARIO Computer Science 209b, Winter 2001
- UNIVERSITY OF WESTERN ONTARIO Computer Science 209b, Winter 2002
- UNIVERSITY OF WESTERN ONTARIO Computer Science 209b, Winter 2002
- UNIVERSITY OF WESTERN ONTARIO Computer Science 209b, Winter 2002
- UNIVERSITY OF WESTERN ONTARIO Computer Science 209b, Winter 2002
- Predicate Calculus: Semantics ffl The firstorder language L pred , even if associated with
- UNIVERSITY OF WESTERN ONTARIO Computer Science 209b, Winter 2000
- UNIVERSITY OF WESTERN ONTARIO Computer Science 209b, Winter 2002
- Basic notions and notations To betray you must first belong.
- UNIVERSITY OF WESTERN ONTARIO Computer Science 209b, Winter 2000
- Universal instantiation : (8\Gamma) From 8xP (x) we should be able to derive P (t) for
- UNIVERSITY OF WESTERN ONTARIO Computer Science 209b, Winter 2002
- Artificial Intelligence Automatic Theorem Proving
- UNIVERSITY OF WESTERN ONTARIO Computer Science 209b, Winter 2000
- UNIVERSITY OF WESTERN ONTARIO Computer Science 209b, Winter 2000
- Predicate Calculus (Alternative names: predicate logic, first order logic,
- Formal deducibility ffl We have seen how to prove statements by using truth
- UNIVERSITY OF WESTERN ONTARIO Computer Science 209b, Winter 2002
- Formal deducibility: definition Definition (Formal deducibility).
- UNIVERSITY OF WESTERN ONTARIO Computer Science 209b, Winter 2000
- UNIVERSITY OF WESTERN ONTARIO Computer Science 209b, Winter 2000
- Propositional language: Semantics The truth values of a nonatomic formula must be
- UNIVERSITY OF WESTERN ONTARIO Computer Science 209b, Winter 2000
- UNIVERSITY OF WESTERN ONTARIO Computer Science 209b, Winter 2000
- Tautologies and sound reasoning ffl A logical argument is sound if the conclusion logically
- Adequate set of connectives ffl A remarkable property of the standard set of
- Propositional calculus In standard algebra, expressions in which the
- Predicate Calculus (Firstorder logic) THE LANGUAGE L pred
- UNIVERSITY OF WESTERN ONTARIO Computer Science 209b, Winter 2000
- UNIVERSITY OF WESTERN ONTARIO Computer Science 209b, Winter 2002
- UNIVERSITY OF WESTERN ONTARIO Computer Science 209b, Winter 2002
- UNIVERSITY OF WESTERN ONTARIO Computer Science 209b, Winter 2002
- UNIVERSITY OF WESTERN ONTARIO Computer Science 209b, Winter 2000
- UNIVERSITY OF WESTERN ONTARIO Computer Science 209b, Winter 2002
- Logical consequence ffl Logical consequences in L pred , which are the
- UNIVERSITY OF WESTERN ONTARIO Computer Science 209b, Winter 2000
- UNIVERSITY OF WESTERN ONTARIO Computer Science 209a
- UNIVERSITY OF WESTERN ONTARIO Computer Science 209a
- UNIVERSITY OF WESTERN ONTARIO Computer Science 209b, Winter 2000
- UNIVERSITY OF WESTERN ONTARIO Computer Science 209b, Winter 2000
- UNIVERSITY OF WESTERN ONTARIO Computer Science 209a
- UNIVERSITY OF WESTERN ONTARIO Computer Science 209b, Winter 2000
- UNIVERSITY OF WESTERN ONTARIO Computer Science 209b, Winter 2000
- Logic and bit operations Computers represent information by bits.
- UNIVERSITY OF WESTERN ONTARIO Computer Science 209b, Winter 2000
- UNIVERSITY OF WESTERN ONTARIO Computer Science 2209b, Winter 2011-2012
- UNIVERSITY OF WESTERN ONTARIO Computer Science 2209b, Winter 2011-2012
- UNIVERSITY OF WESTERN ONTARIO Computer Science 209a
- UNIVERSITY OF WESTERN ONTARIO Computer Science 2209b, Winter 2011-2012
- arXiv:1112.4897v1[cs.FL]21Dec2011 Deciding if a Regular Language is
- UNIVERSITY OF WESTERN ONTARIO Computer Science 209b, Winter 2000
- UNIVERSITY OF WESTERN ONTARIO Computer Science 209b, Winter 2000
- UNIVERSITY OF WESTERN ONTARIO Computer Science 209a
- UNIVERSITY OF WESTERN ONTARIO Computer Science 209a
- UNIVERSITY OF WESTERN ONTARIO Computer Science 2209b, Winter 2011-2012
- UNIVERSITY OF WESTERN ONTARIO Computer Science 209b, Winter 2000
- UNIVERSITY OF WESTERN ONTARIO Computer Science 209a
- UNIVERSITY OF WESTERN ONTARIO Computer Science 209b, Winter 2000
- UNIVERSITY OF WESTERN ONTARIO Computer Science 209a
- UNIVERSITY OF WESTERN ONTARIO Computer Science 209a
- UNIVERSITY OF WESTERN ONTARIO Computer Science 209a
- Theoretical Computer Science ( ) Contents lists available at SciVerse ScienceDirect
- UNIVERSITY OF WESTERN ONTARIO Computer Science 209a
- UNIVERSITY OF WESTERN ONTARIO Computer Science 209b, Winter 2000
- UNIVERSITY OF WESTERN ONTARIO Computer Science 2209b, Winter 2011-2012
- Predicate Calculus (Alternative names: predicate logic, first order logic,
- UNIVERSITY OF WESTERN ONTARIO Computer Science 209b, Winter 2000
- UNIVERSITY OF WESTERN ONTARIO Computer Science 209a
- UNIVERSITY OF WESTERN ONTARIO Computer Science 209b, Winter 2000
- UNIVERSITY OF WESTERN ONTARIO Computer Science 2209b, Winter 2011 -2012
- UNIVERSITY OF WESTERN ONTARIO Computer Science 209b, Winter 2000
- UNIVERSITY OF WESTERN ONTARIO Computer Science 209a
- Prenex normal form It is often more convenient to deal with formulas in which all
- UNIVERSITY OF WESTERN ONTARIO Computer Science 209a
- UNIVERSITY OF WESTERN ONTARIO Computer Science 209a
- UNIVERSITY OF WESTERN ONTARIO Computer Science 2209b, Winter 2011-2012
- UNIVERSITY OF WESTERN ONTARIO Computer Science 209a, Fall 2000
- UNIVERSITY OF WESTERN ONTARIO Computer Science 209b, Winter 2000
- UNIVERSITY OF WESTERN ONTARIO Computer Science 209a
- March 15, 2011 23:27 WSPC/INSTRUCTION FILE cat-sr-IJFCS International Journal of Foundations of Computer Science
- Elsevier Editorial System(tm) for Theoretical Computer Science Manuscript Draft
