Titlebook: Implementation and Application of Automata; 14th International C Sebastian Maneth Conference proceedings 2009 Springer-Verlag Berlin Heidel

捐助

Fixpoint Guided Abstraction Refinement for Alternating Automataorithms with built-in refinement operators based on techniques that exploit information computed by abstract fixed points (and not counter-examples as it is usually the case). The efficiency of our new algorithms is illustrated by experimental results.

crockery

On Extremal Cases of Hopcroft’s Algorithmhen the alphabet contains more than one letter. In particular we define an infinite family of binary automata representing the worst case of Hopcroft’s algorithm. They are automata associated to particular trees and we deepen the connection between the refinement process of Hopcroft’s algorithm and the combinatorial properties of such trees.

Gleason-score

https://doi.org/10.1007/978-3-642-02979-0Processing; algorithms; automata theory; cellular automata; cognition; communication; complexity; graph the

故意

Hedge Pattern Partial DerivativeWe propose hedge pattern partial derivatives, an extension of Antimirov’s partial derivatives, in order to give an operational semantics of pattern matching of regular hedge expression patterns, which is crucial in XML processing. We show that correct and small matching automata can be constructed from hedge pattern partial derivatives.

Axon895

Measured

嚴(yán)厲批評(píng)

Cognizance

ICLE

A Testing Framework for Finite-State Morphologyvided into two parts: firstly compute a finite-state machine; secondly inspect this machine to compute its cardinality. The first part involves the finite-state machines to be tested and finite-state machines encoding the inputs of the test. A dependency relation is used to relate tests and the components of the description.

thrombosis

Compact Representation for Answer Sets of ,-ary Regular Queries for representing the answer sets of .-ary queries defined by tree automata. Despite that the number of the elements of the answer set can be as large as |.|., our representation allows to store the set using only .(3. |.|) space. Several basic operations on the sets are shown to be efficiently executable on the representation.