A1 Refereed original research article in a scientific journal

The equivalence problem for DFOL languages and power series



Authors: Honkala J

Publisher: ACADEMIC PRESS INC ELSEVIER SCIENCE

Publication year: 2002

Journal name in source: JOURNAL OF COMPUTER AND SYSTEM SCIENCES

Journal acronym: J COMPUT SYST SCI

Volume: 65

Issue: 2

First page : 377

Last page: 392

Number of pages: 16

ISSN: 0022-0000

DOI: https://doi.org/10.1006/jcss.2002.1850


Abstract
We show that equivalence is decidable for DOL systems with finite axiom sets. We discuss also DFOL power series and solve their equivalence problem over computable fields. (C) 2002 Elsevier Science (USA).



Last updated on 2024-26-11 at 16:06