Contents of Fundamenta Informaticae Volume 73

Number 1-2,  2006

Number 3,  2006

Number 4,  2006

Contents of Volume 73, Number 1-2, 2006

Click on title for abstract

Automata Recognizing No Words: A Statistical Approach
Cristian S. Calude, Cezar Campeanu and Monica Dumitrescu

An Algebraic Characterization of Semi-Simple Splicing
Rodica Ceterchi

On the Branching Complexity of P Systems
Gabriel Ciobanu, Gheorghe P aun and Mario J. Pérez-Jiménez

On a Connection Between Cooperating Distributed Grammar Systems and Basic Process Algebra
Erzsébet Csuhaj-Varjú and Alexandru Mateescu

Secret Sharing Schemes with Nice Access Structures
Cunsheng Ding and Arto Salomaa

On Some Problems of Mateescu Concerning Subword Occurrences
Cunsheng Ding and Arto Salomaa

Interpreted Trajectories
Michael Domaratzki, Grzegorz Rozenberg and Kai Salomaa

Observations on the Smoothness Properties of Real Functions Computed by Weighted Finite Automata
Manfred Droste, Jarkko Kari and Paula Steinby

Faster Algorithm for Designing Optimal Prefix-Free Codes with Unequal Letter Costs
Sorina Dumitrescu

Undecidability in ω-Regular Languages
Vesa Halava, Tero Harju and Juhani Karhumäki

On the Problem Whether the Image of an N-Rational Series Equals N
Juha Honkala

On the Computational Power of 1-Deterministic and Sequential P Systems
Oscar H. Ibarra, Sara Woodworth, Hsu-Chun Yen and Zhe Dang

The Shortest Common Superstring Problem and Viral Genome Compression
Lucian Ilie and Cristian Popescu

Block Substitutions and Their Properties
Lila Kari and Elena Losseva

Simple Gene Assembly Is Deterministic
Miika Langille and Ion Petre

Synchronized Shuffle on Backbones
Florin Manea, Victor Mitrana and Daniel-Claudian Voinescu

Mild Context-Sensitivity, After Twenty Years
Solomon Marcus

Routes and Products of Monoids
Alexandru Mateescu and Rudolf Freund

Membrane Computing and Economics: Numerical P Systems
Gheorghe Paun and Radu Paun

A Property of Independency Relations Induced by Probabilistic Distributions with Binary Variables
Azaria Paz

Nondeterministic Bimachines and Rational Relations with Finite Codomain
Nicolae Santean and Sheng Yu

Injectivity of the Parikh Matrix Mappings Revisited
Virgil Nicolae  Serbanuta and Traian Florin Serbanuta

Interactive Systems with Registers and Voices
Gheorghe Stefanescu

Note on Some Order Properties Related to Processes Semantics (I)
Dragos Vaida

Logic Programming Representation of the Compound Term Composition Algebra
Anastasia Analyti and Ioannis Pachoulakis

A Low-complexity Distance for DNA Strings
Liviu P. Dinu and Andrea Sgarro

Multiple Images Embedding Scheme Based on Moment Preserving Block Truncation Coding
Yu-Chen Hu

Adaptive Merging of Prioritized Knowledge Bases
Weiru Liu, Guilin Qi and David A. Bell

Event Structures with Disabling/Enabling Relation and Event Automata
G. Michele Pinna

Preface

Fully Abstract Semantics for a Coordination Model with Asynchronous Communication and Enhanced Matching
Antonio Brogi, Jean-Marie Jacquet and Isabelle Linden

Supporting Secure Coordination in SecSpaces
Roberto Gorrieri, Roberto Lucchi and Gianluigi Zavattaro

Coordination as a Service
Mirko Viroli and Andrea Omicini

Distribution of a Simple Shared Dataspace Architecture
Simona Orzan and Jaco van de Pol

A Component Coordination Model Based on Mobile Channels
Juan Guillen-Scholten, Farhad Arbab, Frank de Boer and Marcello Bonsangue

Typing the Behavior of Software Components using Session Types
Antonio Vallecillo, Vasco T. Vasconcelos and António Ravara