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

aspirant

书目名称Implementation and Application of Automata影响因子(影响力)




书目名称Implementation and Application of Automata影响因子(影响力)学科排名




书目名称Implementation and Application of Automata网络公开度




书目名称Implementation and Application of Automata网络公开度学科排名




书目名称Implementation and Application of Automata被引频次




书目名称Implementation and Application of Automata被引频次学科排名




书目名称Implementation and Application of Automata年度引用




书目名称Implementation and Application of Automata年度引用学科排名




书目名称Implementation and Application of Automata读者反馈




书目名称Implementation and Application of Automata读者反馈学科排名

Concrete

escalate

Large-Scale Training of SVMs with Automata Kernels,achines used with sequence kernels that is purely based on weighted automata and transducer algorithms, without requiring any specific solver. The algorithms presented apply to a family of kernels covering all those commonly used in text and speech processing or computational biology. We show that t

CURL

鸣叫

Handedness

Finite Automata for Generalized Approach to Backward Pattern Matching,ass of problems. We describe a finite automaton for the basic pattern matching problem of finding an exact occurrence of one string in a text. We propose a mechanism to use simple operations over finite automata in a systematic approach to derive automata for solving problems from a defined class, s

Nefarious

破译密码

From Sequential Extended Regular Expressions to NFA with Symbolic Labels, enable the reuse of traditional verification techniques, it is necessary to translate SEREs into automata. SERE are regular expressions built over alphabets resulting from the state variables of the design under analysis. Thus, a traditional approach to generate the automaton would suffer from the

AGGER

Myocyte

Complexity Results and the Growths of Hairpin Completions of Regular Languages (Extended Abstract),009 we presented in [6] a (polynomial time) decision algorithm to decide regularity of the hairpin completion. In this paper we provide four new results: 1.) We show that the decision problem is .-complete. 2.) There is a polynomial time decision algorithm which runs in time ., this improves [6], wh