Elementary homomorphisms and a solution of the D0L sequence equivalence problem
Department of Computer Science, University of Colorado at Boulder, Boulder, 80302, U.S.A.; G. Rozenberg; Department of Mathematics, University of Antwerp, U.I.A., Wilrijk, BelgiumTheoretical Computer Science DOI:10.1016/0304-3975(78)90047-6 pp.169-183
ABSTRACT This paper continues the research on elementary D0L systems. In particular we provide an alternative (and simpler than the one presented in ) proof that the D0L (sequence) equivalence problem is decidable.
Article: Juha Honkala[show abstract] [hide abstract]
ABSTRACT: We continue the study of interconnections between semigroup and language theory by studying D0L, DT0L and HDT0L sets in arbitrary monoids. We show that equivalence of D0L sets and strong equivalence of HDT0L sets are decidable in a suitable class of monoids. TUCS Research Group Mathematical Structures of Computer Science 1 Introduction Based on ideas from automata and language theory Eilenberg defined in an arbitrary monoid the classes of recognizable and rational subsets (see Eilenberg , Berstel  and Lallement ). Similarly one can define in an arbitrary monoid the sets corresponding to D0L, DT0L and HDT0L languages. We are going to discuss the equivalence problems of these sets. We define two different notions of equivalence corresponding to the sequence and language equivalence, respectively, studied in formal language theory. In the case of a finitely generated free monoid, it follows from language theory that the strong version of equivalence corresponding to sequence ...06/1998;
[show abstract] [hide abstract]
ABSTRACT: We give a bound for the sequence equivalence problem of polynomially bounded D0L systems which depends only on the size of the alphabet.01/2002;
Data provided are for informational purposes only. Although carefully collected, accuracy cannot be guaranteed. The impact factor represents a rough estimation of the journal's impact factor and does not reflect the actual current impact factor. Publisher conditions are provided by RoMEO. Differing provisions from the publisher's actual policy or licence agreement may be applicable.