Finite automata

Results: 673



#Item
1Finite Horizon Analysis of Markov Automata Dissertation zur Erlangung des akademischen Grades des Doktors der Ingenieurwissenschaften (Dr.-Ing.) der Fakultät für Mathematik und Informatik der Universität des Saarlande

Finite Horizon Analysis of Markov Automata Dissertation zur Erlangung des akademischen Grades des Doktors der Ingenieurwissenschaften (Dr.-Ing.) der Fakultät für Mathematik und Informatik der Universität des Saarlande

Add to Reading List

Source URL: cgi.csc.liv.ac.uk

Language: English - Date: 2018-05-18 11:48:39
2Determinism versus Nondeterminism in Two-Way Finite Automata Recent Results around the Sakoda and Sipser Question Giovanni Pighizzini Dipartimento di Informatica

Determinism versus Nondeterminism in Two-Way Finite Automata Recent Results around the Sakoda and Sipser Question Giovanni Pighizzini Dipartimento di Informatica

Add to Reading List

Source URL: pighizzini.di.unimi.it

Language: English - Date: 2012-09-04 12:11:31
    3Math. Appl), 105–122 DOI: maTWO-DIMENSIONAL JUMPING FINITE AUTOMATA S. JAMES IMMANUEL and D. G. THOMAS Abstract. In this paper, we extend a newly introduced concept called the jumping

    Math. Appl), 105–122 DOI: maTWO-DIMENSIONAL JUMPING FINITE AUTOMATA S. JAMES IMMANUEL and D. G. THOMAS Abstract. In this paper, we extend a newly introduced concept called the jumping

    Add to Reading List

    Source URL: ma.fme.vutbr.cz

    Language: English - Date: 2017-01-12 07:11:34
      4Simulating Unary Context-Free Grammars and Pushdown Automata with Finite Automata Giovanni Pighizzini Dipartimento di Informatica e Comunicazione Università degli Studi di Milano ITALY

      Simulating Unary Context-Free Grammars and Pushdown Automata with Finite Automata Giovanni Pighizzini Dipartimento di Informatica e Comunicazione Università degli Studi di Milano ITALY

      Add to Reading List

      Source URL: pighizzini.di.unimi.it

      Language: English - Date: 2008-11-12 17:28:53
        5Determinism versus Nondeterminism in Two-Way Finite Automata Recent Results around the Sakoda and Sipser Question Giovanni Pighizzini Dipartimento di Informatica

        Determinism versus Nondeterminism in Two-Way Finite Automata Recent Results around the Sakoda and Sipser Question Giovanni Pighizzini Dipartimento di Informatica

        Add to Reading List

        Source URL: pighizzini.di.unimi.it

        Language: English - Date: 2012-09-04 12:11:30
          6The Complexity of Intersecting Finite Automata Having Few Final States

          The Complexity of Intersecting Finite Automata Having Few Final States

          Add to Reading List

          Source URL: www7.in.tum.de

          Language: English - Date: 2016-09-23 11:33:22
            7SHORTEST PATHS IN THE TOWER OF HANOI GRAPH AND FINITE AUTOMATA DAN ROMIK Abstract. We present efficient algorithms for constructing a shortest path between two configurations in the Tower of Hanoi graph, and for computin

            SHORTEST PATHS IN THE TOWER OF HANOI GRAPH AND FINITE AUTOMATA DAN ROMIK Abstract. We present efficient algorithms for constructing a shortest path between two configurations in the Tower of Hanoi graph, and for computin

            Add to Reading List

            Source URL: www.math.ucdavis.edu

            - Date: 2014-02-10 20:43:55
              8THE COMPLEXITY OF INTERSECTING FINITE AUTOMATA HAVING FEW FINAL STATES Michael Blondin, Andreas Krebs, and Pierre McKenzie

              THE COMPLEXITY OF INTERSECTING FINITE AUTOMATA HAVING FEW FINAL STATES Michael Blondin, Andreas Krebs, and Pierre McKenzie

              Add to Reading List

              Source URL: www-etud.iro.umontreal.ca

              - Date: 2014-09-08 14:53:13
                9Performance Enhancement with Speculative Execution Based Parallelism for Processing Large-scale XML-based Application Data Michael R. Head

                Performance Enhancement with Speculative Execution Based Parallelism for Processing Large-scale XML-based Application Data Michael R. Head

                Add to Reading List

                Source URL: www.cs.binghamton.edu

                Language: English - Date: 2013-07-27 18:42:38
                10Back to the Roots: Implementing the RTOS as a Specialized State Machine Christian Dietrich, Martin Hoffmann, Daniel Lohmann Department of Computer Science 4 - Distributed Systems and Operating Systems Friedrich-Alexander

                Back to the Roots: Implementing the RTOS as a Specialized State Machine Christian Dietrich, Martin Hoffmann, Daniel Lohmann Department of Computer Science 4 - Distributed Systems and Operating Systems Friedrich-Alexander

                Add to Reading List

                Source URL: www.mpi-sws.org

                Language: English - Date: 2016-07-14 16:23:27