Automata on infinite trees with counting constraints
From MaRDI portal
Publication:5044742
Recommendations
Cites work
- Automata-theoretic techniques for modal logics of programs
- Decidability of Second-Order Theories and Automata on Infinite Trees
- scientific article; zbMATH DE number 3854429 (Why is no real title available?)
- scientific article; zbMATH DE number 3492660 (Why is no real title available?)
- scientific article; zbMATH DE number 1142311 (Why is no real title available?)
- scientific article; zbMATH DE number 1142314 (Why is no real title available?)
- scientific article; zbMATH DE number 3339435 (Why is no real title available?)
- Set theory. With an introduction to descriptive set theory. Translation of the original Polish edition. 2nd, completely revised ed
Cited in
(9)- Alternating automata on infinite trees
- Multitree automata that count
- Automata on infinite trees with counting constraints
- THE EFFECT OF THE NUMBER OF SUCCESSFUL PATHS IN A BÜCHI TREE AUTOMATON
- scientific article; zbMATH DE number 1956522 (Why is no real title available?)
- scientific article; zbMATH DE number 2040911 (Why is no real title available?)
- scientific article; zbMATH DE number 219444 (Why is no real title available?)
- scientific article; zbMATH DE number 2086519 (Why is no real title available?)
- Counting branches in trees using games
This page was built for publication: Automata on infinite trees with counting constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5044742)