3653 search results - page 286 / 731 » On Recognizable Timed Languages |
196
click to vote
AAAI
1998
15 years 8 months ago
1998
qYaditionally, constraint satisfaction problems(CSPs) are characterized using a finite set of constraints expressed within a common,shared constraint language. Whenreasoning acros...
189
click to vote
ENGL
2008
15 years 7 months ago
2008
With the advent of System-On-Chip (SOC) technology, there is a pressing need to enhance the quality of ools available and increase the level of abstraction at which hardware is des...
193
click to vote
CORR
2007
Springer
15 years 7 months ago
2007
Springer
This article describes an exclusively resource-based method of morphological annotation of written Korean text. Korean is an agglutinative language. Our annotator is designed to p...
226
click to vote
JCSS
2007
15 years 7 months ago
2007
Automata for unranked trees form a foundation for XML schemas, querying and pattern languages. We study the problem of efficiently minimizing such automata. First, we study unrank...
195
click to vote
TSE
2002
15 years 7 months ago
2002
In this paper, we propose a means to enhance an architecture description language with a description of component behavior. A notation used for this purpose should be able to expr...