External Links

    Journal: Theory Comput. Syst.

    Volume 25, Issue 1

    3 -- 22Ulrich Huckenbeck. Constructing Sets of Functions Which Have a Given F-Cardinality
    23 -- 36David Eppstein, Lane A. Hemachandra, James Tisdall, Bülent Yener. Simultaneous Strong Separations of Probabilistic and Unambiguous Complexity Classes
    37 -- 60Christiane Frougny. Representations of Numbers and Finite Automata
    61 -- 74Jean-Michel Autebert, Luc Boasson. The Equivalence of pre-NTS Grammars is Decidable
    runs on