Results 11  20
of
168
StateIdentification Problems for FiniteState Transducers (extended abstract)
"... Abstract. A wellestablished theory exists for testing finitestate machines, in particular Moore and Mealy machines. A fundamental class of problems handled by this theory is state identification: we are given a machine with known state space and transition relation but unknown initial state, and w ..."
Abstract
 Add to MetaCart
, and we are asked to find experiments which permit to identify the initial or final state of the machine, called distinguishing and homing experiments, respectively. In this paper, we study stateidentification for finitestate transducers. The latter are a generalization of Mealy machines where outputs
Bounded Sequence Testing from Nondeterministic Finite State Machines
"... Abstract. The widespread use of finite state machines (FSMs) in modeling of communication protocols has lead to much interest in testing from (deterministic and nondeterministic) FSMs. Most approaches for selecting a test suite from a nondeterministic FSM are based on state counting. Generally, t ..."
Abstract
 Add to MetaCart
Abstract. The widespread use of finite state machines (FSMs) in modeling of communication protocols has lead to much interest in testing from (deterministic and nondeterministic) FSMs. Most approaches for selecting a test suite from a nondeterministic FSM are based on state counting. Generally
1 THE COMPLEXITY OF A COUNTING FINITESTATE AUTOMATON
"... Abstract. A counting finitestate automaton is a nondeterministic finitestate automaton which, on an input over its input alphabet, (magically) writes in binary the number of accepting computations on the input. We examine the complexity of computing the counting function of an NFA, and the complex ..."
Abstract
 Add to MetaCart
, and the complexity of recognizing its range as a set of binary strings. We also consider the pumping behavior of counting finitestate automata. The class of functions computed by counting NFA’s (1) includes a class of functions computed by deterministic finitestate transducers; (2) is contained in the class
Induction and Learning of FiniteState controllers from Simulation
"... We propose a method to generate agent controllers, represented as state machines, to act in partially observable environments. Such controllers are used to constrain the search space, applying techniques from Hierarchical Reinforcement Learning. We define a multistep process, in which a simulator i ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We propose a method to generate agent controllers, represented as state machines, to act in partially observable environments. Such controllers are used to constrain the search space, applying techniques from Hierarchical Reinforcement Learning. We define a multistep process, in which a simulator
Generating candidates when testing a deterministic implementation against a non–deterministic finite state machine
 The Computer Journal
"... This paper considers the problem of testing a deterministic system against a nondeterministic finitestate machine. An adaptive test process, with two phases, is proposed. The paper focuses on the first stage which involves testing to generate a candidate deterministic finitestate machine. This ca ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
This paper considers the problem of testing a deterministic system against a nondeterministic finitestate machine. An adaptive test process, with two phases, is proposed. The paper focuses on the first stage which involves testing to generate a candidate deterministic finitestate machine
On PolynomialTime Computable NonDeterministic Queries
, 1999
"... A search problem is typically modeled by a multivalued function, say M , since any problem instance has in general many solutions. However, when answering a problem, we are usually interested in obtaining just one of its solutions; therefore, we replace M with a singlevalued function F "r ..."
Abstract
 Add to MetaCart
;rening" it, i.e., F has the same domain as M and, for each input X, F (X) is an element of M(X). A nondeterministic query is a "generic" multivalued function from the family of databases on B to the family of all relations on R, where B and R are the schemes of a database and of a relation
The Hephesentation Of Constituent Structures For FiniteState Parsing
 in Proceedings of Coling 84, Association for Computational Linguistics
, 1984
"... This paper considers some initial steps in the construction of such a model. The first step is to determine a method of representing the class of constituent structures of the expressions of L without center embedding in such a way that the members of that class themselves have no more than a small ..."
Abstract
 Add to MetaCart
fixed finite degree of center embedding. Given a grammar that directly generates that class of constituent structures, it is not difficult to construct a deterministic fi nitestate transducer (parser) that assigns the appropriate members of that class to the noncenter embedded expressions of L from
On Model Checking for NonDeterministic InfiniteState Systems
, 1998
"... We demonstrate that many known algorithms for model checking infinitestate systems can be derived uniformly from a reachability procedure that generates a "covering graph", a generalization of the KarpMiller graph for Petri Nets. Each node of the covering graph has an associated nonempty ..."
Abstract
 Add to MetaCart
We demonstrate that many known algorithms for model checking infinitestate systems can be derived uniformly from a reachability procedure that generates a "covering graph", a generalization of the KarpMiller graph for Petri Nets. Each node of the covering graph has an associated non
Testing deterministic implementations from nondeterministic fsm specifications. In:
 Proc. of the 9th Intern Workshop on Protocol Test Systems.
, 1996
"... Abstract In this paper, conformance testing of protocols specified as nondeterministic finite state machines is considered. Protocol implementations are assumed to be deterministic. In this testing scenario, the conformance relation becomes a preorder, socalled reduction relation between FSMs. The ..."
Abstract

Cited by 21 (1 self)
 Add to MetaCart
Abstract In this paper, conformance testing of protocols specified as nondeterministic finite state machines is considered. Protocol implementations are assumed to be deterministic. In this testing scenario, the conformance relation becomes a preorder, socalled reduction relation between FSMs
FASTUS: A cascaded finitestate transducer for extracting information from naturallanguage text
 FiniteState Language Processing
, 1997
"... FASTUS is a system for extracting information from natural language text for entry into a database and for other applications. It works essentially as a cascaded, nondeterministic nitestate automaton. There are ve stages in the operation of FASTUS. In Stage 1, names and other xed form expressions a ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
FASTUS is a system for extracting information from natural language text for entry into a database and for other applications. It works essentially as a cascaded, nondeterministic nitestate automaton. There are ve stages in the operation of FASTUS. In Stage 1, names and other xed form expressions
Results 11  20
of
168