Titlebook: Developments in Language Theory; 28th International C Joel D. Day,Florin Manea Conference proceedings 2024 The Editor(s) (if applicable) an

污穢

,Cyclic Operator Precedence Grammars for?Improved Parallel Parsing, so far much literature on OPLs has assumed the hypothesis that the equality precedence relation cannot be cyclic. We present an enriched version of operator precedence grammars which allows to remove the above hypothesis, therefore providing a little more expressive generality, and to further optimize parallel compilation.

災(zāi)難

,On the?Complexity and?Approximability of?Bounded Access Lempel Ziv Coding,so APX hard, i.e., no PTAS can exist under the standard complexity assumption . We also study the ratio between the sizes of an optimal .-BLZ parsing of a string . and an optimal LZ76 parsing of . (which can be greedily computed in polynomial time).

HAUNT

,Semidirect Product Decompositions for?Periodic Regular Languages,re the relation between the structure of Markov chains and our result, and apply this relation to the theory of probabilities of languages. We also discuss the Krohn-Rhodes decomposition of finite semigroups, which is strongly linked to our methods.

Armory

,Deciding Conjugacy of?a?Rational Relation, generalisation of the classical Lyndon-Schützenberger theorem from word combinatorics that equates conjugacy of a pair of words (.,?.) and the existence of a word . (called a .) such that ...A full version of the paper, with details of the proof, can be found on arXiv [.].

角斗士

craving

武器

The Pumping Lemma for Context-Free Languages is Undecidable,128-140.]. Here we generalize the . by investigating Bar-Hillel’s context-free pumping lemma instead. It turns out that for context-free languages, the . for Bar-Hillel’s pumping lemma is undecidable. When restricted to regular languages, the problem under consideration becomes decidable.

最高點(diǎn)

,Verifying and?Interpreting Neural Networks Using Finite Automata,ow that the input-output behaviour of a DNN can be captured precisely by a (special) weak Büchi automaton and we show how these can be used to address common verification and interpretation tasks of DNN like adversarial robustness or minimum sufficient reasons.

Accolade

Aprope