Titlebook: Implementation and Application of Automata; 27th International C Benedek Nagy Conference proceedings 2023 The Editor(s) (if applicable) and

鞠躬

Operational Complexity in Subregular Classesstar and symmetric definite languages, respectively. We also show that the complexity of reversal on ordered and power-separating languages is ., which proves that the lower bound for star-free languages given by [Brzozowski, Liu, Int. J. Found. Comput. Sci. 23, 1261–1276, 2012] is tight. In all the

绑架

intrude

employor

Sabine Broda,António Machiavelo,Nelma Moreira,Rogério Reis

擦掉

A Survey on Automata with Translucent Letterseach of these types of automata with translucent letters, it has been shown that they accept those trace languages which are obtained from the class of languages that is accepted by the corresponding type of automaton without translucent letters.

显示

Constrained Multi-Tildessjunctive combinations to any Boolean combination, allowing us to exponentially enhance the factorization power of tildes expressions. Moreover, we show how to convert these expressions into finite automata and give a Haskell implementation of them using advanced techniques of functional programming.

CLAN

Average Complexity of Partial Derivatives for Synchronised Shuffle Expressionsrily synchronised shuffles. The new results extend and improve the ones previously obtained for regular expressions with shuffle and intersection. For intersection, asymptotically the average state complexity of the partial derivative automaton is 3, which significantly improves the known exponential upper-bound.

Left-Atrium

可商量

-equivalence of Parikh Matrix over a Ternary Alphabetty for a ternary alphabet. Our rules build on the principles of the palindromicly amicable relation and enable tracking of the differences of length-3 ordered scattered-factors. We characterize the set of .-unambiguous words and obtain a regular expression for the set.

glisten

Sweep Complexity Revisitedautomaton does not distinguish between accepting regular and non-regular languages. We establish separation results for asymptotic classes defined by this complexity measure and give a surprising exponential/logarithmic relation between factors of certain inputs which can be verified by such machines.