Exploració per tema "Automata theory"

Ara es mostren els items 1-4 de 4

    • Automatic evaluation of context-free grammars (system description) 

      Creus López, Carles; Godoy Balil, Guillem (Springer, 2014)
      Text en actes de congrés
      Accés restringit per política de l'editorial
      We implement an online judge for context-free grammars. Our system contains a list of problems describing formal languages, and asking for grammars generating them. A submitted proposal grammar receives a verdict of ...

    • Conditions for compatibility of components: The case of masters and slaves 

      Beek, Maurice ter; Carmona Vargas, Josep; Kleijn, Jetty (Springer, 2016)
      Text en actes de congrés
      Accés obert
      We consider systems composed of reactive components that collaborate through synchronised execution of common actions. These multi-component systems are formally represented as team automata, a model that allows a wide ...

    • Decidable classes of tree automata mixing local and global constraints modulo flat theories 

      Barguño, Luis; Creus López, Carles; Godoy Balil, Guillem; Jacquemard, Florent; Vacher, Camile (2013-02)
      Article
      Accés obert
      We define a class of ranked tree automata TABG generalizing both the tree automata with local tests between brothers of Bogaert and Tison (1992) and with global equality and disequality constraints (TAGED) of Filiot et al. ...

    • On zero-one and convergence laws for graphs embeddable on a fixed surface 

      Atserias, Albert; Kreutzer, Stephan; Noy Serrano, Marcos (Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018)
      Text en actes de congrés
      Accés obert
      We show that for no surface except for the plane does monadic second-order logic (MSO) have a zero-one-law - and not even a convergence law - on the class of (connected) graphs embeddable on the surface. In addition we ...