Skip to main content

5 Result(s)

within Sándor Vágvölgyi Remove this filter

and

  1. No Access

    Article

    CHAP and rewrite components

    We present an additional feature to the Challenge Handshake Authentication Protocol. It makes the protocol resilient to offline brute-force/dictionary attacks. We base our contribution to the protocol on the c...

    Sándor Vágvölgyi in Acta Informatica (2011)

  2. No Access

    Chapter and Conference Paper

    On one-pass term rewriting

    Zoltán Fülöp, Eija Jurvanen, Magnus Steinby… in Mathematical Foundations of Computer Scien… (1998)

  3. No Access

    Article

    Minimal equational representations of recognizable tree languages

     A tree language is congruential if it is the union of finitely many classes of a finitely generated congruence on the term algebra. It is well known that congruential tree languages are the same as recognizab...

    Zoltán Fülöp, Sándor Vágvölgyi in Acta Informatica (1997)

  4. No Access

    Chapter and Conference Paper

    A hierarchy of deterministic top-down tree transformations

    The class DTT DR (respectively, DTT) is the family of all deterministic top-down tree transductions with deterministic top-down look-ahead (respectively, no look-ahead). In this pa...

    Giora Slutzki, Sándor Vágvölgyi in Fundamentals of Computation Theory (1993)

  5. No Access

    Article

    Variants of top-down tree transducers with look-ahead

    In this article we consider deterministic and strongly deterministic top-down tree transducers with regular look-ahead, with regular check, with deterministic top-down look-ahead, and with deterministic top-do...

    Zoltán Fülöp, Sándor Vágvölgyi in Mathematical systems theory (1988)