Published March 11, 2016
| Version v1
Publication
A Class of P Automata for Characterizing Context-free Languages
- Creators
- Vaszil, György
Description
We present a characterization of context-free languages in terms of a restricted class of P automata (P systems accepting strings of symbols using symport/antiport communication rules). The characterization is based on the form of the rules used by the system.
Additional details
- URL
- https://idus.us.es/handle/11441/38416
- URN
- urn:oai:idus.us.es:11441/38416
- Origin repository
- USE