CONTENTS -- Preface -- Chapter 1 Finite Array Automata and Regular Array Grammars -- 1 Introduction -- 2 Preliminaries -- 3 Finite Array Automata -- 4 Regular Array Languages and Pumping Lemma -- 5 Control on Regular Array grammars -- 6 Final Remarks -- References -- Chapter 2 L-Convex Polyominoes: A Survey -- 1 Introduction -- 2 Definitions and Preliminaries on L-convex Polyominoes -- 3 Discrete Tomography -- 4 L-convex Polyominoes with Respect to Subpicture Order -- 5 Enumerating L-Convex Polyominoes -- References -- Chapter 3 On Oriented Labelling Parameters -- 1 Introduction -- 2 Oriented Vertex Partitioning Problems -- 3 Notation and Terminology -- 4 Two Oriented Variations of L(p g)-Labelling -- 5 Oriented L(p q)-Labelling for Trees -- 6 Oriented L(p 1)-Labelling of Bipartite Graphs -- 7 Oriented L(p 1)-Labelling and the Acyclic Chromatic Number -- 8 L(p q)-Labelling of Oriented Graphs -- 9 Conclusion -- References -- Chapter 4 On a Variant of Parallel Communicating Grammar Systems with Communication by Command -- 1 Introduction -- 2 Basic Notions and Definitions -- 3 On the Power of FCCPC Grammar Systems -- 4 On the Efficiency of FCCPC Grammar Systems -- 5 Final Remarks -- References -- Chapter 5 Some Remarks on Homogeneous Generating Networks of Free Evolutionary Processors -- 1 Introduction -- 2 Basic Definitions -- 3 Computational Power of HGNFEPs -- 4 Conclusion -- References -- Chapter 6 Hexagonal Contextual Array P Systems -- 1 Introduction -- 2 Preliminaries -- 3 External and Internal Hexagonal Array Contextual P Systems -- 4 Contextual Hexagonal Array P Systems with Erased Contexts -- 5 Some Properties of Hexagonal Array Contextual P Systems.

6 Correspondence between External Array Contextual P Systems and External Hexagonal Array Contextual Grammars with Regular Control -- 7 Concluding Remarks -- References -- Chapter 7 A q-Analogue of the Parikh Matrix Mapping -- 1 Introduction -- 2 Definitions -- 3 Parikh Matrix Mapping -- 4 q-Counting Scattered Subwords -- 5 Parikh q-Matrix Mapping -- 6 Injectivity Inverse and Further Remarks -- References -- Chapter 8 Contextual Array Grammars -- 1 Introduction -- 2 Array Grammars - Definitions and Examples -- 3 Contextual Array Grammars: Definitions and Examples -- 4 The Power of Contextual Array Grammars -- 5 Contextual Array Grammars and Context-free Array Grammars -- 6 Contextual Array Grammars and Siromoney Matrix Array Grammars -- References -- Chapter 9 Characterizing Tractability by Cell-Like Membrane Systems -- 1 Introduction -- 2 Preliminaries -- 3 Accepting Cell-like Membrane Systems -- 4 Complexity Classes in Cell-like Membrane Systems -- 5 Simulating Turing Machines by P Systems -- References -- Chapter 10 A Cosmic Muse -- 1 Introduction -- 2 Should the Scale of Our Cosmos Intimidate Us? -- 3 The Dimension of the Eternal -- 4 Cosmoscopes -- 5 Are all Eyes the Eyes of G-d? -- 6 Are all I's the I of G-d? -- References -- Chapter 11 Sublogarithmically Space-Bounded Alternating One-Pebble Turing Machines with only Universal States -- 1 Introduction -- 2 Definitions and Notations -- 3 Incomparability with 2-DC -- 4 USPACE Versus ASPACE -- 5 Space Hierarchy -- 6 Closure Property -- 7 Conclusion -- References -- Chapter 12 Verification of Clock Synchronization in TTP -- 1 Introduction -- 2 Time-Triggered Protocol -- 3 Modelling TTP in lustre -- 4 Verification of TTP -- 5 Discussion -- References -- Chapter 13 Triangular Pasting System -- 1 Introduction -- 2 Notation and Preliminaries4 5.

