| Computer Science and Its Potential | |
| The might of formulas and their limits | p. 1 |
| Hardware - software: an equivalence and a contradiction | p. 9 |
| Defining discipline | p. 21 |
| Social Implications of Computer Science | |
| Computer science as cultural development | p. 37 |
| Towards adjusting informatics education to information era | p. 49 |
| Informatics and society: a curriculum for distance education | p. 69 |
| Theory of Formal Languages and Automata | |
| Syntactic and semantic aspects of parallelism | p. 79 |
| Unique fixpoints in complete lattices with applications to formal languages and semantics | p. 107 |
| On abstract families of languages, power series, and elements | p. 117 |
| Are there formal languages complete for SymSPACE (log n)? | p. 125 |
| On twist-closed trios: a new morphic characterization of r.e. sets | p. 135 |
| An automata approach to some problems on context-free grammars | p. 143 |
| Structures and Complexity Theory | |
| On aperiodic sets of Wang tiles | p. 153 |
| Closure under complementation of logspace complexity classes - a survey | p. 163 |
| A relation between sparse and printable sets in NSPACE (log n) | p. 177 |
| A foundation for computable analysis | p. 185 |
| A computer scientist's view of life, the universe, and everything | p. 201 |
| Calendars and chronologies | p. 209 |
| Petri Nets | |
| A uniform approach to Petri Nets | p. 219 |
| Observing partial order runs of Petri Nets | p. 233 |
| Representation theorems for Petri Nets | p. 239 |
| A remark to trace equations | p. 251 |
| Verification of distributed algorithms with algebraic Petri Nets | p. 261 |
| A short story on action refinement | p. 271 |
| Systems Analysis and Distributed Systems | |
| Interactive and reactive systems: states, observations, experiments, input, output, nondeterminism, compositionality, and all that | p. 279 |
| Discrete time analysis of a state dependent tandem with different customer types | p. 287 |
| How distributed algorithms play the token game | p. 297 |
| The asynchronous stack revisited: rounds set the twilight reeling | p. 307 |
| Online scheduling of continuous media streams | p. 313 |
| Software Engineering and Verification | |
| Contribution to Goodenough's and Gerhart's theory of software testing and verification: relation between strong compiler test and compiler implementation verification | p. 321 |
| On the arrangement complexity of uniform trees | p. 337 |
| A relational-functional integration for declarative programming | p. 351 |
| Cognition and Artificial Intelligence | |
| Inside and outside the Chinese Room | p. 359 |
| Abstract structures in spatial cognition | p. 369 |
| Spatial and temporal structures in cognitive processes | p. 379 |
| Knowledge Representation and Reasoning | |
| Qualitative vs. fuzzy representations of spatial distance | p. 389 |
| What's a part? On formalizing part-whole relations | p. 399 |
| SPOCK: a feasibility study on the completeness of parts lists | p. 407 |
| Decision support systems with adaptive reasoning strategies | p. 417 |
| Machine Learning | |
| Knowledge discovery in databases - an inductive logic programming approach | p. 429 |
| The composition heuristic | p. 437 |
| The job assignment problem: a study in parallel and distributed machine learning | p. 445 |
| Self-improving behavior arbitration | p. 455 |
| Neural Networks and Robotics | |
| Neural networks for manipulator path planning | p. 465 |
| Path planning using a subgoal graph | p. 473 |
| A nonlinear Markovian characterization of time series using neural networks | p. 481 |
| Language and Information Systems | |
| Feature-based perception of semantic concepts | p. 489 |
| Automatic detection of thesaurus relations for information retrieval applications | p. 499 |
| InfoSphere-V: a new approach to 3D-visualization of information | p. 507 |
| Author Index | p. 515 |
| Table of Contents provided by Blackwell. All Rights Reserved. |
