Titlebook: Developments in Language Theory; 23rd International C Piotrek Hofman,Michał Skrzypczak Conference proceedings 2019 Springer Nature Switzerl

Mercurial

Indications for Oophorectomy and Adnexectomy on the length of shortest words of minimum rank in automata from the mentioned classes, and provide several families of automata with long words of minimum rank. Some results in this direction are also obtained for automata with rank equal to period (the greatest common divisor of lengths of all cycles) and for circular automata.

Conduit

Hysteresis Phenomena in Biologytates, which improves the known upper bound. We have obtained also a lower bound, namely, at least . states are required. If the measure of edit distance includes also the operation of rewriting one symbol with another, the edit distance .-neighborhood can be recognized with . pushdown symbols and . states.

监禁

RLS898

Inherent Size Blowup in ,-Automata reasons for the classic acceptance conditions, while there is also place for additional acceptance conditions, especially in the deterministic setting; Boolean operations on deterministic automata with the classic acceptance conditions involve an exponential size blowup, which can be avoided by usi

Glucose

治愈

Single-Stranded Architectures for Computingte DNA (transcription), it folds upon itself into intricate higher-dimensional structures in such a way that the free energy is minimized, that is, the more hydrogen bonds between ribonucletoides or larger entropy a structure has, the more likely it is chosen, and furthermore the minimization is don

Conserve

A Linear Bound on the K-Rendezvous Time for Primitive Sets of NZ Matricesrelating synchronizing automata and primitive sets, we study the length of the shortest product of a primitive set having a column or a row with . positive entries (the .-RT). We prove that this value is at most linear w.r.t. the matrix size . for small ., while the problem is still open for synchro

策略

Words of Minimum Rank in Deterministic Finite Automatay the length of shortest words of minimum rank in several classes of complete deterministic finite automata, namely, strongly connected and Eulerian automata. A conjecture bounding this length is known as the Rank Conjecture, a generalization of the well known Černý Conjecture. We prove upper bounds

Debark

On the Length of Shortest Strings Accepted by Two-Way Finite Automata the maximum of these lengths over all .-state automata. It is proved that for .-state two-way finite automata, whether deterministic or nondeterministic, this number is at least . and less than ., with the lower bound reached over an alphabet of size .. Furthermore, for deterministic automata and f

Favorable