815 search results - page 105 / 163 » Algebraic Recognizability of Languages |
COCOON
2006
Springer
15 years 3 months ago
2006
Springer
Reversible finite automata with halting states (RFA) were first considered by Ambainis and Freivalds to facilitate the research of KondacsWatrous quantum finite automata. In this ...
APSEC
2003
IEEE
15 years 3 months ago
2003
IEEE
Using the language Z for more than specification is hindered by the fact that its algebra of schemas is not monotonic with respect to refinement; so specification is modular, but ...
ICFEM
2000
Springer
15 years 3 months ago
2000
Springer
A family of well known problems on graphs includingthe shortest path problem and the data flow analysis problem can be uniformly formulated as a fixed-point problem on graphs. We ...
105
click to vote
ADBIS
2007
Springer
15 years 1 months ago
2007
Springer
This paper provides an answer-oriented multidimensional analysis environment. The approach is based on a conceptual point of view. We define a conceptual model that represents data...
WOTUG
2008
15 years 1 months ago
2008
Abstract. We prove the correctness of a two-way sliding window protocol with piggybacking, where the acknowledgments of the latest received data are attached to the next data trans...