219 search results - page 35 / 44 » Bond-Free Languages: Formalizations, Maximality and Construc... |
FORMATS
2004
Springer
14 years 29 days ago
2004
Springer
Abstract. We extend Angluin’s algorithm for on-line learning of regular languages to the setting of timed systems. We consider systems that can be described by a class of determi...
ICSE
2000
IEEE-ACM
13 years 11 months ago
2000
IEEE-ACM
This paper describes an experiment to use the Spin model checking system to support automated verification of time partitioning in the Honeywell DEOS real-time scheduling kernel. ...
DLT
2004
13 years 9 months ago
2004
There is a close relationship between formal language theory and data compression. Since 1990's various types of grammar-based text compression algorithms have been introduced...
NIPS
2004
13 years 9 months ago
2004
Semantic taxonomies such as WordNet provide a rich source of knowledge for natural language processing applications, but are expensive to build, maintain, and extend. Motivated by...
ICFCA
2005
Springer
14 years 1 months ago
2005
Springer
Minimal generators (or mingen) constitute a remarkable part of the closure space landscape since they are the antipodes of the closures, i.e., minimal sets in the underlying equiva...