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

DOI10.1142/s0129054123480027OpenAlexW4381164191MaRDI QIDQ6154973

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

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Coarse-to-fine natural language processing
• Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton
• Handbook of weighted automata
• Algorithms for determining relative star height and star height
• Finite-valued distance automata
• Finite sequentiality of unambiguous max-plus tree automata
• An algebraic characterization of semirings for which the support of every recognizable series is recognizable
• On Finite and Polynomial Ambiguity of Weighted Tree Automata
• On the definition of a family of automata
• THE EQUALITY PROBLEM FOR RATIONAL SERIES WITH MULTIPLICITIES IN THE TROPICAL SEMIRING IS UNDECIDABLE
• Modeling and analysis of timed Petri nets using heaps of pieces
• DECIDABILITY OF THE EQUIVALENCE PROBLEM FOR FINITELY AMBIGUOUS FINANCE AUTOMATA
• Performance evaluation of (max,+) automata
• Deciding Unambiguity and Sequentiality of Polynomially Ambiguous Min-Plus Automata
• On Context-Free Languages

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