Automata on infinite trees with counting constraints

DOI10.1006/INCO.1995.1104MaRDI QIDQ1898484zbMATH OpenOpenAlexFDO

Authors Danièle Beauquier, Damian Niwiński

Publication date 16 April 1996

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/inco.1995.1104

zbMATH Keywords

Muller automatafinite automata on infinite trees

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Automata on infinite trees with counting constraints
• Counting branches in trees using games
• THE EFFECT OF THE NUMBER OF SUCCESSFUL PATHS IN A BÜCHI TREE AUTOMATON
• On automata on infinite trees
• Generalized automata on infinite trees and Muller-McNaughton's theorem

Cited in

(10)

• Multitree automata that count
• Automata on infinite trees with counting constraints
• Automata on infinite trees with equality and disequality constraints between siblings
• Counting branches in trees using games
• THE EFFECT OF THE NUMBER OF SUCCESSFUL PATHS IN A BÜCHI TREE AUTOMATON
• Alternating automata on infinite trees
• Randomization in automata on infinite trees
• scientific article; zbMATH DE number 176157 (Why is no real title available?)
• scientific article; zbMATH DE number 219444 (Why is no real title available?)
• scientific article; zbMATH DE number 2040911 (Why is no real title available?)

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 Q1898484)