scientific article
From MaRDI portal
Publication:4005203
zbMath0757.68083MaRDI QIDQ4005203
Publication date: 27 September 1992
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (18)
Deciding top-down determinism of regular tree languages ⋮ Learning tree languages from positive examples and membership queries ⋮ On the regularity and learnability of ordered DAG languages ⋮ On the minimization of XML schemas and tree automata for unranked trees ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Algebraic Myhill-Nerode theorems ⋮ On the complexity of Kleene algebra with domain ⋮ Learning tree languages from text ⋮ Algebras for classifying regular tree languages and an application to frontier testability ⋮ Verifying the correctness and amortized complexity of a union-find implementation in separation logic with time credits ⋮ Rewriting extended regular expressions ⋮ A technique for recognizing graphs of bounded treewidth with application to subclasses of partial 2-paths ⋮ Myhill-Nerode type theory for fuzzy languages and automata ⋮ Cut sets as recognizable tree languages ⋮ Myhill-Nerode Theorem for Recognizable Tree Series Revisited ⋮ Scattered deletion and commutativity ⋮ A Congruence-Based Perspective on Finite Tree Automata
This page was built for publication:
