Automata

Results: 1989



#Item
331

A CATEGORICAL OUTLOOK ON CELLULAR AUTOMATA SILVIO CAPOBIANCO AND TARMO UUSTALU Institute of Cybernetics at Tallinn University of Technology, Akadeemia tee 21, 12618 Tallinn, Estonia E-mail address: {silvio,tarmo}@cs.ioc.

Add to Reading List

Source URL: cs.ioc.ee

Language: English - Date: 2010-11-18 05:04:42
    332Formal languages / Finite automata / Nested word / Words / Finite-state machine

    OpenNWA: A Nested-Word Automaton Library⋆ Evan Driscoll1 , Aditya Thakur1 , and Thomas Reps1,2 1 Computer Sciences Department, University of Wisconsin – Madison {driscoll,adi,reps}@cs.wisc.edu

    Add to Reading List

    Source URL: research.cs.wisc.edu

    Language: English - Date: 2012-09-06 17:14:22
    333

    NASA Formal Methods 2015 April 27th, 2015 Pasadena, CA, USA Reachability Preservation Based Parameter Synthesis for Timed Automata

    Add to Reading List

    Source URL: lipn.univ-paris13.fr

    Language: English - Date: 2015-04-27 11:02:53
      334

      A Practical Linear Time Algorithm for Trivial Automata Model Checking of Higher-Order Recursion Schemes Naoki Kobayashi Tohoku University

      Add to Reading List

      Source URL: www.kb.ecei.tohoku.ac.jp

      Language: English - Date: 2011-03-07 00:53:17
        335

        arXiv:cond-matv1 9 DecEffects of Static and Dynamic Disorder on the Performance of Neural Automata J.J. Torres, J. Marro, P.L. Garrido, J.M. Cort´es, F. Ramos, and M.A. Mu˜ noz

        Add to Reading List

        Source URL: ergodic.ugr.es

        Language: English - Date: 2004-07-22 05:48:28
          336

          As Soon as Possible: Time Optimal Control for Timed Automata? Eugene Asarin1 and Oded Maler2 1 Institute for Information Transmission Problems, 19 Bol. Karetnyi per

          Add to Reading List

          Source URL: www.liafa.jussieu.fr

          Language: English - Date: 2003-09-04 08:34:47
            337

            BOUNDARY GROWTH IN ONE-DIMENSIONAL CELLULAR AUTOMATA CHARLES D. BRUMMITT AND ERIC ROWLAND Abstract. We systematically study the boundaries of one-dimensional, 2color cellular automata depending on 4 cells, begun from sim

            Add to Reading List

            Source URL: thales.math.uqam.ca

            Language: English - Date: 2012-09-11 15:00:14
              338

              Approximating Continuous Systems by Timed Automata⋆ Oded Maler1 and Gr´egory Batt2 1 Verimag-UJF-CNRS, 2 Av. de Vignate, 38610 Gi`eres, France

              Add to Reading List

              Source URL: www-verimag.imag.fr

              Language: English - Date: 2008-03-27 12:58:06
                339

                ARE THERE FACTOR-UNIVERSAL CA? MICHAEL HOCHMAN There are a number of notions of universality that have been studied for cellular automata. Most of these involve either computation-theoretic universality (i.e. that, under

                Add to Reading List

                Source URL: math.huji.ac.il

                Language: English - Date: 2009-08-24 16:41:57
                  340

                  Morphic words governing the boundaries of cellular automata Charles Brummitt1 1 University 2 LaCIM,

                  Add to Reading List

                  Source URL: thales.math.uqam.ca

                  Language: English - Date: 2012-05-23 13:17:00
                    UPDATE