Sciweavers

665 search results - page 80 / 133
» The Theory of Hybrid Automata
Sort
View
WOLLIC
2010
Springer
13 years 6 months ago
Mechanisation of PDA and Grammar Equivalence for Context-Free Languages
We provide a formalisation of the theory of pushdown automata (PDAs) using the HOL4 theorem prover. It illustrates how provers such as HOL can be used for mechanising complicated p...
Aditi Barthwal, Michael Norrish
GECCO
2005
Springer
128views Optimization» more  GECCO 2005»
14 years 1 months ago
Hybrid multiobjective genetic algorithm with a new adaptive local search process
This paper is concerned with a specific brand of evolutionary algorithms: Memetic algorithms. A new local search technique with an adaptive neighborhood setting process is introdu...
Salem F. Adra, Ian Griffin, Peter J. Fleming
LATA
2009
Springer
14 years 2 months ago
Monadic Second-Order Logic for Graphs: Algorithmic and Language Theoretical Applications
This tutorial will present an overview of the use of Monadic Second-Order Logic to describe sets of finite graphs and graph transformations, in relation with the notions of tree-w...
Bruno Courcelle
FSTTCS
2009
Springer
14 years 2 months ago
Covering of ordinals
The paper focuses on the structure of fundamental sequences of ordinals smaller than ε0. A first result is the construction of a monadic second-order formula identifying a given ...
Laurent Braud
ACL
1998
13 years 9 months ago
A Descriptive Characterization of Tree-Adjoining Languages (Project Note)
Since the early Sixties and Seventies it has been known that the regular and context-free languages arc characterized by definability in the monadic second-order theory of certain...
James Rogers