Results 1  10
of
29
Package
"... Abstract. In this paper we propose a new data structure, called shared automata, for representing deterministic finite automata (DFA). Shared automata admit a strong canonical form for DFA similarly to Binary Decision Diagrams (BDDs). As a result, checking whether two DFAs are equal is a constantt ..."
Abstract
 Add to MetaCart
shared automaton. We experimentally compare PresTaf, a direct implementation of the Presburger arithmetic built on a shared automata package, and the Presburger package LASH based on standard automata algorithms. Experimental results show the great benefit of the new canonical data structure applied
OpenNWA: A NestedWordAutomaton Library
"... Abstract. Nestedword automata (NWAs) are a language formalism that helps bridge the gap between finitestate automata and pushdown automata. NWAs can express some contextfree properties, such as parenthesis matching, yet retain all the desirable closure characteristics of finitestate automata. Th ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
. This paper describes OpenNWA, a C++ library for working with NWAs. The library provides the expected automatatheoretic operations, such as intersection, determinization, and complementation. It is packaged with WALi—the W eighted Automaton Library—and interoperates closely with the weighted pushdown system
OTR/ITRCATS: Tracking Based on Cellular Automaton and Kalman Filter
"... This note is devoted to the new track reconstruction package OTR/ITRCATS developed for the Pattern Tracker of the HERAB experiment. This package employs a combined approach for track reconstruction based on the use of a cellular automaton for track searching and the Kalman filter techniques for ..."
Abstract
 Add to MetaCart
This note is devoted to the new track reconstruction package OTR/ITRCATS developed for the Pattern Tracker of the HERAB experiment. This package employs a combined approach for track reconstruction based on the use of a cellular automaton for track searching and the Kalman filter techniques
AUTOMATE, a computing package for automata and finite semigroups
, 1991
"... AUTOMATE is a package for symbolic computation on finite automata, extended rational expressions and finite semigroups. On the one hand, it enables one to compute the deterministic minimal automaton of the language represented by a rational expression or given by its table. On the other hand, gi ..."
Abstract

Cited by 17 (1 self)
 Add to MetaCart
AUTOMATE is a package for symbolic computation on finite automata, extended rational expressions and finite semigroups. On the one hand, it enables one to compute the deterministic minimal automaton of the language represented by a rational expression or given by its table. On the other hand
The Visualization of the Road Coloring Algorithm in the package TESTAS
, 2009
"... A synchronizing word of a deterministic automaton is a word in the alphabet of colors of its edges that maps the automaton to a single state. A coloring of edges of a directed graph is synchronizing if the coloring turns the graph into a deterministic finite automaton possessing a synchronizing word ..."
Abstract
 Add to MetaCart
A synchronizing word of a deterministic automaton is a word in the alphabet of colors of its edges that maps the automaton to a single state. A coloring of edges of a directed graph is synchronizing if the coloring turns the graph into a deterministic finite automaton possessing a synchronizing
A Package for the Implementation of Block Codes as Finite Automata
, 2000
"... We have implemented a package that transforms concise algebraic descriptions of linear block codes into finite automata representations, and also generates decoders from such representations. The transformation takes a description of the code in the form of a k generator matrix over a field wi ..."
Abstract
 Add to MetaCart
We have implemented a package that transforms concise algebraic descriptions of linear block codes into finite automata representations, and also generates decoders from such representations. The transformation takes a description of the code in the form of a k generator matrix over a field
A PACKAGE FOR CHECKING SOME STARFREE LANGUAGES
"... We implement a set of procedures for deciding whether or not a language given by its minimal automaton or by its syntactic semigroup is locally testable, threshold locally testable, strictly locally testable, or piecewise testable. The level of local testability of semigroup is also found. We estima ..."
Abstract
 Add to MetaCart
of the word u of length k, 1 and (2) the set of intermediate substrings of length k of the word u. Local testablility has a wide spectrum of applications. We implement in our package a polynomial time algorithms of order O(n 2) for local testability problem of automaton and of syntactic semigroup
Model Intestinal Microflora In Computer Simulation: A Simulation and Modelling Package for HostMicroflora Interactions
, 2002
"... The ecology of the human intestinal microflora and its interaction with the host are poorly understood. Though more and more data are being acquired, in part using modern molecular methods, development of a quantitative theory has not kept pace with this increase in observing power. This is in part ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
automaton for simulation of the intestinal microflora. In this paper the design and evaluation of this simulator are discussed.
VauCanSonG A package for drawing automata and graphs User’s manual
, 2008
"... VauCanSonG is a package that allows to draw automata within texts written using LATEX. It is a set of macros that uses commands of the beautiful PSTricks package, due to Timothy van Zandt1 and which is part of the current LATEX distribution. VauCanSonG is the result of the experience gained in com ..."
Abstract
 Add to MetaCart
VauCanSonG is a package that allows to draw automata within texts written using LATEX. It is a set of macros that uses commands of the beautiful PSTricks package, due to Timothy van Zandt1 and which is part of the current LATEX distribution. VauCanSonG is the result of the experience gained
FINDING REGULAR INSERTION ENCODINGS FOR PERMUTATION CLASSES
"... We describe a practical algorithm which computes the accepting automaton for the insertion encoding of a permutation class, whenever this insertion encoding is regular. This algorithm is implemented in the accompanying Maple package INSENC, which can automatically compute the rational generating fun ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
We describe a practical algorithm which computes the accepting automaton for the insertion encoding of a permutation class, whenever this insertion encoding is regular. This algorithm is implemented in the accompanying Maple package INSENC, which can automatically compute the rational generating
Results 1  10
of
29