( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Deciding WQO for Factorial Languages.

, , и . LATA, том 7810 из Lecture Notes in Computer Science, стр. 68-79. Springer, (2013)

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.

Aistis Simaitis

 

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

Labelled Induced Subgraphs and Well-Quasi-Ordering., и . Order, 32 (3): 313-328 (2015)Combinatorics and Algorithms for Quasi-chain Graphs., , , и . IWOCA, том 12757 из Lecture Notes in Computer Science, стр. 49-62. Springer, (2021)Graph parameters, implicit representations and factorial properties., , , , и . Discret. Math., 346 (10): 113573 (2023)Minimal Classes of Graphs of Unbounded Clique-width and Well-quasi-ordering., , , и . CoRR, (2015)Well-Quasi-Order for Permutation Graphs Omitting a Path and a Clique., , , , и . Electron. J. Comb., 22 (2): 2 (2015)Deciding Atomicity of Subword-Closed Languages., и . DLT, том 13257 из Lecture Notes in Computer Science, стр. 69-77. Springer, (2022)WQO is decidable for factorial languages., , и . Inf. Comput., (2017)Deciding WQO for Factorial Languages., , и . LATA, том 7810 из Lecture Notes in Computer Science, стр. 68-79. Springer, (2013)Graph Functionality., , и . WG, том 11789 из Lecture Notes in Computer Science, стр. 135-147. Springer, (2019)Graph Parameters, Implicit Representations and Factorial Properties., , , , и . IWOCA, том 13270 из Lecture Notes in Computer Science, стр. 60-72. Springer, (2022)