Multi-Sequential Word Relations

Multi-sequential Word Relations

Rational relations are binary relations of finite words that are realised by non-deterministic finite state transducers (NFT). A particular kind of rational relations is the sequential functions. Sequential functions are the functions that can be realised by input-deterministic transducers. Some rational functions are not sequential. However, based on a property on transducers called the twinni...

Relations Among Parallel and Sequential Computation Models

This paper relates uniform small-depth circuit families as a parallel computation model with the complexity of polynomial time Turing machines. Among the consequences we obtain are: (a) a collapse of two circuit classes is equivalent to a relativizable collapse of the two corresponding polynomial time classes; and (b) a collapse of uniformity conditions for small depth circuits is equivalent to...

Nets, Sequential Components and Concurrency Relations

A lattice of unmarked nets is introduced and studied. It is proved that unmarked nets representing the static structure of sequential systems are atoms of that lattice. Marking classes defined by the decomposition of nets into sequential components are introduced and proper:+zs (safeness, fireability, etc.) of nets with those marking classes are investigated. The notion of concurrent>’ relation...

State-Logic Relations for Autonomous Sequential Networks

Multi-channel Sequential Structure

We argue for the benefit of designing deep generative models through a mixedinitiative, co-creative combination of deep learning algorithms and human specifications, focusing on multi-channel music composition. Sequence models have shown convincing results in domains such as summarization and translation; however, longer-term structure remains a major challenge. Given lengthy inputs and outputs...