On a class of P automata as a machine model for languages over infinite alphabets

Vaszil, György (2005) On a class of P automata as a machine model for languages over infinite alphabets. In: Third brainstorming week on membrane computing. Sevilla, 2005..

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 15:18
Last Modified: 11 Dec 2012 15:18
URI: http://eprints.sztaki.hu/id/eprint/4067

Update Item Update Item