@inproceedings{10.1007/978-3-319-23021-4_19,
Abstract = {Finite state transducers over semigroups can be regarded as a formal model of sequential reactive programs. In this paper we introduce a uniform technique for checking effectively functionality, k-valuedness, equivalence and inclusion for this model of computation in the case when a semigroup these transducers operate over is embeddable in a decidable group.},
Address = {Cham},
Author = {Zakharov, Vladimir A.},
BookTitle = {Algebraic Informatics},
Editor = {Maletti, Andreas},
File = {Equivalence Checking Problem for Finite State Transducers over Semigroups - Zakharov2015\_Chapter\_EquivalenceCheckingProblemForF.pdf},
ISBN = {978-3-319-23021-4},
Pages = {208--221},
Publisher = {Springer International Publishing},
Title = {Equivalence Checking Problem for Finite State Transducers over Semigroups},
Year = {2015},
date-added = {2022-05-26 11:26:21 +0200},
date-modified = {2022-05-26 11:26:21 +0200},
doi = {10.1007/978-3-319-23021-4_19}
}
Library Size: 13G (12942 entries),
Last Updated: Apr 05, 2026, 07:51:09,
Build Time: N/A