Results 21  30
of
288
A Taxonomy of Finite Automata Minimization Algorithms
, 1993
"... This paper presents a taxonomy of finite automata minimization algorithms. Brzozowski's elegant minimization algorithm differs from all other known minimization algorithms, and is derived separately. All of the remaining algorithms depend upon computing an equivalence relation on states. We def ..."
Abstract

Cited by 21 (4 self)
 Add to MetaCart
This paper presents a taxonomy of finite automata minimization algorithms. Brzozowski's elegant minimization algorithm differs from all other known minimization algorithms, and is derived separately. All of the remaining algorithms depend upon computing an equivalence relation on states. We define the equivalence relation, the partition that it induces, and its complement. Additionally, some useful properties are derived. It is shown that the equivalence relation is the greatest fixed point of an equation, providing a useful characterization of the required computation. We derive an upperbound on the number of approximation steps required to compute the fixed point. Algorithms computing the equivalence relation (or the partition, or its complement) are derived systematically in the same framework. The algorithms include Hopcroft's, several algorithms from textbooks (including Hopcroft and Ullman's [HU79], Wood's [Wood87], and Aho, Sethi, and Ullman's [ASU86]), and several new algorith...
FORMAT EVOLUTION
, 2001
"... A systematic approach to the adaptation of XML documents and their DTDs is developed. The approach facilitates the evolution of XMLbased formats. There are two essential ideas. Firstly, changes in the formats of documents are represented as stepwise transformations on the underlying DTDs. Secondly, ..."
Abstract

Cited by 21 (8 self)
 Add to MetaCart
A systematic approach to the adaptation of XML documents and their DTDs is developed. The approach facilitates the evolution of XMLbased formats. There are two essential ideas. Firstly, changes in the formats of documents are represented as stepwise transformations on the underlying DTDs. Secondly, the corresponding migration of the XML data is largely induced by the DTD transformations. The presentation focuses on concepts of format evolution, namely roles of corresponding transformations, properties of the transformations, and expressiveness to implement the transformations.
Approximate Matching of Network Expressions with Spacers
 Journal of Computational Biology
, 1992
"... Two algorithmic results are presented that are pertinent to the matching of patterns of interest in macromolecular sequences. The first result is an output sensitive algorithm for approximately matching network expressions, i.e., regular expressions without Kleene closure. This result generalizes th ..."
Abstract

Cited by 19 (0 self)
 Add to MetaCart
Two algorithmic results are presented that are pertinent to the matching of patterns of interest in macromolecular sequences. The first result is an output sensitive algorithm for approximately matching network expressions, i.e., regular expressions without Kleene closure. This result generalizes the O (kn ) expectedtime algorithm of Ukkonen for approximately matching keywords [Ukk85]. The second result concerns the problem of matching a pattern that is a network expression whose elements are approximate matches to network expressions interspersed with specifiable distance ranges. For this class of patterns, it is shown how to determine a backtracking procedure whose order of evaluation is optimal in the sense that its expected time is minimal over all such procedures. Key words: Approximate Match, Backtracking, Network Expression, Proximity Search January 16, 1992 Department of Computer Science The University of Arizona Tucson, Arizona 85721 *This work was supported in part by the ...
CPI: ConstraintsPreserving Inlining Algorithm for Mapping XML DTD to Relational Schema
 J. Data & Knowledge Engineering (DKE
, 2001
"... mapping XML DTD to relational schema ..."
Foundations of the Trace Assertion Method of Module Interface Specification
, 2000
"... The trace assertion method is a formal state machine based method for specifying module interfaces. A module interface specification treats the module as a blackbox, identifying all module's ..."
Abstract

Cited by 17 (1 self)
 Add to MetaCart
The trace assertion method is a formal state machine based method for specifying module interfaces. A module interface specification treats the module as a blackbox, identifying all module's
The simple dynamics of super Turing theories
, 1994
"... This paper reasons about the need to seek for particular kinds of models of computation that imply stronger computability than the classical models. A possible such model, constituting a chaotic dynamical system, is presented. This system, which we term as the analog shift map, when viewed as a comp ..."
Abstract

Cited by 16 (0 self)
 Add to MetaCart
This paper reasons about the need to seek for particular kinds of models of computation that imply stronger computability than the classical models. A possible such model, constituting a chaotic dynamical system, is presented. This system, which we term as the analog shift map, when viewed as a computational model has superTuring power and is equivalent to neural networks and the class of analog machines. This map may be appropriate to describe idealized physical phenomena. 1.
Periodic Orbits as the Skeleton of Classical and Quantum Chaos
 PROCEEDINGS OF THE LOS ALAMOS CENTER FOR NONLINEAR SCIENCE NONLINEAR SCIENCE  NEXT DECADE
, 1990
"... A description of a lowdimensional deterministic chaotic system in terms of unstable periodic orbits (cycles) is a powerful tool for theoretical and experimental analysis of both classical and quantum deterministic chaos, comparable to the familiar perturbation expansions for nearly integrable syste ..."
Abstract

Cited by 16 (3 self)
 Add to MetaCart
A description of a lowdimensional deterministic chaotic system in terms of unstable periodic orbits (cycles) is a powerful tool for theoretical and experimental analysis of both classical and quantum deterministic chaos, comparable to the familiar perturbation expansions for nearly integrable systems. The infinity of orbits characteristic of a chaotic dynamical system can be resummed and brought to a Selberg product form, dominated by the short cycles, and the eigenvalue spectrum of operators associated with the dynamical flow can then be evaluated in terms of unstable periodic orbits. Methods for implementing this computation for finite subshift dynamics are introduced.
Conformance Tests for RealTime Systems with Timed Automata Specifications
"... A method is introduced for testing the conformance of implemented realtime systems to timed automata specifications. Uppaal timed automata are transformed into testable timed transition systems (TTTSs) using a test view. Fault hypotheses and a test generation algorithm for TTTSs are defined. Result ..."
Abstract

Cited by 15 (0 self)
 Add to MetaCart
A method is introduced for testing the conformance of implemented realtime systems to timed automata specifications. Uppaal timed automata are transformed into testable timed transition systems (TTTSs) using a test view. Fault hypotheses and a test generation algorithm for TTTSs are defined. Results of applying the method are presented.
On Monotonic Automata with a Restart Operation
, 1999
"... Automata with a restart operation de ne a special class of rewrite (reduction) systems which has a close relation to the dependency syntax of natural languages. We impose a natural condition of monotonocity and introduce a hierarchical structure of several versions of such automata. The language ..."
Abstract

Cited by 15 (7 self)
 Add to MetaCart
Automata with a restart operation de ne a special class of rewrite (reduction) systems which has a close relation to the dependency syntax of natural languages. We impose a natural condition of monotonocity and introduce a hierarchical structure of several versions of such automata. The language classes recognized by these automata form a proper hierarchy, with the class of contextfree languages on the top, and with the class of deterministic contextfree languages on the bottom. In particular, the deterministic monotonic versions of all the introduced automata recognize the same class of languages { namely that of deterministic contextfree languages.