4 citations · 7 across the 7 of their papers we have counts for
7 papers
Double-Deck Multi-Agent Pickup and Delivery: Multi-Robot Rearrangement in Large-Scale Warehouses
Baiyu Li, Hang Ma
We introduce a new problem formulation, Double-Deck Multi-Agent Pickup and Delivery (DD-MAPD), which models the multi-robot shelf rearrangement problem in automated warehouses. DD-…
Syntactic Complexity of R- and J-Trivial Regular Languages
Janusz Brzozowski, Baiyu Li
The syntactic complexity of a regular language is the cardinality of its syntactic semigroup. The syntactic complexity of a subclass of the class of regular languages is the maxima…
Syntactic Complexity of Star-Free Languages
Janusz Brzozowski, Baiyu Li
The syntactic complexity of a regular language is the cardinality of its syntactic semigroup. The syntactic complexity of a subclass of regular languages is the maximal syntactic c…
Syntactic Complexity of Prefix-, Suffix-, Bifix-, and Factor-Free Regular Languages
Janusz Brzozowski, Baiyu Li, Yuli Ye
The syntactic complexity of a regular language is the cardinality of its syntactic semigroup. The syntactic complexity of a subclass of the class of regular languages is the maxima…
On the Complexity of the Evaluation of Transient Extensions of Boolean Functions
Janusz Brzozowski, Baiyu Li, Yuli Ye
Transient algebra is a multi-valued algebra for hazard detection in gate circuits. Sequences of alternating 0's and 1's, called transients, represent signal values, and gates are m…
Quotient Complexity of Bifix-, Factor-, and Subword-Free Regular Languages
Janusz Brzozowski, Galina Jirásková, Baiyu Li +1
A language L is prefix-free if, whenever words u and v are in L and u is a prefix of v, then u=v. Suffix-, factor-, and subword-free languages are defined similarly, where "subword…