Automata

Results: 1989



#Item
341

CS–172 Computability & Complexity, FallMinimizing Finite Automata Given a DFA M , can we find an equivalent DFA (i.e., one that recognizes the same language as M ) with the minimum possible number of states? Thi

Add to Reading List

Source URL: www-inst.eecs.berkeley.edu

Language: English - Date: 2009-02-26 03:08:20
    342

    A CHARACTERIZATION OF p-AUTOMATIC SEQUENCES AS COLUMNS OF LINEAR CELLULAR AUTOMATA ERIC ROWLAND AND REEM YASSAWI Abstract. We show that a sequence over a finite field Fq of characteristic p is p-automatic if and only if

    Add to Reading List

    Source URL: thales.math.uqam.ca

    Language: English - Date: 2014-11-27 14:46:18
      343

      Journal of Automata, Languages and Combinatorics, 97–115 c Otto-von-Guericke-Universit¨ at Magdeburg TWO-WAY FINITE AUTOMATA

      Add to Reading List

      Source URL: lambda-diode.com

      Language: English - Date: 2011-08-02 21:34:36
        344

        Secure Outsourcing of DNA Searching via Finite Automata Marina Blanton and Mehrdad Aliasgari Department of Computer Science and Engineering, University of Notre Dame, {mblanton,maliasga}@cse.nd.edu

        Add to Reading List

        Source URL: www.cse.nd.edu

        Language: English - Date: 2010-04-19 21:32:59
          345

          Publications in Conference Proceedings or Collections [91] H. Bordihn, H. Jürgensen, H. Ritter: Soliton automata with multiple waves. In C. S. Calude, R. Freivalds, I. Kazuo (editors): Computing with New Resources: Essa

          Add to Reading List

          Source URL: www.csd.uwo.ca

          Language: English - Date: 2015-10-28 14:58:40
            346

            Reachability problem for weak multi-pushdown automata Wojciech Czerwi´nski, Piotr Hofman, and Sławomir Lasota? Institute of Informatics, University of Warsaw wczerwin,ph209519,

            Add to Reading List

            Source URL: www.mimuw.edu.pl

            Language: English - Date: 2012-08-06 16:28:45
              347

              FSFMA 2013 16th July 2013 Singapore Dynamic Clock Elimination in Parametric Timed Automata

              Add to Reading List

              Source URL: lipn.univ-paris13.fr

              Language: English - Date: 2013-07-15 23:36:14
                348

                ATVA 2013 18th October 2013 Hà Nội, Việt Nam Merge and Conquer State Merging in Parametric Timed Automata

                Add to Reading List

                Source URL: lipn.univ-paris13.fr

                Language: English - Date: 2013-10-18 04:32:56
                  349Complexity classes / Computational complexity theory / Finite automata / Models of computation / Analysis of algorithms / Nondeterminism / NL / Randomized algorithm / Automata theory / Theory of computation / Communication complexity / NP

                  Computation Power of Randomization and Nondeterminism 2 Scientific Work

                  Add to Reading List

                  Source URL: www.ite.ethz.ch

                  Language: English - Date: 2008-10-23 07:54:38
                  350

                  Neurocomputing 58– – 71 www.elsevier.com/locate/neucom Switching between memories in neural automata with synaptic noise

                  Add to Reading List

                  Source URL: ergodic.ugr.es

                  Language: English - Date: 2004-07-22 05:49:14
                    UPDATE