scientific article; zbMATH DE number 3982544
From MaRDI portal
Publication:3746905
zbMATH Open0607.68060MaRDI QIDQ3746905FDOQ3746905
Authors: Takeshi Hayashi, Satoru Miyano 
Publication date: 1985
Title of this publication is not available (Why is that?)
Recommendations
nondeterminismtree automatainfinite treesacceptancefinal setnondeterministic degreeomega-tree languagesstructural complexity of the recognizing automaton
Cited In (27)
- Variétés d'automates descendants d'arbres infinis
- PUSHDOWN AUTOMATA ON INFINITE TREES AND NONDETERMINISTIC CONTEXT-FREE PROGRAMS
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Complexity of weak acceptance conditions in tree automata.
- Title not available (Why is that?)
- Nondeterministic Tree Automata
- Automata on infinite objects and their applications to logic and programming
- Infinitary tree languages recognized by \(\omega\)-automata
- \(X\)-automata on \(\omega\)-words
- Finite tree automata with cost functions
- Title not available (Why is that?)
- Topological characterizations of infinite tree languages
- Uniform inevitability is tree automaton ineffable
- On automata on infinite trees
- Title not available (Why is that?)
- Alternating automata on infinite trees
- Title not available (Why is that?)
- Title not available (Why is that?)
- Prolog infinite trees and automata
- Acceptance trees
- The Non-deterministic Mostowski Hierarchy and Distance-Parity Automata
- Finite automata with generalized acceptance criteria
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3746905)
