Mathematical Foundation Of Informatics, The - Proceedings Of The Conference

# On an Infinite Hierarchy of Petri Net Languages (P T An & P V Thao) # Algorithms to Test Rational w-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 Jurgensen & S Konstantinidis) # Maximal Independent Sets in Certain Subword Orders (N H Lam) # Strong Recognition of Rational w-Languages (B L Saec 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 papers