Titlebook: Implementation and Application of Automata; 28th International C Szilárd Zsolt Fazekas Conference proceedings 2024 The Editor(s) (if applic

deforestation

A精确的

Constructing a BPE Tokenization DFAm for the efficient construction of deterministic finite automata (DFA) designed to operate directly on tokenizations produced by the popular byte pair encoding (BPE) technique. This makes it possible to apply many existing techniques and algorithms to the tokenized case, such as pattern matching, e

孵卵器

Subdue

修改

On Bidirectional Deterministic Finite Automatacal results for bidirectional automata. We show that there exist regular languages, where minimal biDFA models are exponentially smaller than minimal DFA models. We show this for a language that has a structure common to software logs. This makes biDFA especially interesting when inferring models fr

的染料

一条卷发

宠爱

航海太平洋

Global One-Counter Tree Automatarough the tree in lexicographical order, rather than duplicating the counter at every branching position. We compare the capabilities of GOCTA to those of counter tree automata and obtain that their classes of recognizable tree languages are incomparable. Moreover, we show that the emptiness problem

tympanometry

Decision Problems for Subregular Classese in a given subclass of regular languages. We prove .-completeness of this problem on both automata models for the classes of comma-free codes, solid codes, and singleton languages. For the classes of combinational, finitely generated left ideal, star, comet, group, and co-finite languages, the mem