Automata

Results: 1989



#Item
131

Minimal Partial Languages and Automata? F. Blanchet-Sadri1 , K. Goldner2 , and A. Shackleton3 1 Department of Computer Science, University of North Carolina, P.O. Box 26170, Greensboro, NC 27402–6170, USA

Add to Reading List

Source URL: www.uncg.edu

- Date: 2014-08-26 11:04:33
    132

    JMLR: Workshop and Conference Proceedings 21:254–258, 2012 The 11th ICGI Simple Variable Length N-grams for Probabilistic Automata Learning

    Add to Reading List

    Source URL: jmlr.csail.mit.edu

    - Date: 2012-08-19 06:00:06
      133

      Automata and Formal Languages Lecture notes WSManfred Kufleitner January 28, 2014

      Add to Reading List

      Source URL: www7.in.tum.de

      - Date: 2014-01-28 07:09:16
        134

        University of Warsaw Faculty of Mathematics, Informatics, and Mechanics Michał Skrzypczak Descriptive set theoretic methods in automata theory

        Add to Reading List

        Source URL: www.mimuw.edu.pl

        - Date: 2015-08-15 15:21:13
          135

          Automata-Based Analysis of Recursive Programs with Threads Markus Müller-Olm Westfälische Wilhelms-Universität Münster, Germany 25 Years of Combining Concurrency and Compositionality Königswinter, 7.-9. August 2013

          Add to Reading List

          Source URL: www.ips.tu-braunschweig.de

          - Date: 2013-08-13 02:41:33
            136

            Markov Automata and Distribution Bisimulations Christian Eisentraut Dependable Systems and Software Group Saarland University

            Add to Reading List

            Source URL: www.ips.tu-braunschweig.de

            - Date: 2013-08-13 02:41:30
              137

              Robustness in Timed Automata Patricia Bouyer1 , Nicolas Markey1 , and Ocan Sankur1,2 1 LSV – CNRS & ENS Cachan – France Universit´e Libre de Bruxelles – Belgium

              Add to Reading List

              Source URL: www.lsv.ens-cachan.fr

              - Date: 2013-09-06 05:42:30
                138

                Robust Reachability in Timed Automata: A Game-based Approach ? Patricia Bouyer, Nicolas Markey, and Ocan Sankur LSV, CNRS & ENS Cachan, France. {bouyer,markey,sankur}@lsv.ens-cachan.fr

                Add to Reading List

                Source URL: www.lsv.ens-cachan.fr

                - Date: 2012-05-18 09:46:04
                  139

                  Emptiness and Universality Problems in Timed Automata with Positive Frequency★ Nathalie Bertrand1 , Patricia Bouyer2 , Thomas Brihaye3 , and Am´elie Stainer1 1 2

                  Add to Reading List

                  Source URL: www.lsv.ens-cachan.fr

                  - Date: 2011-05-03 05:01:55
                    140

                    Timed Automata Can Always Be Made Implementable★ Patricia Bouyer1 , Kim G. Larsen2 , Nicolas Markey1 , Ocan Sankur1 , and Claus Thrane2 1

                    Add to Reading List

                    Source URL: www.lsv.ens-cachan.fr

                    - Date: 2011-06-24 09:42:56
                      UPDATE