Cited By
View all- Frisco P(2006)Infinite hierarchies of conformon-p systemsProceedings of the 7th international conference on Membrane Computing10.1007/11963516_25(395-408)Online publication date: 17-Jul-2006
Carriers and counters: P systems with carriers vs. (blind) counter automata
Pages 140 - 151
Abstract
P systems with carriers are shown to be computationally complete with only a single membrane and two carriers. We argue that their power is due to the maximal parallelism required in the application of the rules. In fact, with a single carrier, these systems are equivalent to blind counter automata. Finally, with a single passenger restriction the systems are again computationally complete.
References
[1]
Alcuin of York (735-804). Propositiones ad Acuendos Iuvenes, around 799.
[2]
Bibliography of P Systems, at: The P Systems Web Page, C. Zandron (ed.), http://psystems.disco.unimib.it
[3]
H.-D. Burkhard. Ordered Firing in Petri Nets, Elektr. Informationsverarbeitung und Kybernetik EIK 17 (1981) 71-86.
[4]
R. Freund, Gh. P?aun, On the Number of Non-terminals in Graph-controlled, Programmed, and Matrix Grammars, in {MR01}, pages 214-225.
[5]
P. Frisco, H.J. Hoogeboom, Simulating Counter Automata by P Systems with Symport/Antiport. In: Gh Paun, C. Zandron (eds.) Pre-proceedings of the Second Workshop on Membrane Computing, Curtea de Arges Romania, Molconet Publication 1, 2002, pages 237-248. Updated papers to appear in LNCS.
[6]
S.A. Greibach, Remarks on Blind and Partially Blind One-Way Multicounter Machines, Theoretical Computer Science 7 (1978) 311-324.
[7]
D. Hauschildt, M. Jantzen, Petri Net Algorithms in the Theory of Matrix Grammars, Acta Informatica 8 (1994) 719-728.
[8]
J.E. Hopcroft, J.D. Ullman. Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, 1979.
[9]
C. Martín-Vide, Gh. Paun, Computing with Membranes (P Systems): Universality Results, in {MR01}, pages 214-225.
[10]
C. Martín-Vide, Gh. Paun, G. Rozenberg, Membrane Systems with Carriers, Theoretical Computer Science 270 (2002) 779-796.
[11]
M. Margenstern, Y. Rogozhin (eds.) Procedings Universal Computational Models, Chisinau, Lecture Notes in Computer Science, Volume 2055, Springer Verlag, 2001.
[12]
Gh. Paun, Computing with Membranes, Journal of Computer and System Sciences, 61 (2000) 108-143.
[13]
Gh. Paun. Membrane Computing, an Introduction. Natural Computing Series, Springer Verlag, 2002.
- Carriers and counters: P systems with carriers vs. (blind) counter automata
Recommendations
Dynamically Adaptive Bandwidth for Sub Carriers in OFDM Based Wireless Systems
Proceedings of the 2007 IEEE Wireless Communications and Networking ConferenceIn this article the performance of orthogonal frequency division multiplexing (OFDM) systems with dynamically adaptable sub carrier bandwidth to mitigate inter carrier interference (ICI) is compared against standard OFDM systems with fixed sub carrier ...
Visibly Pushdown Automata and Transducers with Counters
Non-Classical Models of Automata and Applications VIWe generalize the models of visibly pushdown automata (VPDAs) and visibly pushdown transducers (VPDTs) by equipping them with reversal-bounded counters. We show that some of the results for VPDAs and VPDTs (e.g., closure under intersection and ...
Analyses of Interferences between Component Carriers in Carrier Aggregation
CMC '11: Proceedings of the 2011 Third International Conference on Communications and Mobile ComputingSupport of wider bandwidth up to 100MHz is one of the key features for LTE-Advanced system. Carrier aggregation (CA) has been studied as major a solution. As to continuous carrier aggregation, there may be an interference between component carriers (CCs)...
Comments
Information & Contributors
Information
Published In
Publisher
Springer-Verlag
Berlin, Heidelberg
Publication History
Published: 18 September 2002
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 01 Jan 2025
Other Metrics
Citations
Cited By
View all- Frisco P(2006)Infinite hierarchies of conformon-p systemsProceedings of the 7th international conference on Membrane Computing10.1007/11963516_25(395-408)Online publication date: 17-Jul-2006