Titlebook: Developments in Language Theory; 27th International C Frank Drewes,Mikhail Volkov Conference proceedings 2023 The Editor(s) (if applicable)

neologism

,On the?Simon’s Congruence Neighborhood of?Languages,ost .. We extend Simon’s congruence to languages. First, we define the Simon’s congruence neighborhood of a language?. to be a set of strings that have a .-congruent string in .. Next, we define two languages?. and . to be .-congruent if both have the same Simon’s congruence neighborhood. We prove t

有說服力

Tree-Walking-Storage Automata,ized stack automata, where the linear stack storage is replaced by a non-linear tree-like stack. Therefore, tree-walking-storage automata have the ability to explore the interior of the tree storage without altering the contents, where the possible moves of the tree pointer correspond to those of tr

Liberate

吃掉

有害處

,Languages Generated by?Conjunctive Query Fragments of?FC[REG], conjunctive query fragments, . and .. We compare the expressive power of . to that of various related language generators, such as regular expressions, patterns, and typed patterns. We then consider decision problems for . and ., and show that certain static analysis problems (such as equivalence a

改變

Forehead-Lift

overbearing

CLOT

,On the?Simon’s Congruence Neighborhood of?Languages,hat it is .-complete to check .-congruence of two regular languages and decidable up to recursive languages. Moreover, we tackle the problem of computing the maximum . that makes two given languages .-congruent. This problem is .-complete for two regular languages, and undecidable for context-free languages.

我沒有強(qiáng)迫

,Approaching Repetition Thresholds via?Local Resampling and?Entropy Compression,pected from a purely information-theoretic considerations. In the second part, we present experimental results obtained by the mentioned algorithm in the extreme case of .-ary words avoiding .-powers.