scientific article; zbMATH DE number 7650347

DOI10.4230/LIPICS.FSTTCS.2019.50MaRDI QIDQ5875689zbMATH OpenFDO

Authors Alexander Rabinovich, Doron Tiferet

Publication date 3 February 2023

Full work available at URL https://doi.org/10.4230/LIPICS.FSTTCS.2019.50

zbMATH Keywords

ambiguous automataautomata on infinite trees

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Theory of computing (68Qxx)

Cited in

(4)

• On the finite degree of ambiguity of finite tree automata
• scientific article; zbMATH DE number 17556 (Why is no real title available?)
• On the expressive power of non-deterministic and unambiguous Petri nets over infinite words
• Degrees of ambiguity for parity tree automata

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