Sciweavers

306 search results - page 1 / 62
» Underspecified computation of normal forms
Sort
View
98
Voted
RTA
2010
Springer
15 years 2 months ago
Underspecified computation of normal forms
We consider the problem of computing, out of a set C of trees and a rewrite system R, those trees in C that cannot be rewritten into a tree in C. We solve this problem for sets of ...
Alexander Koller, Stefan Thater
ACL
2004
15 years 2 months ago
Minimal Recursion Semantics as Dominance Constraints: Translation, Evaluation, and Analysis
We show that a practical translation of MRS descriptions into normal dominance constraints is feasible. We start from a recent theoretical translation and verify its assumptions o...
Ruth Fuchss, Alexander Koller, Joachim Niehren, St...
105
Voted
ECCC
2000
81views more  ECCC 2000»
15 years 28 days ago
A Linear Space Algorithm for Computing the Hermite Normal Form
Computing the Hermite Normal Form of an n
Daniele Micciancio, Bogdan Warinschi
110
Voted
CORR
2002
Springer
123views Education» more  CORR 2002»
15 years 28 days ago
Ideal decompositions and computation of tensor normal forms
Abstract. Symmetry properties of r-times covariant tensors T can be described by certain linear subspaces W of the group ring K[Sr] of a symmetric group Sr. If for a class of tenso...
Bernd Fiedler
103
Voted
STACS
1998
Springer
15 years 5 months ago
Local Normal Forms for First-Order Logic with Applications to Games and Automata
Thomas Schwentick, Klaus Barthelmann