3653 search results - page 294 / 731 » On Recognizable Timed Languages |
155
click to vote
ECEASST
2008
15 years 7 months ago
2008
: Graph parsing is known to be computationally expensive. For this reason the construction of special-purpose parsers may be beneficial for particular graph languages. In the domai...
183
click to vote
JALC
2007
15 years 6 months ago
2007
The basic finite automata model has been extended over the years with different acceptance modes (nondeterminism, alternation), new or improved devices (two-way heads, pebbles, ...
201
click to vote
IJAOSE
2010
15 years 5 months ago
2010
CASO is an agent-oriented programming language based on AgentSpeak(L), one of the most influential abstract languages based on the BDI (Beliefs-Desires-Intentions) architecture. ...
217
click to vote
OOPSLA
2010
Springer
15 years 5 months ago
2010
Springer
Atomic regions are an important concept in correct concurrent programming: since atomic regions can be viewed as having executed in a single step, atomicity greatly reduces the nu...
171
click to vote
TCS
2010
15 years 5 months ago
2010
This paper presents an embedded security sublanguage for enforcing informationflow policies in the standard Haskell programming language. The sublanguage provides useful informat...