59 search results - page 12 / 12 » Shorter Regular Expressions from Finite-State Automata |
ITICSE
2004
ACM
14 years 7 days ago
2004
ACM
The use of generic and generative methods for the development and application of interactive educational software is a relatively unexplored area in industry and education. Advant...
IANDC
2011
13 years 1 months ago
2011
We present a systematic way to generate (1) languages of (generalised) regular expressions, and (2) sound and complete axiomatizations thereof, for a wide variety of quantitative ...
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...
DLT
2010
13 years 8 months ago
2010
It is known that the languages definable by formulae of the logics FO2[<,S], 2[<,S], LTL[F,P,X,Y] are exactly the variety DAD. Automata for this class are not known, nor is i...