The search session has expired. Please query the service again.
In a previous paper [L. Giambruno and S. Mantaci,
(2010) 1785–1792] a bideterministic transducer is defined for
the bidirectional deciphering of words by the method introduced by Girod [
(1999) 245–247]. Such a method is defined using
prefix codes. Moreover a coding method, inspired by the Girod’s one, is introduced, and a
transducer that allows both right-to-left and left-to-right decoding by this method is
defined. It is...
In a previous paper [L. Giambruno and S. Mantaci, 411 (2010) 1785–1792] a bideterministic transducer is defined for the bidirectional deciphering of words by the method introduced by Girod [3 (1999) 245–247]. Such a method is defined using prefix codes. Moreover a coding method, inspired by the Girod’s one, is introduced, and a transducer that allows both right-to-left and left-to-right decoding by this method is defined. It is proved also that this transducer is minimal. Here we consider the number...
In a previous paper [L. Giambruno and S. Mantaci,
(2010) 1785–1792] a bideterministic transducer is defined for
the bidirectional deciphering of words by the method introduced by Girod [
(1999) 245–247]. Such a method is defined using
prefix codes. Moreover a coding method, inspired by the Girod’s one, is introduced, and a
transducer that allows both right-to-left and left-to-right decoding by this method is
defined. It is...
We investigate the intersection of two finitely generated submonoids
of the free monoid on a finite alphabet. To this purpose, we
consider automata that recognize such submonoids and we study the
product automata recognizing their intersection. By using automata
methods we obtain a new proof of a result of Karhumäki on the
characterization of the intersection of two submonoids of
rank two, in the case of prefix (or suffix) generators. In a more
general setting, for an arbitrary number of generators,...
Download Results (CSV)