234 search results - page 40 / 47 » On Quasi-Products of Tree Automata |
115
click to vote
ATVA
2006
Springer
15 years 5 months ago
2006
Springer
In the past decades, many formal frameworks (e.g. timed automata and temporal logics) and techniques (e.g. model checking and theorem proving) have been proposed to model a real-ti...
103
click to vote
ICCAD
1995
IEEE
15 years 4 months ago
1995
IEEE
Abstract—We propose the use of the logic S1S as a mathematical framework for studying the synthesis of sequential designs. We will show that this leads to simple and mathematical...
CORR
2010
Springer
15 years 1 months ago
2010
Springer
Deterministic graph grammars generate regular graphs, that form a structural extension of configuration graphs of pushdown systems. In this paper, we study a probabilistic extensio...
103
click to vote
TCS
2002
15 years 29 days ago
2002
An operation M which constructs from a given structure M a tree-like structure whose domain consists of the finite sequences of elements of M is considered. A notion of automata r...
ICFP
2006
ACM
16 years 1 months ago
2006
ACM
Often, independent organizations define and advocate different XML formats for a similar purpose and, as a result, application programs need to mutually convert between such forma...