Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Algorithmic elimination of spurious nondeterminism from Mealy machines

Algorithmic elimination of spurious nondeterminism from Mealy machines Algorithmic elimination of spurious nondeterminism from Mealy machines l Mara Chibnik Hunter College, CUNY 695 Park Ave., NY, NY 1002 1 A Mealy machine is defined as the six-tuple : M £ its states its input alphabet its output alphabet its transitions its output functio n its initial state } r s v t7a such that v maps Q x £ onto r, and y (q w) is the output string associated with inpu t string w starting from state q E Q. A Mealy machine is defined as deterministic i n that each state has exactly one transition for each element of E . We now consider a finite automaton with output built on a similar model bu t allowing nondeterministic branching, an NM . By treating the case of inputs tha t crash as a special type of output response, we can, without loss of generality , preserve the characteristic that there is at least one transitition from each state on each element of Z . 1 This idea developed in conversation with Prof . Daniel I . A. Cohen . 17 -3 .'::.O In the deterministic Mealy machine 6((7, is unique, and an input strin http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png ACM SIGACT News Association for Computing Machinery

Algorithmic elimination of spurious nondeterminism from Mealy machines

Chibnik, Mara
ACM SIGACT News , Volume 17 (3) – Jan 1, 1986
Download PDF
5 pages

Loading next page...
 
/lp/association-for-computing-machinery/algorithmic-elimination-of-spurious-nondeterminism-from-mealy-machines-oCH8tkCKPN

References

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
Association for Computing Machinery
Copyright
Copyright © 1986 by ACM Inc.
ISSN
0163-5700
DOI
10.1145/382254.382804
Publisher site
See Article on Publisher Site

Abstract

Algorithmic elimination of spurious nondeterminism from Mealy machines l Mara Chibnik Hunter College, CUNY 695 Park Ave., NY, NY 1002 1 A Mealy machine is defined as the six-tuple : M £ its states its input alphabet its output alphabet its transitions its output functio n its initial state } r s v t7a such that v maps Q x £ onto r, and y (q w) is the output string associated with inpu t string w starting from state q E Q. A Mealy machine is defined as deterministic i n that each state has exactly one transition for each element of E . We now consider a finite automaton with output built on a similar model bu t allowing nondeterministic branching, an NM . By treating the case of inputs tha t crash as a special type of output response, we can, without loss of generality , preserve the characteristic that there is at least one transitition from each state on each element of Z . 1 This idea developed in conversation with Prof . Daniel I . A. Cohen . 17 -3 .'::.O In the deterministic Mealy machine 6((7, is unique, and an input strin

Journal

ACM SIGACT News – Association for Computing Machinery

Published: Jan 1, 1986

There are no references for this article.