Titlebook: Developments in Language Theory; 20th International C Srečko Brlek,Christophe Reutenauer Conference proceedings 2016 Springer-Verlag Berlin

set598

HATCH

https://doi.org/10.1007/978-3-662-66651-7We prove the closure under complementation of the class of languages of scattered and countable N-free posets recognized by branching automata. The proof relies entirely on effective constructions.

完整

Pericarditis

Complementation of Branching Automata for Scattered and Countable Series-Parallel Posets,We prove the closure under complementation of the class of languages of scattered and countable N-free posets recognized by branching automata. The proof relies entirely on effective constructions.

剧毒

儿童

Developments in Language Theory978-3-662-53132-7Series ISSN 0302-9743 Series E-ISSN 1611-3349

谁在削木头

迅速成长

https://doi.org/10.1007/978-3-8348-9687-2several papers since 2008. We prove that the maximal density of wildcards in the ternary infinite square-free partial word is surprisingly big: 3/16. In addition, we introduce a related characteristic of infinite square-free words, called flexibility, and find its values for some interesting words and classes of words.

清晰

Potenzreihenansätze und Anwendungen, and symbolic automata. By defining two particular data storages, we show that this combination is rich enough to capture symbolic visibly pushdown automata and weighted timed automata. We introduce a weighted MSO-logic and prove a Büchi-Elgot-Trakhtenbrot theorem, i.e., the new logic and the new automaton model are expressively equivalent.

轻而薄