R. Alur and P. Madhusudan, Visibly pushdown languages, Proceedings of the thirty-sixth annual ACM symposium on Theory of computing - STOC '04, pp.202-211, 2004.

D. , On the regular structure of prefix rewriting, Theoretical Computer Science, vol.106, issue.1, pp.61-86, 1992.

D. , On infinite transition graphs having a decidable monadic theory, Automata, Languages and Programming, vol.96, pp.194-205, 1996.

D. , On the transition graphs of turing machines, Theoretical Computer Science, vol.296, issue.2, pp.195-223, 2003.

D. , Boolean algebras of unambiguous context-free languages, IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2008, pp.83-94, 2008.

D. Caucal and C. Rispal, Recognizability for Automata, Developments in Language Theory, pp.206-218, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01824290

D. Caucal and C. Rispal, Boolean Algebras by Length Recognizability, Lecture Notes in Computer Science, pp.169-185, 2019.
URL : https://hal.archives-ouvertes.fr/hal-02012291

N. Chomsky, Three models for the description of language, IEEE Transactions on Information Theory, vol.2, issue.3, pp.113-124, 1956.

S. Crespi-reghizzi and D. Mandrioli, Petri nets and szilard languages, Information and Control, vol.33, issue.2, pp.177-192, 1977.

V. Diekert and G. Rozenberg, The Book of Traces, 1995.

S. Eilenberg, Chapter III Deterministic Automata, Pure and Applied Mathematics, pp.30-75, 1974.

M. Hack, Decidability questions for Petri nets, 1975.

B. Hodgson, On direct products of automaton decidable theories, Theoretical Computer Science, vol.19, issue.3, pp.331-335, 1982.

J. Leroux, V. Penelle, and G. Sutre, On the Context-Freeness Problem for Vector Addition Systems, 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science, pp.43-52, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00788744

C. Löding, Model-Checking Infinite Systems Generated by Ground Tree Rewriting, Lecture Notes in Computer Science, pp.280-294, 2002.

A. Mansard, Unfolding of Finite Concurrent Automata, Electronic Proceedings in Theoretical Computer Science, vol.279, pp.68-84, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01771751

K. Mehlhorn, Pebbling mountain ranges and its application to DCFL-recognition, Automata, Languages and Programming, pp.422-435, 1980.

D. Nowotka and J. Srba, Height-Deterministic Pushdown Automata, Mathematical Foundations of Computer Science 2007, vol.48, pp.125-134

J. L. Peterson, Petri Net Theory and the Modeling of Systems, 1981.

C. , The synchronized graphs trace the context-sensitive languages, Electronic Notes in Theoretical Computer Science, vol.68, issue.6, pp.55-70, 2003.

S. R. Schwer, The context-freeness of the languages associated with vector addition systems is decidable, Theoretical Computer Science, vol.98, issue.2, pp.199-247, 1992.

R. Valk and G. Vidal-naquet, Petri nets and regular languages, Journal of Computer and System Sciences, vol.23, issue.3, pp.299-325, 1981.

G. Winskel and M. Nielsen, Handbook of Logic in Computer Science: Volume 5. Algebraic and Logical Structures, Handbook of Logic in Computer Science, vol.4, pp.1-148, 2001.