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

旧病复发

Principles of Hypospadias Surgeryis .-hard [Theoret. Comput. Sci. . (2009) 968–972]. Building on their work, we analyze in this paper the complexity of natural variations on the problem. While some of them are .-hard, others are shown to be efficiently decidable. Using some combinatorial properties of de Bruijn graphs, we establish

Evocative

Gerald R. Cunha,Laurence Baskinclosure and complement to a given set. We re-examine this theorem in the setting of formal languages, where closure is either Kleene closure or positive closure. We classify languages according to the structure of the algebra they generate under iterations of complement and closure. There are precis

tangle

figure

A精确的

Thyrotropin and Thyroid Hormonesment, denoted here as .(.). Thus, any expression consisting of repetitions of . and .(.) can be considered in some sense periodic. In this paper we give a generalization of Lyndon and Schützenberger’s classical result about equations of the form .. = ...., to cases where both sides involve repetitio

xanthelasma

青少年

Somatostatin and the Endocrine Pancreas is regular or not. The problem was originally posed by Calbrix and Nivat in 1995. Partial solutions have been given by Cachat for unary languages and by Horváth et al. for various kinds of exponent sets for the powers and regular languages which have primitive roots satisfying certain properties. W

排他

DEMUR

Tartar

Weighted versus Probabilistic Logicsk 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