Equivalence, Unambiguity, and Sequentiality of Finitely Ambiguous Max-Plus Tree Automata

DOI10.1142/S0129054123480027MaRDI QIDQ6154973zbMATH OpenOpenAlexFDO

Authors Erik Paul

Publication date 16 February 2024

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0129054123480027

zbMATH Keywords

equivalencedecidabilitysequentialityunambiguityweighted tree automatamax-plus tree automata

Mathematics Subject Classification ID

Theory of computing (68Qxx) Mathematical programming (90Cxx) Computer science (68-XX)

Cites work

• scientific article; zbMATH DE number 3932372 (Why is no real title available?)
• scientific article; zbMATH DE number 4072419 (Why is no real title available?)
• scientific article; zbMATH DE number 41838 (Why is no real title available?)
• scientific article; zbMATH DE number 193411 (Why is no real title available?)
• scientific article; zbMATH DE number 3588051 (Why is no real title available?)
• scientific article; zbMATH DE number 7204387 (Why is no real title available?)
• scientific article; zbMATH DE number 2211801 (Why is no real title available?)
• Algorithms for determining relative star height and star height
• An algebraic characterization of semirings for which the support of every recognizable series is recognizable
• Coarse-to-fine natural language processing
• DECIDABILITY OF THE EQUIVALENCE PROBLEM FOR FINITELY AMBIGUOUS FINANCE AUTOMATA
• Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton
• Deciding unambiguity and sequentiality of polynomially ambiguous min-plus automata
• Finite sequentiality of unambiguous max-plus tree automata
• Finite-valued distance automata
• Handbook of weighted automata
• Modeling and analysis of timed Petri nets using heaps of pieces
• On Context-Free Languages
• On finite and polynomial ambiguity of weighted tree automata
• On the definition of a family of automata
• Performance evaluation of (max,+) automata
• Solving numerical constraints
• THE EQUALITY PROBLEM FOR RATIONAL SERIES WITH MULTIPLICITIES IN THE TROPICAL SEMIRING IS UNDECIDABLE

This page was built for publication: Equivalence, Unambiguity, and Sequentiality of Finitely Ambiguous Max-Plus Tree Automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6154973)