2944 search results - page 183 / 589 » On Well Quasi-orders on Languages |
179
click to vote
LATA
2009
Springer
16 years 1 months ago
2009
Springer
We introduce the class of Rigid Tree Automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid. Rigid states define a rest...
214
click to vote
CEFP
2007
Springer
16 years 20 days ago
2007
Springer
This tutorial paper aims to provide the necessary expertise for working with the proof assistant Sparkle, which is dedicated to the lazy functional programming language Clean. The ...
170
click to vote
CONCUR
2007
Springer
16 years 20 days ago
2007
Springer
Scenario languages based on Message Sequence Charts (MSCs) have been widely studied in the last decade [21,20,3,15,12,19,14]. The high expressive power of MSCs renders many basic ...
182
click to vote
MOMPES
2006
IEEE
16 years 15 days ago
2006
IEEE
In this era of intense liking to automation in almost all time-critical fields, real-time systems have got widespread utilization in industrial, commercial, medical, space and mil...
157
click to vote
ECOOP
2004
Springer
15 years 12 months ago
2004
Springer
Given the importance of encapsulation to object-oriented programming, it is surprising to note that mainstream object-oriented languages offer only limited and fixed ways of enca...