1052 search results - page 73 / 211 » The Regular Real-Time Languages |
145
click to vote
IJAC
2007
15 years 6 months ago
2007
In this article we show that every group with a finite presentation satisfying one or both of the small cancellation conditions C (1/6) and C (1/4) − T (4) has the property that...
160
click to vote
CP
2006
Springer
15 years 9 months ago
2006
Springer
Abstract. By introducing the Regular Membership Constraint, Gilles Pesant pioneered the idea of basing constraints on formal languages. The paper presented here is highly motivated...
177
click to vote
JMLR
2012
13 years 8 months ago
2012
We develop scalable algorithms for regular and non-negative matrix completion. In particular, we base the methods on trace-norm regularization that induces a low rank predicted ma...
186
click to vote
ICALP
2007
Springer
16 years 6 days ago
2007
Springer
Abstract. We deal with two intimately related subjects: quasi-randomness and regular partitions. The purpose of the concept of quasi-randomness is to measure how much a given graph...
179
click to vote
VLSISP
2008
15 years 6 months ago
2008
In this paper we describe a regular expression pattern matching approach for reconfigurable hardware. Following a Non-deterministic Finite Automata direction, we introduce three ne...