Decidability questions for term rewriting systems and tree transducers

Gyenizse, Pál
Decidability questions for term rewriting systems and tree transducers.
[Thesis] (Unpublished)

[img]
Preview
PDF (disszertáció)
Download (43MB) | Preview
[img] PDF (bírálati lap)
Restricted to Repository staff only

Download (2MB)
Item Type: Thesis (PhD)
Creators: Gyenizse, Pál
Divisions: Doctoral School of Mathematics
Discipline label: Natural Sciences > Mathematics and Computer Sciences
Defence date label: 1999
Additional Information: PhD ; Terjedelem: 118 lev. + Tézis 19 p. + 2 db opp. vélemény
Uncontrolled Keywords: Informatika
Item ID: 4388
Date Deposited: 2020. Dec . 15. 10:46
Last Modified: 2020. Dec . 15. 13:48
Depository no.: B 3529
URI: https://doktori.bibl.u-szeged.hu/id/eprint/4388
Defence/Citable status: Defended.

Actions (login required)

View Item View Item

Downloads

Downloads per month over past year