Titlebook: Implementation and Application of Automata; 9th International Co Michael Domaratzki,Alexander Okhotin,Sheng Yu Conference proceedings 2005

新星

提名

Automata-Theoretic Techniques for Analyzing Infinite-State Systems interesting and challenging problems to automata theorists. In this talk, I will present some automata-theoretic and related techniques for analyzing various forms of restricted infinite-state systems in the areas of formal verification, e-services, and membrane systems.

友好關(guān)系

Scintillations

Minimal Unambiguous ,NFApartition and the principle of transition union. An algorithm for compactifying .NFA is presented that exploits the union principle. This algorithm has the following property: if the algorithm returns an unambiguous automaton, then this automaton is the transition minimal .NFA.

capillaries

MULTI

Omniscient

Viral Gene Compression: Complexity and Verificationenome. An efficient algorithm for establishing this metric is given along with applications to real genomes including automated classification of viruses and prediction of horizontal gene transfer between host and virus.

柔軟

An Automata Approach to Match Gapped Sequence Tags Against Protein Database of amino acids whose masses total up to the value of the mass gap. In such a case, the standard string matching algorithm does not work any more. In this paper, we present a new efficient algorithm to find the matches of gapped sequence tags in a protein database.

窒息

Conference proceedings 2005- tion and Application of Automata, CIAA 2004. Also included are the extended abstracts of the posters accepted to the conference. The conference was held at Queen’s University in Kingston, Ontario, Canada on July 22–24, 2004. As for its predecessors, the theme of CIAA 2004 was the implementation of

conjunctiva