Regular articles

• In memory of professor Ferenc Gécseg

  Zoltán Ésik, Zoltán Fülöp

  243-246

  • PDF
• Two-step simulations of reaction systems by minimal ones

  Arto Salomaa

  247-257

  • PDF
• Methods for relativizing properties of codes

  Helmut Jürgensen, Lila Kari, Steffen Kopecki

  259-292

  • PDF
• Quotient complexities of atoms in regular ideal languages

  Janusz Brzozowski, Sylvie Davies

  293-311

  • PDF
• Conditional Lindenmayer systems with subregular conditions : the extended case

  Jürgen Dassow, Stefan Rudolf

  313-334

  • PDF
• On a property of non liouville numbers

  Jean-Marie De Koninck, Imre Kátai

  335-347

  • PDF
• Asymptotic approximation for the quotient complexities of atoms

  Volker Diekert, Tobias Walter

  349-357

  • PDF
• A novel cryptosystem based on Gluškov product of automata

  Pál Dömösi, Géza Horváth

  359-371

  • PDF
• Context-free tree grammars are as powerful as context-free jungle grammars

  Frank Drewes, Joost Engelfriet

  373-392

  • PDF
• Local weighted tree languages

  Zoltán Fülöp

  393-402

  • PDF
• State complexity of Kleene-star operations on regulat tree languages

  Yo-Sub Han

  403-422

  • PDF
• On a parity based group testing algorithm

  Sándor Z. Kiss

  423-433

  • PDF
• Weighted first-order logics over semirings

  Eleni Mandrali, George Rahonis

  435-483

  • PDF
• On shift radix systems over imaginary quadratic euclidean domains

  Attila Pethő, Péter Varga, Mario Weitzer

  485-498

  • PDF
• Rectangular algebras as tree recognizers

  Magnus Steinby

  499-515

  • PDF
• On ground word problem of term equation systems

  Sándor Vágvölgyi

  517-551

  • PDF