## Contents of *Fundamenta Informaticae* Volume 27.

####
- Expanding Graph Relabeling Systems have the Power of Recursive Enumerability
- E. SOPENA

- Parallel Word Substitution
- S.LA TORRE, M.NAPOLI and D.PARENTE

- Processes with Multiple Entries and Exits Modulo Isomorphism and Modulo Bisimulation
- J.A. BERGSTA and Gh. STEFANESCU

- An Algebraic Formalization of the Relationship between Evidential Structures and Data Tables
- C.J. LIAU

- Syntactic and Semantic Dependence of Array-Arithmetic Sentences, with an Application to Program Verification
- L. MARCUS

####
- Preface
- A. SKOWRON

- Editorial
- W. ZIARKO

- Rough Sets, Rough Relations and Rough Functions
- Z. PAWLAK

- Formal Conception of Rough Sets
- E. BRYNIARSKI

- First-Order Rough Logic I: Approximate Reasoning via Rough Sets
- T.Y. LIN and Q. LIU

- Variable Precision Extention of Rough Sets
- J.D. KATZBERG and W. ZIARKO

- Rough Concept Analysis: A Synthesis of Rough Sets and Formal Concept Analysis
- R.E. KENT

- Computation of Reducts of Composed Information Systems
- M. KRYSZKIEWICZ and H.RYBINSKI

- Some Bounds on Minimal Decision Tree Depth
- M. MOSHKOV

- Rough Sets and Nelson Algebras
- P. PAGLIANI

- A Note on Categories of Information Systems
- J. POMYKALA and E. DE HAAS

- Rough-Set Reasoning about Uncertain Data
- R. SLOWINSKI and J. STEFANOWSKI

- Tolerance Approximation Spaces
- A. SKOWRON and J. STEPANIUK

- Analitical Morphology: Mathematical Morphology of Decision Tables
- A. SKOWRON and L. POLKOWSKI

- A Common Algebraic Framework of Empirical Learning Methods Based on Rough Se
ts and Matroid Theory
- S. TSUMOTO and H. TANAKA

- Comparison of Rough-Set and Interval-Set Models for Uncertain Reasoning
- Y.Y. YAO and X. LI

- Automated Discovery of Empirical Laws
- J.M. ZYTKOW

####

- Categorisation of Computable Data-Base Queries
- M.LEVENE and G.LOIZOU

- On Four Partial Ordering Semantics for a Process Calculus
- F.CORRADINI and R.DE NICOLA

- Abductive Change Operators
- J.LOBO and C.UZCATEGUI

- (0,1)-Totality is Undecidable for Arbitrary Context-Free Grammars
- E.MAKINEN