scientific article; zbMATH DE number 7204387

DOI10.4230/LIPIcs.MFCS.2017.53zbMath1441.68128MaRDI QIDQ5111268

Erik Paul

Publication date: 26 May 2020

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

equivalencedecidabilitytree automatasequentialityunambiguitymax-plus automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (5)

Ambiguity Hierarchies for Weighted Tree Automata ⋮ Equivalence, Unambiguity, and Sequentiality of Finitely Ambiguous Max-Plus Tree Automata ⋮ Unnamed Item ⋮ Finite sequentiality of unambiguous max-plus tree automata ⋮ Ambiguity hierarchies for weighted tree automata

Cites Work

• 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
• 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
• Unambiguous Automata Denoting Finitely Sequential Functions
• Deciding Unambiguity and Sequentiality of Polynomially Ambiguous Min-Plus Automata

This page was built for publication: