This paper studies the precise modeling of various semantics of regular substitution, such as the declarative, finite, greedy, and reluctant replacement, using finite state transducers (FST) as filters. By projecting an FST of regular replacement to its input/output tapes, we are able to solve atomic string constraints, which can be applied to both the forward and backward image computation in ...

Short-cut fusion is a program transformation technique that uses a single, local transformation—called the foldr-build rule—to remove certain intermediate lists from modularly constructed functional programs. Arguments that short-cut fusion is correct typically appeal either to intuition or to “free theorems”—even though the latter have not been known to hold for the languages supporting higher...

Creatine supplementation has been reported to improve certain aspects of cognitive and psychomotor function in older individuals and in young subjects following 24 and 36 h of sleep deprivation. However, the effects of creatine supplementation on cognitive processing and psychomotor performance in non-sleep deprived young adults have not been assessed with a comprehensive battery of neurocognit...

We develop a nonstandard approach to exploring polynomials associated with peaks and runs of permutations. With the aid context-free grammar, or set substitution rules, one can perform symbolic calculus, computation often becomes rather simple. From it follows at once system ordinary differential equations for generating functions. Utilizing certain constant property, is even possible deduce si...

When a design reaches the register transfer level, essential architectural decisions have been taken; their validation required extensive simulation of the abstract behavioral specifications. The recognized need for formal verification cannot be met by current automatic equivalence and model checking tools, which mainly apply to logic synthesis inputs and outputs, or require manual abstraction....

decision-tree algorithms provide one of the most popular methodologies for symbolic knowledge acquisition. the resulting knowledge, a symbolic decision tree along with a simple inference mechanism, has been praised for comprehensibility. the most comprehensible decision trees have been designed for perfect symbolic data. classical crisp decision trees (dt) are widely applied to classification t...