Titlebook: Developments in Language Theory; 18th International C Arseny M. Shur,Mikhail V. Volkov Conference proceedings 2014 Springer International P

GIBE

GULP

Semisimple Synchronizing Automata and the Wedderburn-Artin Theoryural notion of semisimple synchronizing automata. This is a rather broad class since it contains simple synchronizing automata like those in ?erny’s series. Furthermore, semisimplicity gives the advantage of “factorizing” the problem of finding a synchronizing word into the sub-problems of finding w

把手

On Two Algorithmic Problems about Synchronizing Automata problem is to decide whether a given reachable partial automaton is synchronizing. The second one is, given an .-state binary complete synchronizing automaton, to compute its reset threshold within performance ratio less than . ln (.) for a specific constant .?>?0.

Infusion

Synchronizing Automata with Random Inputsynchronization is exponential in the number of states. At the same time, we show that the expected number of letters to synchronize any pair of the famous ?erny automata is at most cubic in the number of states.

固定某物

osculate

負(fù)擔(dān)

評論性

deficiency

Visibly Pushdown Transducers with Well-Nested Outputsrds, i.e. words with a call/return structure. When outputs are also structured and well nested words, .s are a natural formalism to express tree transformations evaluated in streaming. We prove the class of .s with well-nested outputs to be decidable in .. Moreover, we show that this class is closed