Publication | Open Access

Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton

Mathematical ProgrammingEngineeringReachability ProblemAutomated ReasoningFormal MethodsComputational ComplexityAutomaton OperationComputer ScienceDescriptional ComplexityDiscrete MathematicsFinite-state SystemFormal VerificationAmbiguous Max-plus AutomatonComputability Theory