Investigations on Automata and Languages over a Unary Alphabet Giovanni Pighizzini Dipartimento di Informatica Università degli Studi di Milano, Italy

Source URL: pighizzini.di.unimi.it

• Applied mathematics
• Automata theory
• Algebraic structures
• Computational complexity theory
• Unary language
• Nested word
• Formal languages
• Mathematics
• Theoretical computer science

BRICS Basic Research in Computer Science BRICS RSDavid & M¨oller: From Hierarichcal Timed Automata to U PPAAL

Source URL: www.brics.dk

Branching-Time Model Checking of Parametric One-Counter Automata Stefan G¨oller1 , Christoph Haase2 , Jo¨el Ouaknine2 , and James Worrell2 1 2

Source URL: www.informatik.uni-bremen.de

Regular Path Queries on Graphs with Data ∗ Leonid Libkin

Source URL: homepages.inf.ed.ac.uk

• Mathematics
• Combinatorics
• Regular expression
• Regular language
• FO
• Star height
• Cycle rank
• Formal languages
• Automata theory
• Theoretical computer science

Automatic construction of parse trees for lexemes ∗ Danny Dub´e Anass Kadiri Universit´e Laval

Source URL: schemeworkshop.org

• Formal languages
• Computing
• Automata theory
• Models of computation
• Parsing
• Lexical analysis
• Context-free grammar
• Parse tree
• Regular expression
• Programming language implementation
• Software engineering
• Compiler construction

ε-Samples for Kernels Jeff M. Phillips University of Utah April 3, 2012

Source URL: www.cs.utah.edu

• Computational geometry
• Ε-net
• Positive-definite kernel
• Continuous function
• Automata theory
• Symbol
• Dirac delta function
• Mathematical analysis
• Operator theory
• Mathematics

Alternating Automata Semantic Constructions for the Bounded Model Checking of Regular Linear Temporal Logic (Extended Version) Juli´an Samborski-Forlese IMDEA Software Institute, Madrid, Spain Email:

Source URL: software.imdea.org

• Computer science
• Büchi automaton
• Linear temporal logic
• Symbol
• Complementation of Büchi automaton
• Automata theory
• Theoretical computer science
• Formal methods

On Subsets with Cardinalities of Intersections Divisible by a Fixed Integer by P. Frankl Bell Laboratories Murray Hill, New Jersey 07974

Source URL: www.dtc.umn.edu

• Hadamard matrix
• Automata theory
• Combinatorics
• Matrix theory
• Mathematics
• Matrices
• Design theory

Regular Linear-time Temporal Logic Martin Leucker Institut f¨ur Informatik TU M¨unchenGarching, Germany Email:

Source URL: software.imdea.org

• Formal languages
• Logic in computer science
• Complexity classes
• Automata theory
• Temporal logic
• Linear temporal logic
• Modal logic
• Dynamic logic
• Model checking
• Theoretical computer science
• Mathematics
• Logic

Doctoral Scholarships in the Research Training Group The DFG Research Training Group GRK 1763 “Quantitative Logics and Automata” offers 8 Doctoral Scholarships for applicants interested in performing high-quality res

Source URL: lat.inf.tu-dresden.de

• Theoretical computer science
• Computer science
• Academia
• Education
• Knowledge
• Franz Baader
• Year of birth missing
• Dresden University of Technology