On the Minimization of Finite State Transducers over Semigroups-Reference-Cited by-同舟云学术

On the Minimization of Finite State Transducers over Semigroups

Published:2017-12 Issue:7 Volume:51 Page:523-530
ISSN:0146-4116
Container-title:Automatic Control and Computer Sciences
language:en
Short-container-title:Aut. Control Comp. Sci.

Author:

Zakharov V. A.,Temerbekova G. G.

Publisher

Allerton Press

Subject

Signal Processing,Control and Systems Engineering,Software

Link

http://link.springer.com/article/10.3103/S0146411617070240/fulltext.html

Reference20 articles.

1. Alur, R. and Cerny, P., Streaming transducers for algorithmic verification of single-pass list-processing programs, Proc. of 38th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages, 2011, pp. 599–610.

2. Blattner, M. and Head, T., Single-valued a-transducers, J. Comput. Syst. Sci., 1977, vol. 15, pp. 310–327.

3. Blattner, M. and Head, T., The decidability of equivalence for deterministic finite transducers, J. Comput. Syst. Sci., 1979, vol. 19, pp. 45–49.

4. Beal, M.-P. and Carton, O., Computing the prefix of an automaton, Theor. Inf. Appl., 2000, vol. 34, pp. 503–514.

5. Culik, K. and Karhumaki, J., The equivalence of finite-valued transducers (on HDTOL languages) is decidable, Theor. Comput. Sci., 1986, vol. 47, pp. 71–84.

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Efficient Equivalence Checking Technique for Some Classes of Finite-State Machines;Automatic Control and Computer Sciences;2021-12

2. On the Expressive Power of Some Extensions of Linear Temporal Logic;Automatic Control and Computer Sciences;2019-12