scientific article
From MaRDI portal
Publication:3902489
zbMath0454.68044MaRDI QIDQ3902489
Publication date: 1980
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (8)
Deciding top-down determinism of regular tree languages ⋮ Deterministic top-down tree automata with Boolean deterministic look-ahead ⋮ Checking in polynomial time whether or not a regular tree language is deterministic top-down ⋮ On the Boolean Closure of Deterministic Top-Down Tree Automata ⋮ Variants of top-down tree transducers with look-ahead ⋮ Automata on infinite trees ⋮ Efficient inclusion checking for deterministic tree automata and XML schemas ⋮ A Congruence-Based Perspective on Finite Tree Automata
This page was built for publication:
