The Monad.Reader Issue 16 by Aran Donohue and John W. Lato and Louis Wasserman May 12, 2010

Source URL: themonadreader.files.wordpress.com

• Models of computation
• Software engineering
• Computing
• Nondeterministic finite automaton
• Deterministic finite automaton
• Regular expression
• Monad
• Finite-state machine
• Regular language
• Automata theory
• Formal languages
• Theoretical computer science

JMLR: Workshop and Conference Proceedings 34:94–108, 2014 Proceedings of the 12th ICGI Very efficient learning of structured classes of subsequential functions from positive data

Source URL: jmlr.org

• Models of computation
• Theoretical computer science
• Finite state transducer
• Metalogic
• Symbol
• Structure
• String
• Automata theory
• Formal languages
• Mathematics

Updating the header James Cummings and Magdalena Turska 1 September 2014

Source URL: dixit.uni-koeln.de

• P
• Software engineering
• Theoretical computer science
• Computing
• Automata theory
• Pattern matching
• Regular expression

Synthesis for Regular Specifications over Unbounded Domains Jad Hamza∗, Barbara Jobstmann†, Viktor Kuncak‡ ∗ ENS Cachan, France † CNRS/Verimag, France, ‡ EPFL, Switzerland

Source URL: lara.epfl.ch

• Mathematics
• Formal methods
• Nondeterministic finite automaton
• Linear temporal logic
• Finite-state machine
• Function
• Symbol
• Büchi automaton
• Automata theory
• Models of computation
• Theoretical computer science

A Uniformization Theorem for Nested Word to Word Transductions Dmitry Chistikov and Rupak Majumdar Max Planck Institute for Software Systems (MPI-SWS) Kaiserslautern and Saarbr¨ ucken, Germany

Source URL: www.mpi-sws.org

• Nested word
• Finite state transducer
• Finite-state machine
• Büchi automaton
• Automata theory
• Theoretical computer science
• Computer science

SMT and POR beat Counter Abstraction: Parameterized Model Checking of Threshold-Based Distributed Algorithms? Igor Konnov, Helmut Veith, and Josef Widder * Consi

Source URL: forsyte.at

• Probability theory
• Metalogic
• Model theory
• Automata theory

SMT-Based Synthesis of Distributed Systems∗ Bernd Finkbeiner Sven Schewe Universität des Saarlandes

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

• Automata theory
• Symbol
• Ω-automaton

Infinite Games: Simple Strategies for Simple Specifications Namit Chaturvedi, Jörg Olschewski, Wolfgang Thomas Meeting of the German Research Training Groups in Computer Science (part I), Schloss Dagstuhl June 21, 2011

Source URL: www.automata.rwth-aachen.de

Languages vs. ω-Languages in Regular Infinite Games Namit Chaturvedi? , Jörg Olschewski?? , and Wolfgang Thomas Lehrstuhl Informatik 7, RWTH Aachen University, Germany {chaturvedi,olschewski,thomas}@automata.rwth-aache

Source URL: www.automata.rwth-aachen.de

• Formal languages
• Computer science
• Theory of computation
• Ω-automaton
• Omega language
• Büchi automaton
• Symbol
• Determinacy
• Regular language
• Automata theory
• Mathematics
• Theoretical computer science

A Study of Pushdown Games Von der Fakultät für Mathematik, Informatik und Naturwissenschaften der RWTH Aachen University zur Erlangung des akademischen Grades eines Doktors der Naturwissenschaften genehmigte Dissertat

Source URL: darwin.bth.rwth-aachen.de

• Automata theory
• Nested word
• Words