478 search results - page 33 / 96 » Monads of Regular Theories |
115
click to vote
LICS
2012
IEEE
13 years 1 months ago
2012
IEEE
—We show how to reliably compute fast-growing functions with timed-arc Petri nets and data nets. This construction provides ordinal-recursive lower bounds on the complexity of th...
ISPD
2003
ACM
15 years 4 months ago
2003
ACM
In this paper we present the Gain-based Logic Block Array (GLA), a new via-programmable regular fabric. GLA is an array of Gainbased Logic Blocks (GLBs). The GLB is a semi-univers...
FSTTCS
2001
Springer
15 years 3 months ago
2001
Springer
Abstract. Regular Model-Checking (RMC) is a technique for the formal verification of infinite state systems based on the theory of regular languages. In the paper “Beyond Regul...
NIPS
2000
15 years 9 days ago
2000
In theory, the Winnow multiplicative update has certain advantages over the Perceptron additive update when there are many irrelevant attributes. Recently, there has been much eff...
LATA
2010
Springer
15 years 8 months ago
2010
Springer
This paper presents a new polynomial-time algorithm for the inclusion problem for certain pairs of regular expressions. The algorithm is not based on construction of finite automat...