Characterizations of recursively enumerable languages by programmed grammars with unconditional transfer

Nonterminal Complexity of Programmed Grammars

MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality

Nonterminal complexity of programmed grammars

Theoretical Computer Science

The size of Higman-Haines sets

Theoretical Computer Science

More on the Size of Higman-Haines Sets: Effective Constructions

Fundamenta Informaticae - Machines, Computations and Universality, Part I

More on the size of higman-haines sets: effective constructions

MCU'07 Proceedings of the 5th international conference on Machines, computations, and universality

More on the Size of Higman-Haines Sets: Effective Constructions

Fundamenta Informaticae - Machines, Computations and Universality, Part I