278 search results - page 38 / 56 » Enumerating Regular Expressions and Their Languages |
MFCS
1998
Springer
15 years 1 months ago
1998
Springer
Recently the class of BPA (or context-free) processes has been intensively studied and bisimilarity and regularity appeared to be decidable (see [CHS95, BCS95, BCS96]). We extend t...
71
Voted
PEPM
2007
ACM
15 years 3 months ago
2007
ACM
XQuery is a powerful functional language to query XML data. This paper presents a bidirectional interpretation of XQuery to address the problem of updating XML data through materi...
AI
2002
Springer
14 years 9 months ago
2002
Springer
Combinatorial auctions, that is, auctions where bidders can bid on combinations of items, tend to lead to more efficient allocations than traditional auction mechanisms in multi-i...
70
Voted
TACS
2001
Springer
15 years 1 months ago
2001
Springer
Decidability of non-structural subtype entailment is a long standing open problem in programming language theory. In this paper, we apply automata theoretic methods to characterize...
84
Voted
NAACL
2010
14 years 7 months ago
2010
Synchronous tree substitution grammars are a translation model that is used in syntax-based machine translation. They are investigated in a formal setting and compared to a compet...