Titlebook: Implementation and Application of Automata; 5th International Co Shen Yu,Andrei Păun Conference proceedings 2001 Springer-Verlag Berlin Hei

Cervical-Spine

Fast Implementations of Automata Computations of automata for which there exists equivalent parallel, or vector, algorithms. As an application, we extend Myers result to arbitrary weighted edit distances, which are currently used to explore the vast data-bases generated by genetic sequencing.

解决

割让

Direct Construction of Minimal Acyclic Subsequential Transducersnimal transducers. In NLP applications our algorithm provides significantly better efficiency than the other algorithms building minimal transducer for large-scale natural language dictionaries. Some experimental comparisons are presented at the end of the paper.

礼节

威胁你

MONA Implementation Secretsn, BDD-based automata representations, and cache-conscious data structures. We describe these techniques and quantify their respective effects by experimenting with separate versions of the Mona tool that in turn omit each of them.

异端

Applications of Finite-State Transducers in Natural Language Processingiption of complex linguistic phenomena involving morphological alternations and syntactic patterns. Because regular languages and relations can be encoded as finite-automata, new languages and relations can be derived from them directly by the finite-state calculus. This is a fundamental advantage over higher-level linguistic formalisms.

Intrepid

Regularly Extended Two-Way Nondeterministic Tree Automatar defining document grammars. Such grammars have regular sets of right-hand sides for their productions and tree automata provide an alternative and useful modeling tool for them. In particular, we believe that they provide a useful computational model for what we call caterpillar expressions.

挑剔小责

A Basis for Looping Extensions to Discriminating-Reverse Parsingroposed, which is computed from the DR automaton itself. The stack vocabulary is enlarged with the mark set, but no new state is added to the basic DR automaton. Moreover, conflict resolution basically uses the DR parser. The method determines at construction time whether all the conflicts can be resolved, and only produces deterministic parsers.

Keratectomy

Reachability and Safety in Queue Systemsgiven a system ., whether there is some computation in which . attempts to read from an empty queue. Other verification problems that we show solvable include (binary, forward, and backward) reachability, safety, invariance, etc. We also consider some reachability questions concerning machines operating in parallel.

HATCH