R. Alur and P. Madhusudan, Visibly pushdown languages, 36 th STOC, ACM Proceedings, pp.202-211, 2004.

D. , On infinite transition graphs having a decidable monadic theory, 23 rd ICALP, vol.1099, pp.194-205, 1996.

D. , Boolean algebras of unambiguous context-free languages, 28 th FSTTCS, Dagstuhl Research Server, 2008.

D. Caucal and C. , Recognizability for automata, 22 nd DLT, 2018.

S. Eilenberg, Algèbre catégorique et théorie des automates, Institut H. Poincaré (1967), and Automata, languages and machines, vol.A, 1974.

K. Mehlhorn, Pebbling mountain ranges and its application to DCFL recognition, th ICALP, vol.7, pp.422-432, 1980.

D. Nowotka and J. Srba, Height-deterministic pushdown automata, 32 nd MFCS, vol.4708, pp.125-134, 2007.

C. , The synchronized graphs trace the context-sensitive languages, Electr. Notes Theor. Comput. Sci, vol.68, issue.6, pp.55-70, 2002.

W. Thomas, Uniform and nonuniform recognizability, Theoretical Computer Science, vol.292, pp.299-316, 2003.