scientific article; zbMATH DE number 2040921

MaRDI QIDQ4452077zbMATH OpenFDO

Authors Sylvain Lombardy, Jean Mairesse, Christophe Prieur, Ines Klimann

Publication date 11 February 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2710/27100373.htm

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton
• scientific article; zbMATH DE number 7559164
• Finite sequentiality of unambiguous max-plus tree automata
• Which finitely ambiguous automata recognize finitely sequential functions? (extended abstract)
• Max-plus automata

Cited in

(13)

• Finite sequentiality of unambiguous max-plus tree automata
• Max-plus automata
• A contribution to the determinization of max-plus automata
• Sequential?
• Which finitely ambiguous automata recognize finitely sequential functions? (extended abstract)
• Series which are both max-plus and min-plus rational are unambiguous
• scientific article; zbMATH DE number 1163641 (Why is no real title available?)
• Unambiguous automata denoting finitely sequential functions
• scientific article; zbMATH DE number 7559164 (Why is no real title available?)
• On delay and regret determinization of max-plus automata
• Deciding unambiguity and sequentiality of polynomially ambiguous min-plus automata
• Finite sequentiality of finitely ambiguous max-plus tree automata
• Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton

This page was built for publication:

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