3653 search results - page 86 / 731 » On Recognizable Timed Languages |
170
click to vote
ICDT
2009
ACM
15 years 10 months ago
2009
ACM
The class of unions of conjunctive queries (UCQ) has been shown to be particularly well-behaved for data exchange; its certain answers can be computed in polynomial time (in terms...
COCOON
2006
Springer
15 years 1 months ago
2006
Springer
In a recent article, Nakhleh, Ringe and Warnow introduced perfect phylogenetic networks--a model of language evolution where languages do not evolve via clean speciation--and form...
102
click to vote
TIC
2000
Springer
15 years 1 months ago
2000
Springer
Abstract. A type-based certifying compiler maps source code to machine code and target-level type annotations. The target-level annotations make it possible to prove easily that th...
DATE
1997
IEEE
15 years 2 months ago
1997
IEEE
This paper proposes extensions to the VHDL grammar and de nes new semantics in the language to model the timing behavior of high frequency buses and clock lines with multiple, dis...
CSR
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. We introduce dynamic communicating automata (DCA), an extension of communicating finite-state machines that allows for dynamic creation of processes. Their behavior can ...