1000 search results - page 20 / 200 » Nominal rewriting systems |
NAACL
2001
14 years 11 months ago
2001
Using finite-state automata for the text analysis component in a text-to-speech system is problematic in several respects: the rewrite rules from which the automata are compiled a...
LPAR
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. The main goal of this paper is to apply rewriting termination technology —enjoying a quite mature set of termination results and tools— to the problem of proving auto...
FLOPS
2004
Springer
15 years 1 months ago
2004
Springer
Abstract. Outermost-needed rewriting/narrowing is a sound and complete optimal demand-driven strategy for the class of inductively sequential constructor systems. Its parallel exte...
FSTTCS
2010
Springer
14 years 7 months ago
2010
Springer
Uniqueness of normal forms (UN= ) is an important property of term rewrite systems. UN= is decidable for ground (i.e., variable-free) systems and undecidable in general. Recently ...
79
Voted
FCT
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. We introduce a uniform framework for reasoning about infinitestate systems with unbounded control structures and unbounded data domains. Our framework is based on constr...