205 search results - page 30 / 41 » Testing the Equivalence of Regular Languages |
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
Nonparametric methods are widely applicable to statistical learning problems, since they rely on a few modeling assumptions. In this context, the fresh look advocated here permeat...
175
click to vote
ICLP
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. A class of probabilistic-logic models is considered, which increases the expressibility from HMM's and SCFG's regular and contextfree languages to, in principle...
112
click to vote
DLT
2010
14 years 11 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...
110
click to vote
AOSD
2004
ACM
15 years 2 months ago
2004
ACM
We propose a linguistic mechanism for AspectJ-like languages that concisely associates aspect instances to object groups. The mechanism, which supports association aspects, extend...
CAV
2001
Springer
15 years 1 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...