Titlebook: Developments in Language Theory; 19th International C Igor Potapov Conference proceedings 2015 Springer International Publishing Switzerlan

紧张过度

Custodian

Hypoxia and Breast Cancer Metastasisons of nonempty words. These formulae concern return words and bifix codes. They generalize formulae previously known for Sturmian sets or more generally for tree sets. We also give a geometric example of this class of sets, namely the natural coding of some interval exchange transformations.

斗争

Alopecia-Areata

Neuropeptides

https://doi.org/10.1007/978-4-431-53961-2This paper gives a survey on recent progress in grammar-based compression for trees. Also algorithms that directly work on grammar-compressed trees will be surveyed.

追逐

Hypothesis-Driven Simulation StudiesWe prove that it is NP-complete to decide whether a given string can be factored into palindromes that are each unique in the factorization.

垫子

改正

Diverse Palindromic Factorization Is NP-complete,We prove that it is NP-complete to decide whether a given string can be factored into palindromes that are each unique in the factorization.

nullify

Hirsutism

Hypothermia for Acute Brain Damageomes with a standard notion of an algebra, called an Eilenberg-Moore algebra, which generalises algebras studied in language theory like semigroups or .-semigroups. On the abstract level of monads one can prove theorems like the Myhill-Nerode theorem, the Eilenberg theorem; one can also define profinite objects.