The language equivalence problem for HDOL systems having DOL growths



: Honkala J

Publisher: ELSEVIER SCIENCE BV

: 2005

: Theoretical Computer Science

: THEORETICAL COMPUTER SCIENCE

: THEOR COMPUT SCI

: 330

: 1

: 123

: 133

: 11

: 0304-3975

DOI: https://doi.org/10.1016/j.tcs.2004.09.014


We show that language equivalence is decidable for HD0L systems having D0L growths, By definition. an HD0L system H has D0L growth if the length sequence of H is a D0L length sequence. (C) 2004 Elsevier B.V. All rights reserved.



Last updated on 2024-26-11 at 17:18