730 search results - page 23 / 146 » Combinatorics of Monotone Computations |
COMBINATORICS
2007
13 years 8 months ago
2007
We define an excedance number for the multi-colored permutation group i.e. the wreath product (Zr1 × · · · × Zrk ) Sn and calculate its multi-distribution with some natural ...
COMBINATORICS
2007
13 years 8 months ago
2007
For a permutation π = π1π2 · · · πn ∈ Sn and a positive integer i ≤ n, we can view π1π2 · · · πi as an element of Si by order-preserving relabeling. The j-set of ...
ACL
2009
13 years 6 months ago
2009
This paper describes an incremental parser based on an adjoining operation. By using the operation, we can avoid the problem of infinite local ambiguity in incremental parsing. Th...
LOGCOM
2008
13 years 8 months ago
2008
In an earlier work [Abdulla et al. (2000, Information and Computation, 160, 109
RTA
1993
Springer
14 years 22 days ago
1993
Springer
Usually termination of term rewriting systems TRS's is proved by means of a monotonic well-founded order. If this order is total on ground terms, the TRS is called totally ...