On DOL systems with finite axiom sets

Honkala Juha: On DOL systems with finite axiom sets. In: Acta cybernetica, (16) 1. pp. 29-35. (2003)

[thumbnail of cybernetica_016_numb_001_029-035.pdf]
Preview
Cikk, tanulmány, mű
cybernetica_016_numb_001_029-035.pdf

Download (793kB) | Preview

Abstract

We give a new solution for the language equivalence problem of D0L systems with finite axiom sets by using the decidability of the equivalence problem of finite valued transducers on HDT0L languages proved by Culik II and Karhumäki.

Item Type: Article
Journal or Publication Title: Acta cybernetica
Date: 2003
Volume: 16
Number: 1
ISSN: 0324-721X
Page Range: pp. 29-35
Language: English
Place of Publication: Szeged
Event Title: Conference for PhD Students in Computer Science (3.) (2002) (Szeged)
Related URLs: http://acta.bibl.u-szeged.hu/38515/
Uncontrolled Keywords: Számítástechnika, Kibernetika
Additional Information: Bibliogr.: 35. p. ; összefoglalás angol nyelven
Subjects: 01. Natural sciences
01. Natural sciences > 01.02. Computer and information sciences
Date Deposited: 2016. Oct. 15. 12:25
Last Modified: 2022. Jun. 14. 15:55
URI: http://acta.bibl.u-szeged.hu/id/eprint/12706

Actions (login required)

View Item View Item