Regular articles

• Codes and infinite words

  Jeanne Devolder

  241-256

  • PDF
• A note on regular strongly shuffle-closed languages

  Balázs Imreh, Masami Ito

  257-260

  • PDF
• A pumping lemma for output languages of attributed tree transducers

  Armin Kühnemann, Heiko Vogler

  261-305

  • PDF
• On semi-conditional grammars with productions having either forbidding or permitting conditions

  Alexander Meduna, A. Gopalaratnam

  307-323

  • PDF
• Invariance groups of threshold functions

  Eszter Katonáné Horváth

  325-332

  • PDF
• On the complexity of dynamic tests for logic functions

  V. A. Vardanân

  333-343

  • PDF
• Some remarks on functional dependencies in relational datamodels

  Vu Duc Thi, Le Thi Thanh

  345-352

  • PDF