This volume presents research results ranging from those in pure mathematical theory (semigroup theory, graph theory, etc.) to those in theoretical and applied computer science, e.g. formal languages, automata, codes, parallel and distributed computing, formal systems, knowledge systems and database theory.Contents:On an Infinite Hierarchy of Petri Net Languages (P T An & P V Thao)Algorithms to Test Rational ω-Codes (X Augros & I Litovsky)Longest Cycles and Restgraph in Maximal Non-Hamiltonian Graphs (V D Hoa)Deterministic and Nondeterministic Directable Automata (M Ito)Worst-Case Redundancy of Solid Codes (H Jürgensen & S Konstantinidis)Maximal Independent Sets in Certain Subword Orders (N H Lam)Strong Recognition of Rational ω-Languages (B L Saëc et al.)Some Results Concerning Covers in the Class of Multivalued Positive Boolean Dependencies (L D Minh et al.)The Complexity of Problems Defined by Boolean Circuits (S Reith & K W Wagner)The Rational Skimming Theorem (J Sakarovitch)A New Classification of Finite Simple Groups (W Shi & S Lipschutz)Connectedness of Tetravalent Metacirculant Graphs with Non-Empty First Symbol (N D Tan & T M Tuoc)and other papersReadership: Researchers on the theoretical foundations of computer science and related fields.Key Features:The only book to explore in-depth the topic of models and simulations as a source of knowledgeHas a strong emphasis on computer software, and explores how the object-oriented paradigm influences computer modelsShows the close relation between modeling and the scientific methodDefines models as abstract images of systems, and presents a process for building models and simulations from a system analysis perspective