The equivalence problem for DFOL languages and power series



: Honkala J

Publisher: ACADEMIC PRESS INC ELSEVIER SCIENCE

: 2002

: JOURNAL OF COMPUTER AND SYSTEM SCIENCES

: J COMPUT SYST SCI

: 65

: 2

: 377

: 392

: 16

: 0022-0000

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


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