555 search results - page 21 / 111 » Complexity of Operations on Cofinite Languages |
158
Voted
HAPTICS
2002
IEEE
15 years 8 months ago
2002
IEEE
We present the results of using Hidden Markov Models (HMMs) for automatic segmentation and recognition of user motions. Previous work on recognition of user intent with man/machin...
136
Voted
HASE
2008
IEEE
15 years 10 months ago
2008
IEEE
Implementing real-time critical systems is an increasingly complex process that calls for high-level formal programming languages. Existing languages mainly focus on mono-periodic...
125
Voted
PODS
2010
ACM
15 years 8 months ago
2010
ACM
XML Schema Definitions (XSDs) can be adequately abstracted by the single-type regular tree languages. It is wellknown, that these form a strict subclass of the robust class of re...
138
Voted
ICGI
2010
Springer
15 years 4 months ago
2010
Springer
In this work, we give an algorithm that infers Regular Trace Languages. Trace languages can be seen as regular languages that are closed under a partial commutation relation called...
160
Voted
USENIX
2000
15 years 5 months ago
2000
Traditional file system development is difficult. Stackable file systems promise to ease the development of file systems by offering a mechanism for incremental development. Unfor...