762 search results - page 25 / 153 » Intercode Regular Languages |
DLT
2008
13 years 8 months ago
2008
Abstract. Since recognizable tree languages are closed under the rational operations, every regular tree expression denotes a recognizable tree language. We provide an alternative ...
DBPL
2009
Springer
14 years 2 months ago
2009
Springer
IFL
2007
Springer
14 years 1 months ago
2007
Springer
VLDB
1990
ACM
13 years 11 months ago
1990
ACM
In previous papers we have proposed a graphical query language for expressing traversal recursions in labelled, directed graphs. A fundamental feature of the language is the use o...
LATIN
2010
Springer
13 years 9 months ago
2010
Springer
We study the worst case complexity of regular operations on cofinite languages (i.e., languages whose complement is finite) and provide algorithms to compute efficiently the result...