The complexity of computing the behaviour of lattice automata on infinite trees

Karsten Lehmann*, Rafael Peñaloza

*Corresponding author for this work

    Research output: Contribution to journalArticlepeer-review

    4 Citations (Scopus)

    Fingerprint

    Dive into the research topics of 'The complexity of computing the behaviour of lattice automata on infinite trees'. Together they form a unique fingerprint.

    Computer Science

    Mathematics