Equivalence of Transducer

Wei Gong; Jian Shi

doi:10.4028/www.scientific.net/AMM.397-400.761

Paper Titles

Optimization Scheme Selection on Bamboo-Wood Pallet Technological Process
p.739

Intrinsically 3-Linked Graph with Knotted Components
p.746

The New Method Exploration and Research on Product Carbon Footprint Calculation
p.750

Performance Evaluation of Vehicle Electronic Stability Program Based on Psychological Method
p.754

Equivalence of Transducer
p.761

Theoretical Analysis of a Acoupled Fiber Ring Resonator
p.765

Bionics Design of Stubble Blade Based on the Digging Claw of Mole Cricket
p.775

Orthogonal Testing Optimum Design in Radial Electrodynamic Magnetic Bearings
p.779

A Conceptual Model of Flapping-Wing Mechanism Inspired from the Results of Numerical Study
p.783

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 397-400Equivalence of Transducer

Equivalence of Transducer

Abstract:

Today Finite Automata are used in several areas of economy and research, for example in language and text processing or E-Commerce. There are often automata with more than hundred thousand states. Minimization of such automata can only be done by classical minimization methods. But this doesnt produce Minimal Finite Automata with output. A Transducer is a special Finite Automata that produces an output. One of the challenges is to test the equivalence of Transducers, this will be shown in this paper.

You might also be interested in these eBooks

Advanced Design and Manufacturing Technology III

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 397-400)

Pages:

761-764

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.397-400.761

Citation:

Cite this paper

Online since:

September 2013

Authors:

Wei Gong, Jian Shi

Keywords:

Equivalence, Finite Automata, Transducer

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] Aho, A. V., J. E. Hopcroft und J. D. Ullman: The Design and Analysis of Computer Algorthms. Addison-Wesley Publishing Company, Reading, MA, (1974).

Google Scholar

[2] Mohri, Mehryar: Minimization algorithms for sequential transducers. Theoretical Computer Science, 234: 177–201, (2000).

DOI: 10.1016/s0304-3975(98)00115-7

Google Scholar

[3] Revuz, D.: Minimisation of acyclic deterministic automata in linear time. Theoretical Computer Science, 92(1): 181–189, (1992).

DOI: 10.1016/0304-3975(92)90142-3

Google Scholar

[4] Tarjan, Robert E.: Depth first search and linear graph algortihms. SIAM Journal on Computing, 1 (2): 146–160, (1972).

DOI: 10.1137/0201010

Google Scholar

[5] Tarjan, Robert E.: Finding dominators in directed graphs. SIAM Journal on Computing, 3: 62–89, (1974).

DOI: 10.1137/0203006

Google Scholar