( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
The Big-O Problem for Max-Plus Automata is Decidable (PSPACE-Complete).

, и . LICS, стр. 1-13. IEEE, (2023)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Stefan Laure

Laure Aeschimann

Laure Amate

Laure Fourchaud

Laure Johann

 

Другие публикации лиц с тем же именем

Universal trees grow inside separating automata: Quasi-polynomial lower bounds for parity games., , , , , и . SODA, стр. 2333-2349. SIAM, (2019)Containment and Equivalence of Weighted Automata: Probabilistic and Max-Plus Cases.. LATA, том 12038 из Lecture Notes in Computer Science, стр. 17-32. Springer, (2020)Classes of Languages Generated by the Kleene Star of a Word., и . MFCS (1), том 9234 из Lecture Notes in Computer Science, стр. 167-178. Springer, (2015)A Generalised Twinning Property for Minimisation of Cost Register Automata., , и . LICS, стр. 857-866. ACM, (2016)When are emptiness and containment decidable for probabilistic automata?, , , , , и . J. Comput. Syst. Sci., (2021)Degree of Sequentiality of Weighted Automata., , , и . FoSSaCS, том 10203 из Lecture Notes in Computer Science, стр. 215-230. (2017)Size-Change Abstraction and Max-Plus Automata., , и . MFCS (1), том 8634 из Lecture Notes in Computer Science, стр. 208-219. Springer, (2014)Which Classes of Origin Graphs Are Generated by Transducers., , , и . ICALP, том 80 из LIPIcs, стр. 114:1-114:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)The Shortest Identities for Max-Plus Automata with Two States., и . MFCS, том 83 из LIPIcs, стр. 48:1-48:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)A pseudo-quasi-polynomial algorithm for mean-payoff parity games., , и . LICS, стр. 325-334. ACM, (2018)