Nondeterministic tree automata

DOI10.1007/3-540-36387-4_8MaRDI QIDQ4412831zbMATH OpenOpenAlexFDO

Authors Frank Nießner

Publication date 16 July 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-36387-4_8

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 3982544
• scientific article; zbMATH DE number 3972187
• Alternating finite automata on -words
• Topological characterizations of infinite tree languages
• Tree Automata over Infinite Alphabets

Cited in

(9)

• VATA: A Library for Efficient Manipulation of Non-deterministic Tree Automata
• THE REGULARITY OF TWO-WAY NONDETERMINISTIC TREE AUTOMATA LANGUAGES
• Nested Sibling Tree Automata
• scientific article; zbMATH DE number 3982544 (Why is no real title available?)
• Acceptance trees
• scientific article; zbMATH DE number 809136 (Why is no real title available?)
• scientific article; zbMATH DE number 7362732 (Why is no real title available?)
• VLDL satisfiability and model checking via tree automata
• Realizability problem for constraint LTL

This page was built for publication: Nondeterministic tree automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4412831)