Grammar systems as language analyzers and recursively enumerable languages

Bordihn, H. and Dassow, J. and Vaszil, György (1999) Grammar systems as language analyzers and recursively enumerable languages. In: Fundamentals of computation theory. 12th international symposium, FCT '99. Proceedings.(Lecture notes in computer science, 1684.).

Full text not available from this repository.
Item Type: Conference or Workshop Item (Paper)
Subjects: Q Science > QA Mathematics and Computer Science > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány
Divisions: Cellular Sensory and Optical Wave Computing Laboratory
Depositing User: Eszter Nagy
Date Deposited: 11 Dec 2012 14:57
Last Modified: 11 Dec 2012 14:57
URI: http://eprints.sztaki.hu/id/eprint/2141

Update Item Update Item