Logical Complexity of Some Classes of Tree Languages Generated by Multiple‐Tree‐Automata (Q3869336)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3672280
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Logical Complexity of Some Classes of Tree Languages Generated by Multiple‐Tree‐Automata |
scientific article; zbMATH DE number 3672280 |
Statements
Logical Complexity of Some Classes of Tree Languages Generated by Multiple‐Tree‐Automata (English)
0 references
1980
0 references
arithmetical hierarchy
0 references
analytical hierarchy
0 references
recursiveness
0 references
automata- behaviors
0 references
emptiness problem
0 references
multiple tree automata
0 references
tree languages
0 references
acceptability
0 references
definability in monadic theories
0 references
