Hungarian

Approximating natural languages grammars with recursive transition networks

Bánik, Éva (2000) Approximating natural languages grammars with recursive transition networks. Masters, Szegedi Tudományegyetem.

[thumbnail of 2000_banik_eva_00_5.pdf] PDF
2000_banik_eva_00_5.pdf
Hozzáférés joga: SZTE designated computers only
Download (1MB)
[thumbnail of 2000_banik_eva_00_5_velemeny.pdf] PDF
2000_banik_eva_00_5_velemeny.pdf
Hozzáférés joga: Repository staff only
Download (186kB)

Institution

Szegedi Tudományegyetem

Faculty

Faculty of Science and Mathematics

Department

Számítástudományi Tanszék

Discipline

Informatics

Specialization

nincs megadva

Supervisor(s)

Supervisor
Supervisor scientific name label
Email
EHA
Fülöp, Zoltán
UNSPECIFIED
UNSPECIFIED
UNSPECIFIED

Item Type: Thesis (Masters)
Subjects: 01. Natural sciences > 01.02. Computer and information sciences
Depositing User: TTK szerkesztő
Date Deposited: 2011. Mar. 11. 13:53
Last Modified: 2013. Mar. 14. 07:07
URI: https://diploma.bibl.u-szeged.hu/id/eprint/1845

Actions (login required)

View Item View Item
SZTE Repository of Degree Theses is powered by EPrints 3 which is developed by the School of Electronics and Computer Science at the University of Southampton. More information and software credits.