762 search results - page 97 / 153 » Intercode Regular Languages |
107
click to vote
LICS
2009
IEEE
15 years 9 months ago
2009
IEEE
Several dynamical systems, such as deterministic automata and labelled transition systems, can be described as coalgebras of so-called Kripke polynomial functors, built up from co...
110
click to vote
CPAIOR
2009
Springer
15 years 9 months ago
2009
Springer
An attractive mechanism to specify global constraints in rostering and other domains is via formal languages. For instance, the REGULAR and GRAMMAR constraints specify constraints ...
138
Voted
FQAS
2009
Springer
15 years 9 months ago
2009
Springer
We consider the problem of finding and ranking paths in semistructured data without necessarily knowing its full structure. The query language we adopt comprises conjunctions of r...
ECOOP
2005
Springer
15 years 8 months ago
2005
Springer
Most modern programming systems such as Java allow us to link independently developed components together dynamically. This makes it possible to develop and deploy software on a pe...
108
Voted
FCT
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. We investigate bottom-up and top-down deterministic automata on unranked trees. We show that for an appropriate definition of bottom-up deterministic automata it is poss...