P finite automata and regular languages over countably infinite alphabets

Dassow, Jürgen and Vaszil, György (2006) P finite automata and regular languages over countably infinite alphabets. In: WMC7. Workshop on membrane computing. Leiden, 2006..

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:26
Last Modified: 11 Dec 2012 15:26
URI: https://eprints.sztaki.hu/id/eprint/4533

Update Item Update Item