Deciding atomicity of subword-closed languages
From MaRDI portal
Publication:6549668
DOI10.1016/j.tcs.2024.114595MaRDI QIDQ6549668
Aistis Atminas, Vadim V. Lozin
Publication date: 4 June 2024
Published in: Theoretical Computer Science (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- The joint embedding property and maximal models
- The micro-world of cographs
- Letter graphs and well-quasi-order by induced subgraphs
- On the origins of Dénes König's infinity lemma
- Über eine Schlußweise aus dem Endlichen ins Unendliche.
- Threshold graphs and related topics
- Deciding atomicity of subword-closed languages
- Nested canalyzing, unate cascade, and polynomial functions
- Geometric grid classes of permutations
- Higman’s Lemma and Its Computational Content
- Growth rates of permutation classes: from countable to uncountable
- Universal Horn Sentences and the Joint Embedding Property
- Letter Graphs and Geometric Grid Classes of Permutations
- Elementary Amalgamation and Joint Embedding Property for Intermediate Logics
- Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
- Ordering by Divisibility in Abstract Algebras
- Atomicity and Well Quasi-Order for Consecutive Orderings on Words and Permutations
- Decision lists and related Boolean functions
This page was built for publication: Deciding atomicity of subword-closed languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6549668)
