Sciweavers

1149 search results - page 8 / 230
» What Are Iteration Theories
Sort
View
ATVA
2010
Springer
128views Hardware» more  ATVA 2010»
13 years 8 months ago
What's Decidable about Sequences?
Abstract. We present a first-order theory of (finite) sequences with integer elements, Presburger arithmetic, and regularity constraints, which can model significant properties of ...
Carlo A. Furia
HT
2005
ACM
14 years 1 months ago
What the geeks know: hypertext and the problem of literacy
Recent theories of hypertext usefully emphasize continuity with earlier media; but in the general social environment, this continuity is not well understood, and may even be oppos...
Stuart Moulthrop
NAACL
2004
13 years 8 months ago
What's in a translation rule?
We propose a theory that gives formal semantics to word-level alignments defined over parallel corpora. We use our theory to introduce a linear algorithm that can be used to deriv...
Michel Galley, Mark Hopkins, Kevin Knight, Daniel ...
ENTCS
2011
131views more  ENTCS 2011»
13 years 2 months ago
Computational Complexity in Non-Turing Models of Computation: The What, the Why and the How
We preliminarily recap what is meant by complexity and non-Turing computation, by way of explanation of our title, ‘Computational Complexity in Non-Turing Models of Computationâ...
Ed Blakey
IANDC
2010
107views more  IANDC 2010»
13 years 4 months ago
Equational properties of iterative monads
Iterative monads of Calvin Elgot were introduced to treat the semantics of recursive equations purely algebraically. They are Lawvere theories with the property that all ideal sys...
Jirí Adámek, Stefan Milius, Jiri Vel...