Titlebook: Descriptional Complexity of Formal Systems; 15th International W Helmut Jurgensen,Rogério Reis Conference proceedings 2013 Springer-Verlag

可耕种

mighty

Tempor

Erythropoietin

改革运动

Invertible Transductions and Iteration,We study iterated transductions, where the basic transductions are given by a class of length-preserving invertible transducers over the binary alphabet. It is shown that in some cases the resulting orbit relation is rational and we determine the complexity of several natural computational problems associated with the iterated transductions.

小画像

格子架

加强防卫

Shortest Repetition-Free Words Accepted by Automata,We consider the following problem: given that a finite automaton . of . states accepts at least one .-power-free (resp., overlap-free) word, what is the length of the shortest such word accepted? We give upper and lower bounds which, unfortunately, are widely separated.

FELON

Foment

Fifty Years of Cytochrome P450 Researchjections . are accepted by nondeterministic finite automata of size polynomial in .. Therefore, proving super-polynomial lower bounds for . reduces to proving super-polynomial lower bounds for . i.e. nondeterministic finite automata.