759 search results - page 5 / 152 » Overlap-Free Regular Languages |
137
click to vote
ICALP
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. Nested words are a restriction of the class of visibly pushdown languages that provide a natural model of runs of programs with recursive procedure calls. The usual conne...
168
click to vote
LATA
2012
Springer
13 years 10 months ago
2012
Springer
The notion of recognition of a language by a finite semigroup can be generalized to recognition by finite groupoids, i.e. sets equipped with a binary operation ‘·’ which is ...
118
click to vote
FUIN
2010
15 years 1 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 “...
145
click to vote
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...
155
click to vote
NC
2010
14 years 9 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...