Titlebook: Descriptional Complexity of Formal Systems; 25th IFIP WG 1.02 In Henning Bordihn,Nicholas Tran,György Vaszil Conference proceedings 2023 IF

FOR

,Shortest Accepted Strings for Two-Way Finite Automata: Approaching the , Lower Bound,s paper, a family of .-state automata with shortest accepted strings of length . is constructed, thus improving the lower bound. For the special case of direction-determinate automata (those that always remember in the current state whether the last move was to the left or to the right), the maximum

annexation

conservative

,Merging Two Hierarchies of External Contextual Grammars with Subregular Selection,es. In the past, two independent hierarchies have been obtained for external and internal contextual grammars, one based on selection languages defined by structural properties (finite, monoidal, nilpotent, combinational, definite, ordered, non-counting, power-separating, suffix-closed, commutative,

消息灵通

,A Tight Upper Bound on the Length of Maximal Bordered Box Repetition-Free Words,ength of a bordered box repetition-free word is at most ., with ., where . denotes the size of the alphabet. An alternative approach is given to prove that .(.) is an upper bound, which enables a proof that this upper bound is tight.

常到

,Pushdown and One-Counter Automata: Constant and Non-constant Memory Usage, counter grows at least as a logarithmic function. This bound can be reached. This is in contrast with the case of pushdown automata in which the optimal bound is double logarithmic. For the . and . measures these bounds are shown to be linear, for both pushdown and one-counter automata.

后来

财产

来自于

,Shortest Accepted Strings for Two-Way Finite Automata: Approaching the , Lower Bound,of direction-determinate automata (those that always remember in the current state whether the last move was to the left or to the right), the maximum length of the shortest accepted string is determined precisely as ..

TERRA

Conference proceedings 2023iewed and selected from 16 submissions. The conference focus on all aspects of descriptional complexity, including automata, grammars, languages, and other formal systems; various modes of operations and complexity measures..

MURKY