815 search results - page 45 / 163 » Algebraic Recognizability of Languages |
ACL
2010
14 years 10 months ago
2010
As information extraction (IE) becomes more central to enterprise applications, rule-based IE engines have become increasingly important. In this paper, we describe SystemT, a rul...
176
click to vote
TCS
2011
14 years 6 months ago
2011
We consider some Riordan arrays related to binary words avoiding a pattern p, which can be easily studied by means of an A-matrix rather than their A-sequence. Both concepts allow...
FOSSACS
2006
Springer
15 years 3 months ago
2006
Springer
Reversible computation has a growing number of promising application areas such as the modelling of biochemical systems, program debugging and testing, and even programming languag...
LICS
2009
IEEE
15 years 6 months ago
2009
IEEE
Several dynamical systems, such as deterministic automata and labelled transition systems, can be described as coalgebras of so-called Kripke polynomial functors, built up from co...
LICS
2007
IEEE
15 years 6 months ago
2007
IEEE
A k-edge operation ϕ on a finite set A is a k + 1-ary operation that satisfies the identities ϕ(x, x, y, . . . , y) ≈ ϕ(x, y, x, y, . . . , y) ≈ y and ϕ(y, y, y, x, y, ....