67 search results - page 11 / 14 » A Domain-Specific Language for Regular Sets of Strings and T... |
PLANX
2007
13 years 8 months ago
2007
Although monadic second-order logic (MSO) has been a foundation of XML queries, little work has attempted to take MSO formulae themselves as a programming construct. Indeed, MSO f...
MCU
1998
13 years 8 months ago
1998
The paper extends some of the most recently obtained results on the computational universality of speci c variants of H systems (e.g. with regular sets of rules) and proves that we...
CAV
1999
Springer
13 years 11 months ago
1999
Springer
BDDs and their algorithms implement a decision procedure for Quanti ed Propositional Logic. BDDs are a kind of acyclic automata. Unrestricted automata (recognizing unbounded string...
CAV
2001
Springer
13 years 12 months ago
2001
Springer
Regular languages have proved useful for the symbolic state exploration of infinite state systems. They can be used to represent infinite sets of system configurations; the tran...
ACL
2000
13 years 8 months ago
2000
This paper presents a corpus-based algorithm capable of inducing inflectional morphological analyses of both regular and highly irregular forms (such as broughtbring) from distrib...