scientific article
From MaRDI portal
Publication:3922660
zbMath0469.03025MaRDI QIDQ3922660
Publication date: 1981
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
infinite treesmultisuccessor arithmeticsRabin automatonrepresentation of formulas by automatasinking automata
Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25) Complexity of computation (including implicit computational complexity) (03D15)
Related Items (2)
A characterization of Büchi tree automata ⋮ Determinacy of sinking automata on infinite trees and inequalities between various Rabin's pair indices
This page was built for publication:
