A characterization of fair computations of finite state SCCS processes

1989 ◽  
pp. 234-248
Author(s):  
Irène Guessarian
Keyword(s):  
Finite State

FINITELY SUBSEQUENTIAL TRANSDUCERS

2003 ◽  
Vol 14 (06) ◽  
pp. 983-994 ◽  
Author(s):  
CYRIL ALLAUZEN ◽  
MEHRYAR MOHRI
Keyword(s):  
Speech Recognition ◽  
Finite Number ◽  
Efficient Algorithm ◽  
Experimental Results ◽  
Theoretical Formulation ◽  
Large Vocabulary ◽  
Finite State Transducers ◽  
Finite State ◽  
Large Vocabulary Speech Recognition

Finitely subsequential transducers are efficient finite-state transducers with a finite number of final outputs and are used in a variety of applications. Not all transducers admit equivalent finitely subsequential transducers however. We briefly describe an existing generalized determinization algorithm for finitely subsequential transducers and give the first characterization of finitely subsequentiable transducers, transducers that admit equivalent finitely subsequential transducers. Our characterization shows the existence of an efficient algorithm for testing finite subsequentiability. We have fully implemented the generalized determinization algorithm and the algorithm for testing finite subsequentiability. We report experimental results showing that these algorithms are practical in large-vocabulary speech recognition applications. The theoretical formulation of our results is the equivalence of the following three properties for finite-state transducers: determinizability in the sense of the generalized algorithm, finite subsequentiability, and the twins property.

scholarly journals Analysis and Characterization of State Assignment Techniques for Sequential Machines

VLSI Design ◽  
1994 ◽  
Vol 2 (1) ◽  
pp. 81-88 ◽  
Author(s):  
R. Z. Makki ◽  
S. Su
Keyword(s):  
Simple Technique ◽  
Propagation Delay ◽  
State Machines ◽  
Complex State ◽  
Silicon Area ◽  
State Assignment ◽  
Propagation Delay Time ◽  
Sequential Machines ◽  
Finite State

In this paper, we study the problem of state assignment as it relates to silicon area, propagation delay time and testability of finite state machines. The results of a study involving various FSM benchmarks show that the simple technique of one-hot encoding often produces better results than those attained by complex state assignment algorithms.

scholarly journals Non Homogeneous Rough Finite State Automaton

2021 ◽  
Vol 11 (2) ◽  
pp. 629-641
Author(s):  
B. Praba ◽  
R. Saranya
Keyword(s):  
Artificial Intelligence ◽  
Machine Learning ◽  
Dynamical Behaviour ◽  
Finite State Automaton ◽  
Finite State Automata ◽  
Lower Approximation ◽  
Upper Approximation ◽  
Finite State ◽  
Transition Map

Objective: The study of finite state automaton is an essential tool in machine learning and artificial intelligence. The class of rough finite state automaton captures the uncertainty using the rough transition map. The need to generalize this concept arises to adhere the dynamical behaviour of the system. Hence this paper focuses on defining non-homogeneous rough finite state automaton. Methodology: With the aid of Rough finite state automata we define the concept of non-homogeneous rough finite state automata. Findings: Non homogeneous Rough Finite State Automata (NRFSA) Mt is defined by a tuple (Q,Σ,δt,q0 (t),F(t)) The dynamical behaviour of any system can be expressed in terms of an information system at time t. This leads us to define non-homogeneous rough finite state automaton. For each time ‘t’ we generate lower approximation rough finite state automaton Mt_ and the upper approximation rough finite state automaton Mt- and the defined concepts are elaborated with suitable examples. The ordered pair , Mt=(M(t)-,M(t)-) is called as the non-homogeneous rough finite state automaton. Conclusion: Over all our study reveals the characterization of the system which changes its behaviour dynamically over a time ‘t’. Novelty: The novelty of the proposed article is that it clearly immense the system behaviour over a time ‘t’. Using this concept the possible and the definite transitions in the system can be calculated in any given time ‘t’.

GENERAL ALGORITHMS FOR TESTING THE AMBIGUITY OF FINITE AUTOMATA AND THE DOUBLE-TAPE AMBIGUITY OF FINITE-STATE TRANSDUCERS

2011 ◽  
Vol 22 (04) ◽  
pp. 883-904 ◽  
Author(s):  
CYRIL ALLAUZEN ◽  
MEHRYAR MOHRI ◽  
ASHISH RASTOGI
Keyword(s):  
General Problem ◽  
Finite Automata ◽  
General Algorithm ◽  
Approximate Computation ◽  
Probabilistic Automaton ◽  
Bounded Delay ◽  
Finite State Transducers ◽  
Specific Analysis ◽  
Finite State

We present efficient algorithms for testing the finite, polynomial, and exponential ambiguity of finite automata with ε-transitions. We give an algorithm for testing the exponential ambiguity of an automaton A in time [Formula: see text], and finite or polynomial ambiguity in time [Formula: see text], where |A|E denotes the number of transitions of A. These complexities significantly improve over the previous best complexities given for the same problem. Furthermore, the algorithms presented are simple and based on a general algorithm for the composition or intersection of automata. Additionally, we give an algorithm to determine in time [Formula: see text] the degree of polynomial ambiguity of a polynomially ambiguous automaton A and present an application of our algorithms to an approximate computation of the entropy of a probabilistic automaton. We also study the double-tape ambiguity of finite-state transducers. We show that the general problem is undecidable and that it is NP-hard for acyclic transducers. We present a specific analysis of the double-tape ambiguity of transducers with bounded delay. In particular, we give a characterization of double-tape ambiguity for synchronized transducers with zero delay that can be tested in quadratic time and give an algorithm for testing the double-tape ambiguity of transducers with bounded delay.

scholarly journals Towards a Theory of Regular MSC Languages

1999 ◽  
Vol 6 (52) ◽  
Author(s):  
Jesper G. Henriksen ◽  
Madhavan Mukund ◽  
K. Narayan Kumar ◽  
P. S. Thiagarajan
Keyword(s):  
Message Passing ◽  
Finitely Generated ◽  
Message Sequence Charts ◽  
Proper Subclass ◽  
Finite State ◽  
Sequence Graph ◽  
System Requirements ◽  
Sequential Processes ◽  
Theoretic Characterization

Message Sequence Charts (MSCs) are an attractive visual formalism<br /> widely used to capture system requirements during the early<br />design stages in domains such as telecommunication software. It is<br />fruitful to have mechanisms for specifying and reasoning about <br />collections of MSCs so that errors can be detected even at the requirements<br /> level. We propose, accordingly, a notion of regularity for <br />collections of MSCs and explore its basic properties. In particular, we<br />provide an automata-theoretic characterization of regular MSC <br />languages in terms of finite-state distributed automata called bounded<br />message-passing automata. These automata consist of a set of <br />sequential processes that communicate with each other by sending and<br />receiving messages over bounded FIFO channels. We also provide a<br />logical characterization in terms of a natural monadic second-order<br />logic interpreted over MSCs.<br />A commonly used technique to generate a collection of MSCs is<br />to use a Message Sequence Graph (MSG). We show that the class of<br />languages arising from the so-called locally synchronized MSGs constitute<br /> a proper subclass of the languages which are regular in our sense.<br />In fact, we characterize the locally synchronized MSG languages as<br />the subclass of regular MSC languages that are finitely generated.

Sign in / Sign up

Export Citation Format

Share Document