303 search results - page 5 / 61 » Automata on Gauss Words |
TYPES
1993
Springer
13 years 11 months ago
1993
Springer
Abstract. A data link protocol developed and used by Philips Electronics is modeled and veri ed using I/O automata theory. Correctness is computer-checked with the Coq proof develo...
ATVA
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Much is known about the differences in expressiveness and succinctness between nondeterministic and deterministic automata on infinite words. Much less is known about the...
FSTTCS
2004
Springer
14 years 22 days ago
2004
Springer
d Abstract) Zhe Dang ¡£¢¤¢ , Oscar H. Ibarra ¥ , Pierluigi San Pietro ¦ , and Gaoyan Xie ¡ § School of Electrical Engineering and Computer Science Washington State Univers...
BANFF
1995
13 years 11 months ago
1995
The automata-theoretic approach to linear temporal logic uses the theory of automata as a unifying paradigm for program specification, verification, and synthesis. Both programs ...
ICTAC
2009
Springer
14 years 1 months ago
2009
Springer
Abstract. Regular expressions with numerical constraints are an extension of regular expressions, allowing to bound numerically the number of times that a subexpression should be m...