233 search results - page 41 / 47 » Equivalent Transformations of Automata by Using Behavioural ... |
FORTE
2008
13 years 9 months ago
2008
In software engineering, graphical formalisms, like state-transition tables and automata, are very often indispensable parts of the specifications. Such a formalism usually leads t...
PTS
2008
13 years 9 months ago
2008
The state space explosion due to concurrency and timing constraints of concurrent real-time systems (CRTS) presents significant challenges to the verification engineers. In this pa...
LATA
2009
Springer
14 years 2 months ago
2009
Springer
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...
MFCS
2007
Springer
14 years 1 months ago
2007
Springer
In formal language theory, many families of languages are defined using grammars or finite acceptors like pushdown automata and Turing machines. For instance, context-sensitive l...
FOIKS
2004
Springer
14 years 29 days ago
2004
Springer
Abstract. We give a general framework for approximate query processing in semistructured databases. We focus on regular path queries, which are the integral part of most of the que...