Titlebook: Developments in Language Theory; 13th International C Volker Diekert,Dirk Nowotka Conference proceedings 2009 Springer-Verlag Berlin Heidel

參考書(shū)目

Size Complexity of Two-Way Finite Automataall its early history, and introduce some of the concepts used in its study. We then sketch a possible future, describe a natural systematic way of pursuing it, and record some of the progress that has been achieved. We add little to what is already known—only exposition, terminology, and questions.

吹氣

Matrix Mortality and the ?erny-Pin Conjecture{.,.}.. For the subclass of automata whose transition monoids have the property that each regular -class is a subsemigroup, we give a tight bound on lengths of reset words for synchronizing automata thereby answering a question of Volkov.

會(huì)議

Inertia

Jason Matney,Alex Price,Leith Rankinek such a natural connection with (temporal) logic and related verification algorithms. In this paper, we will identify weighted versions of MSO and CTL that generalize the classical logics and even other quantitative extensions such as probabilistic CTL. We establish expressiveness results on our lo

精美食品

https://doi.org/10.1007/978-3-319-53348-3e Post Correspondence Problem. The presentation is based on the article Halava et al. “Undecidability bounds for integer matrices using Claus instances” (Internat. J. Foundations of Comput. Sci. 18, 2007, 931–948).

鬧劇

Hyponormal Quantization of Planar Domainsall its early history, and introduce some of the concepts used in its study. We then sketch a possible future, describe a natural systematic way of pursuing it, and record some of the progress that has been achieved. We add little to what is already known—only exposition, terminology, and questions.

gnarled

Phosphate Control of PTH Secretion{.,.}.. For the subclass of automata whose transition monoids have the property that each regular -class is a subsemigroup, we give a tight bound on lengths of reset words for synchronizing automata thereby answering a question of Volkov.

archaeology

PTH Assays and Their Clinical Significancerove a quadratic upper bound on the length of a synchronizing word for any synchronized .-state deterministic automaton satisfying the following additional property: there is a letter . such that for any pair of states .,., one has . ·..?=?. ·.. for some integers .,. (for a state . and a word ., we

FRET

PAN

https://doi.org/10.1007/978-3-662-07841-9 word in the monoid defined by a complete string rewrite system. We prove that, if the monoid is cancellative, then our inclusion problem is polynomially reducible to the problem of testing equivalence of straight-line programs in the same monoid. As an application, we obtain a polynomial time algor