3 Two Tabled Triangular Pasting System -- 4 Sequential Tabled Triangular Pasting System -- 5 Symmetric Pasting System -- 6 Basic Puzzle Iso Array Grammar -- 7 Conclusion -- References -- Chapter 14 Towards Reducing Parallelism in P Systems -- 1 Introduction -- 2 Some Language Theory Prerequisites -- 3 Time Dependent Transition P Systems -- 4 The Generative Power -- 5 P Systems with Null Parallelism -- 6 The Generative Power -- References -- Chapter 15 Iteration Lemmata for Rational Linear and Algebraic Languages Over Algebraic Structures with Several Binary Operations -- 1 Introduction -- 2 Systems of Equations -- 3 Normal Forms -- 4. Iteration Lemmata -- References -- Chapter 16 The Computational Efficiency of Insertion Deletion Tissue P Systems -- 1. Introduction -- 2. Insertion-Deletion tP System -- 3. The Efficiency of the System -- 4. Final Remarks -- References -- Chapter 17 Petri Nets Event Structures and Algebra -- 1. Signatures and Terms -- 2. Algebras and Recognizability -- 3. Nets and Algebras -- 4. Congruences -- 5. Event Structures -- References -- Chapter 18 Pattern Generation and Parsing by Array Grammars -- 1. Introduction -- 2. Pattern Generation in Array Grammars -- 3. Generating Connected and Simply-Connected Words by UPAGs -- 4. Concluding Remarks -- References -- Chapter 19 Anchored Concatenation of MSCs -- 1. Introduction -- 2. Message Sequence Charts -- 3. Preliminaries -- 4. MSC Languages of HMSCs -- 5. Closure of HMSCs with Respect to Implied Scenarios -- 6. Conclusions -- References -- Chapter 20 Simple Deformation of 4D Digital Pictures -- 1. Introduction -- 2. Definition -- 3. Main Theorem -- 4. Further Problems -- Acknowledgment -- References.

Chapter 21 Probabilistic Inference in Test Tube and its Application to Gene Expression Profiles -- 1. Introduction -- 2. Evaluation of Boolean Formulae in DNA -- 3. Probabilistic Inference in DNA -- 4. Application to in-vitro Gene Expression Analyses -- 5. Conclusions -- Acknowledgments -- References -- Chapter 22 On Languages Defined by Numerical Parameters -- 1. Introduction -- 2. Preliminary Considerations -- 3. Basic Definitions -- 4. Useful Reductions -- 5. The Case of a-Separated Words -- 6. Languages Associated with Parikh Matrices -- References -- Chapter 23 An Application of Regular Tree Grammars -- 1. Introduction -- 2. Regular Tree Grammars and Tree Parsing -- 3. Techniques Extending LR-Parsers -- 4. Conclusion -- References -- Chapter 24 Digitalization of Kolam Patterns and Tactile Kolam Tools -- 1. Kolam Patterns -- 2. Picture Language -- 3. Digitalization of Kolam Patterns -- 4. Universal Kolam Cube (UKC/PsyKolo) -- 5. Tactile Kolam Sheets -- 6. Summary -- Acknowledgments -- References -- Chapter 25 Hexagonal Array Acceptors and Learning -- 1. Introduction -- 2. Preliminaries -- 3. Automata for Languages of HREC -- 4. Examples -- 5. Results -- 7. Learning of Recognizable Hexagonal Picture Languages -- Acknowledgments -- References -- Chapter 26 Pollard's Rho Split Knowledge Scheme -- 1. Introduction -- 2. Elliptic Curves -- 3. Pollard's Rho Split Knowledge Scheme -- 4. Wired Payment System -- 5. Conclusion -- References -- Chapter 27 Characterizations for Some Classes of Codes Defined by Binary Relations -- 1. Introduction -- 2. Characterizations -- 3. Maximality -- 4. Supercodes over Two-Letter Alphabets -- References.