VLSI and Formal Languages

• 
  Juraj Hromkovic: Lower bound techniques for VLSI algorithms. 2-25
• 
  Juhani Karhumäki: The equivalence of mappings on languages. 26-38
• 
  Jacques Sakarovitch: Kleene's theorem revisited. 39-50
• 
  Zsolt Tuza: Some combinatorial problems concerning finite languages. 51-58

Theory of Formal Grammars

• 
  Erzsébet Csuhaj-Varjú: A connection between descriptional complexity of context-free grammars and grammar form theory. 60-74
• 
  H. C. M. Kleijn: Basic ideas of selective substitution grammars. 75-95
• 
  Gheorghe Paun: Some recent restrictions in the derivation of context-free grammars. 96-108

Biologically Motivated Structures

• 
  Victor Aladyev: Recent results on the theory of homogeneous structures. 110-128
• 
  Mária Králová: A note on the ratio function in DOL Systems. 129-137
• 
  Aristid Lindenmayer: Models for multicellular development: Characterization, inference and complexity of L-systems. 138-168

Artificial Intelligence

• 
  Ivan Kalas: A formal model of knowledge-based systems. 170-181
• 
  Frederick N. Springsteel: Basic complexity analysis of hypothesis formation. 182-199
• 
  Péter Szeredi: Perspectives of logic programming. 200-213

last updated on Wed May 22 02:54:06 2013 by the dblp team
data released under the ODC-BY 1.0 license
see also our legal information page