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

支柱

A Quadratic Upper Bound on the Size of a Synchronizing Word in One-Cluster Automatadenote by . ·. the state reached from . by the path labeled .). As a consequence, we show that for any finite synchronized prefix code with an .-state decoder, there is a synchronizing word of length .(..). This applies in particular to Huffman codes.

Brain-Imaging

Strongly Regular Grammars and Regular Approximation of Context-Free Languagesar. In another direction, the generalization by a 1–lookahead extends Mohri and Nederhof’s transformation by incorporating more context into the regular approximation at the expense of a larger grammar.

EWER

calumniate

Weighted versus Probabilistic LogicsL that generalize the classical logics and even other quantitative extensions such as probabilistic CTL. We establish expressiveness results on our logics giving translations from weighted and probabilistic CTL into weighted MSO.

CRATE

albuminuria

喊叫

Powers of Regular Languages by Horváth et al. for various kinds of exponent sets for the powers and regular languages which have primitive roots satisfying certain properties. We show that the regular languages which have a regular power are the ones which are ’almost’ equal to their Kleene-closure.

平息

PTH Assays and Their Clinical Significancedenote by . ·. the state reached from . by the path labeled .). As a consequence, we show that for any finite synchronized prefix code with an .-state decoder, there is a synchronizing word of length .(..). This applies in particular to Huffman codes.

切割

Hypothalamus and Endocrine Functionsar. In another direction, the generalization by a 1–lookahead extends Mohri and Nederhof’s transformation by incorporating more context into the regular approximation at the expense of a larger grammar.

Eclampsia

Joseph Meites,H. H. Huang,G. D. Riegleu (. 50, 1994). Since the problem of whether a pattern is descriptive depends on the inclusion relation of so-called pattern languages, our technical considerations lead to a number of deep insights into the inclusion problem for and the topology of the class of terminal-free E-pattern languages.