Titlebook: Implementation and Application of Automata; 22nd International C Arnaud Carayol,Cyril Nicaud Conference proceedings 2017 Springer Internati

exclusice

Stamina: Stabilisation Monoids in Automata Theory,al number of nested Kleene stars needed for expressing the language with a complement-free regular expression. Second, decide limitedness for regular cost functions. Third, decide whether a probabilistic leaktight automaton has value 1, i.e. whether a probabilistic leaktight automaton accepts words

令人苦惱

Gustatory

Alignment Distance of Regular Tree Languages,edit-distance, in which we construct an optimal alignment between two trees and compute its cost instead of directly computing the minimum cost of tree edits. The alignment distance is crucial for understanding the structural similarity between trees..We, in particular, consider the following proble

為寵愛

Nondeterministic Complexity of Operations on Free and Convex Languages,egular languages. For the operations of intersection, union, concatenation, square, star, reversal, and complementation, we get the tight upper bounds for all considered classes except for complementation on factor- and subword-convex languages. Most of our witnesses are described over optimal alpha

incarcerate

侵略

hermitage

On the Conjecture ,,ages that has been recently introduced and that admits interesting properties. This is the first step to prove the conjecture ., which says that for any fixed integer . all the languages recognized by one-way deterministic 1-reversal bounded .-counter machines are in .. We recall that this conjectur

VEN

Synchronization Problems in Automata Without Non-trivial Cycles,c automata. We provide upper and lower bounds on the length of a shortest word synchronizing a weakly acyclic automaton or, more generally, a subset of its states, and show that the problem of approximating this length is hard. We also show inapproximability of the problem of computing the rank of a

使顯得不重要

Defiance