Direct approach processes in group decision making using linguistic OWA operators

http://profs.scienze.univr.it/~manca/mnc/membrane.pdf

A guide to membrane computing

Efficient exploration of unknown environments is a fundamental problem in mobile robotics. We present an approach to distributed multirobot mapping and exploration. Our system enables teams of robots to efficiently explore environments from different, unknown locations. In order to ensure consistency when combining their data into shared maps, the robots actively seek to verify their relative locations. Using shared maps, they coordinate their exploration strategies to maximize the efficiency of exploration. This system was evaluated under extremely realistic real-world conditions. An outside evaluation team found the system to be highly efficient and robust. The maps generated by our approach are consistently more accurate than those generated by manually measuring the locations and extensions of rooms and objects

Distributed Multirobot Exploration and Mapping

http://liacs.leidenuniv.nl/~stefanovtp/courses/StudentenSeminarium/Papers/FI2/AXML.pdf

Automata for XML---A survey

This is a comprehensive (and friendly) introduction to membrane computing (MC), meant to offer both computer scientists and non-computer scientists an up-to-date overview of the field. That is why the set of notions introduced here is rather large, but the presentation is informal, without proofs and with rigorous definitions given only for the basic types of P systems — symbol object P systems with multiset rewriting rules, systems with symport/antiport rules, systems with string objects, tissue-like P systems, and neural-like P systems. Besides a list of (biologically inspired or mathematically motivated) ingredients/features which can be used in systems of these types, we also mention a series of results, as well as a series of research trends and topics.

/pdf/introduction-to-membrane-computing-5cngwvz0yk.pdf

Introduction to Membrane Computing

Grammar systems

Structures and Bio-language to Simulate Transition P Systems on Digital Computers.- Gamma and the Chemical Reaction Model: Fifteen Years After.- Visual Multiset Rewriting: Applications to Diagram Parsing and Reasoning.- Multiset Automata.- Parikh Mapping and Iteration.- Multiset Constraints and P Systems.- Toward a Formal Macroset Theory.- Normal Forms of Grammars, Finite Automata, Abstract Families, and Closure Properties of Multiset Languages.- On Multisets in Database Systems.- Tolerance Multisets.- Fuzzy Multisets and Their Generalizations.- Universality Results for Some Variants of P Systems.- Multiset and K-Subset Transforming Systems.- On P Systems with Active Membranes Solving the Integer Factorization Problem in a Polynomial Time.- The Linear Theory of Multiset Based Dynamic Systems.- Artificial Life Applications of a Class of P Systems: Abstract Rewriting Systems on Multisets.- Mathematics of Multisets.

Proceedings of the Workshop on Multiset Processing: Multiset Processing, Mathematical, Computer Science, and Molecular Computing Points of View

Dynamically controlled cooperating/distributed grammar systems

Dedicated to Arto Salomaa, a towering figure of theoretical computer science, on the occasion of his 65th birthday, this book is a tribute to him on behalf of the theoretical computer science community. The contributions are written by internationally recognized scientists and cover most of Salomaa's many research areas. Due to its representative selection of classic and cutting edge trends in theoretical computer science, the book constitutes a comprehensive state-of-the-art survey. The contributions are in such central areas as automata theory, algorithms and complexity, and combinatorics of words. But not only that, they take up new areas such as regular sets and biocomputing. While some are survey articles of fundamental topics, most are original research papers.

Jewels Are Forever Contributions On Theoretical Computer Science in Honor of Arto Salomaa

Colonies (basically, grammar systems with the components generating finite languages) with parallel activity (all the components that can work must work) in two variants are defined here and their generative capacity is investigated. It is found that the (strong) parallelism increases the power of colonies, but subfamilies of matrix languages are obtained.

Gheorghe Păun

Papers

Grammar systems

Proceedings of the Workshop on Multiset Processing: Multiset Processing, Mathematical, Computer Science, and Molecular Computing Points of View

Dynamically controlled cooperating/distributed grammar systems

Jewels Are Forever Contributions On Theoretical Computer Science in Honor of Arto Salomaa

On parallelism in colonies