815 search results - page 22 / 163 » Algebraic Recognizability of Languages |
MUM
2005
ACM
15 years 5 months ago
2005
ACM
We present a method that preserves the recognizability of key object interactions in a vector animation. The method allows an artist to author an animation once, and then output i...
CORR
2008
Springer
14 years 12 months ago
2008
Springer
Abstract. We generalize some of the central results in automata theory to the abstraction level of coalgebras and thus lay out the foundations of a universal theory of automata ope...
IPL
2008
14 years 11 months ago
2008
It is a truism that for a machine to have a useful access to memory or workspace, it must "know" where its input ends and its working memory begins. Most machine models ...
IEEEARES
2009
IEEE
15 years 6 months ago
2009
IEEE
—Alice and Bob notation is a popular way to describe security protocols: it is intuitive, succinct, and yet expressive. Several formal protocol specification languages are based...
COMPSAC
2004
IEEE
15 years 3 months ago
2004
IEEE
Many developers who could benefit from building and analysing formal models of their systems are deterred from doing so by the process algebra style input languages of formal mode...