Equivalence, Unambiguity, and Sequentiality of Finitely Ambiguous Max-Plus Tree Automata
From MaRDI portal
Publication:6154973
DOI10.1142/S0129054123480027OpenAlexW4381164191MaRDI QIDQ6154973FDOQ6154973
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
Cites Work
- Title not available (Why is that?)
- On Context-Free Languages
- Handbook of weighted automata
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the definition of a family of automata
- Title not available (Why is that?)
- Modeling and analysis of timed Petri nets using heaps of pieces
- THE EQUALITY PROBLEM FOR RATIONAL SERIES WITH MULTIPLICITIES IN THE TROPICAL SEMIRING IS UNDECIDABLE
- Title not available (Why is that?)
- Performance evaluation of (max,+) automata
- Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton
- Deciding unambiguity and sequentiality of polynomially ambiguous min-plus automata
- Algorithms for determining relative star height and star height
- Solving numerical constraints
- Coarse-to-fine natural language processing
- Finite-valued distance automata
- DECIDABILITY OF THE EQUIVALENCE PROBLEM FOR FINITELY AMBIGUOUS FINANCE AUTOMATA
- Title not available (Why is that?)
- On finite and polynomial ambiguity of weighted tree automata
- Finite sequentiality of unambiguous max-plus tree automata
- Title not available (Why is that?)
- An algebraic characterization of semirings for which the support of every recognizable series is recognizable
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)
