Sciweavers

2465 search results - page 92 / 493
» Automata on Linear Orderings
Sort
View
DAM
2011
13 years 4 months ago
On minimal Sturmian partial words
Partial words, which are sequences that may have some undefined positions called holes, can be viewed as sequences over an extended alphabet A = A ∪ { }, where stands for a hol...
Francine Blanchet-Sadri, John Lensmire
ACL
1992
13 years 10 months ago
Handling Linear Precedence Constraints by Unification
Linear precedence (LP) rules are widely used for stating word order principles. They have been adopted as constraints by HPSG but no encoding in the formalism has been provided. S...
Judith Engelkamp, Gregor Erbach, Hans Uszkoreit
CC
2003
Springer
250views System Software» more  CC 2003»
14 years 2 months ago
Automatic Detection of Uninitialized Variables
vel Meta-Reasoning with Higher-Order Abstract Syntax Alberto Momigliano, Simon Ambler. A Normalisation Result for Higher-Order Calculi with Explicit Substitutions Eduardo Bonelli. ...
Thi Viet Nga Nguyen, François Irigoin, Cori...
TIME
2009
IEEE
14 years 3 months ago
Axiomatizations for Temporal Epistemic Logic with Perfect Recall over Linear Time
—This paper presents various semantic interpretations for logics of knowledge and time with prefect recall. We allow both past and future operators and examine the interpretation...
Szabolcs Mikulás, Mark Reynolds, Tim French
TIT
2010
107views Education» more  TIT 2010»
13 years 3 months ago
On the optimum distance profiles about linear block codes
In this paper, for some linear block codes, two kinds of optimum distance profiles (ODPs) are introduced to consider how to construct and then exclude (or include) the basis codewo...
Yuan Luo, A. J. Han Vinck, Yanling Chen