1052 search results - page 42 / 211 » The Regular Real-Time Languages |
137
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...
118
Voted
AUTOMATICA
2005
15 years 3 months ago
2005
This paper presents an algorithm for robust optimal control of regular languages under specified uncertainty bounds on the event cost parameters of the language measure that has b...
124
Voted
FUIN
2010
15 years 2 months ago
2010
Abstract. A (combinatorial) channel consists of pairs of words representing all possible inputoutput channel situations. In a past paper, we formalized the intuitive concept of “...
150
Voted
ICDT
2012
ACM
13 years 5 months ago
2012
ACM
We consider the problem of repairing unranked trees (e.g., XML documents) satisfying a given restriction specification R (e.g., a DTD) into unranked trees satisfying a given targ...
160
Voted
NC
2010
14 years 10 months ago
2010
Circular splicing has been introduced to model a specific recombinant behaviour of circular DNA, continuing the investigation initiated with linear splicing. In this paper we focu...