Pages that link to "Item:Q5431335"
From MaRDI portal
The following pages link to Mathematical Foundations of Computer Science 2003 (Q5431335):
Displaying 14 items.
- Quantifying communication in synchronized languages (Q344766) (← links)
- Similarity in languages and programs (Q391201) (← links)
- On the computational complexity of membrane systems (Q596128) (← links)
- Execution information rate for some classes of automata (Q899317) (← links)
- Computationally universal P systems without priorities: Two catalysts are sufficient (Q1763714) (← links)
- Analytical and computational study of cascade reaction processes in catalytic fibrous membranes (Q2083906) (← links)
- On the universality of purely catalytic P systems (Q2311266) (← links)
- Sampling automata and programs (Q2339473) (← links)
- Information rate of some classes of non-regular languages: an automata-theoretic approach (Q2407088) (← links)
- Bridging membrane and reaction systems -- further results and research topics (Q2865082) (← links)
- Security of Numerical Sensors in Automata (Q2947411) (← links)
- Quantifying Communication in Synchronized Languages (Q3196422) (← links)
- The Expressiveness of Concentration Controlled P Systems (Q3543336) (← links)
- Lossiness of communication channels modeled by transducers1 (Q5283445) (← links)