scientific article; zbMATH DE number 7559451

DOI10.4230/LIPICS.MFCS.2020.80MaRDI QIDQ5089255FDOQ5089255

Authors: Alexander Rabinovich, Doron Tiferet 

Publication date: 18 July 2022

Title of this publication is not available (Why is that?)

zbMATH Keywords

monadic second-order logicautomata on infinite treesambiguous automata

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Rabin's uniformization problem
• MSO on the Infinite Binary Tree: Choice and Order
• Decidability of Second-Order Theories and Automata on Infinite Trees
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Rational \(\omega\)-languages are non-ambiguous
• Choice functions and well-orderings over the infinite binary tree
• Expressing cardinality quantifiers in monadic second-order logic over trees
• Title not available (Why is that?)

Cited In (2)

• On degrees of ambiguity for Büchi tree automata
• 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 Q5089255)