815 search results - page 71 / 163 » Algebraic Recognizability of Languages |
173
click to vote
ETRICS
2006
15 years 9 months ago
2006
To cope with the complex requirements imposed on the processing of privacy-sensitive data within enterprises, the use of automatic or semi-automatic tools is gradually becoming in...
146
click to vote
FCT
2001
Springer
15 years 10 months ago
2001
Springer
Abstract. We present three results on divisibility monoids. These divisibility monoids were introduced in [11] as an algebraic generalization of Mazurkiewicz trace monoids. (1) We ...
148
click to vote
TLCA
2009
Springer
16 years 19 days ago
2009
Springer
Terms are a concise representation of tree structures. Since they can be naturally defined by an inductive type, they offer data structures in functional programming and mechanis...
169
click to vote
TCS
2002
15 years 5 months ago
2002
In this paper we study a process algebra whose semantics is based on true concurrency. In our model, actions are defined in terms of the resources they need to execute, which allo...
183
click to vote
NGITS
1999
Springer
15 years 10 months ago
1999
Springer
As the requirements for system analysis and design become more complex, the need for a natural, yet formal way of specifying system analysis findings and design decisions are becom...