P systems with replicated rewriting and stream X-machines (Eilenberg machines)

Fundamenta Informaticae

Volumn 49, Issue 1-3, 2002, Pages 17-33

  Aguado, Joaquin ^a   Balanescu, Tudor ^a   Cowling, Tony ^a   Gheorghe, Marian ^a   Holcombe, Mike ^a   Ipate, Florentin ^a  

^a UNIVERSITY OF SHEFFIELD   (United Kingdom)

Author keywords

(Stream) X machines; Finite state machines; Formal specifications; P Systems

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER HARDWARE DESCRIPTION LANGUAGES; COMPUTER SIMULATION; CONTEXT FREE GRAMMARS; SPECIFICATIONS; X RAY APPARATUS;

FINITE STATE MACHINES;

PARALLEL PROCESSING SYSTEMS;

EID: 0036184622     PISSN: 01692968     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (16)

1. Communicating stream X-machine are no more than X-machine
2. A set of string functions and its power
3. Stream X-machine with underlying distributed grammars
4. Generalised stream X-machines and cooperating distributed grammar systems
5. X-machines as a basis for dynamic system specification
6. An integration testing method that is proved to find all faults
7. Testing conditions for communicating stream X-machine systems
8. P systems with replicated rewriting
9. On the power of P systems with replicated rewriting
10. Computing with membranes (P systems): Universality results
11. Computing with membranes