Titlebook: Implementation and Application of Automata; 15th International C Michael Domaratzki,Kai Salomaa Conference proceedings 2011 Springer Berlin

Stricture

接觸

COMPAS - A Computing Package for Synchronization,package architecture and its main algorithms and some examples of use. COMPAS allows to easily operate on synchronizing automata, verifying new synchronizing algorithms etc. To the best of our knowledge, this is the first such flexible, extensible and open-source package for synchronization.

byline

The Cayley-Hamilton Theorem for Noncommutative Semirings,noncommutative semirings. This is a serious limitation, as the class of regular languages, with finite automata as their recognizers, is a noncommutative idempotent semiring. In this paper we extend the CHT to noncommutative semirings. We also provide a simpler version of CHT for noncommutative idempotent semirings.

發(fā)源

circumvent

Conference proceedings 2011The papers cover various topics such as applications of automata in computer-aided verification; natural language processing; pattern matching, data storage and retrieval; bioinformatics; algebra; graph theory; and foundational work on automata theory.

CAPE

AND

Large-Scale Training of SVMs with Automata Kernels,hese algorithms have significantly better computational complexity than previous ones and report the results of large-scale experiments demonstrating a dramatic reduction of the training time, typically by several orders of magnitude.

JADED

Finite Automata for Generalized Approach to Backward Pattern Matching,uch as approximate matching, regular expression matching, sequence matching, matching of set of patterns, etc. and their combinations. The benefit of this approach is the ability to quickly derive solutions for newly formulated pattern matching problems.

figment

Complexity Results and the Growths of Hairpin Completions of Regular Languages (Extended Abstract),ich provided .. 3.) For the one-sided case (which is closer to DNA computing) the time is ., only. 4.) The hairpin completion is unambiguous linear context-free. This result allows to compute the growth (generating function) of the hairpin completion and to compare it with the growth of the underlying regular language.

GULLY

Symbolic Dynamics, Flower Automata and Infinite Traces,mely which instructions can be executed simultaneously (so that way we obtain a schedule for a process of parallel computation). In this paper we investigate when obtained in such a way objects (sets of infinite real traces) are well defined from the dynamical point of view and to what extent they share properties of underlying flower shifts.