Deciding atomicity of subword-closed languages

DOI10.1007/978-3-031-05578-2_5OpenAlexW4285225303MaRDI QIDQ2163979FDOQ2163979

Authors: Aistis Atminas, Vadim Lozin 

Publication date: 11 August 2022

Full work available at URL: https://doi.org/10.1007/978-3-031-05578-2_5

zbMATH Keywords

decidabilityjoint embedding propertysubword-closed language

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Threshold graphs and related topics
• Handle-rewriting hypergraph grammars
• Decision lists and related Boolean functions
• Nested canalyzing, unate cascade, and polynomial functions
• Ordering by Divisibility in Abstract Algebras
• Letter graphs and well-quasi-order by induced subgraphs
• The micro-world of cographs
• Atomicity and Well Quasi-Order for Consecutive Orderings on Words and Permutations
• Growth rates of permutation classes: from countable to uncountable

Cited In (2)

• Deciding atomicity of subword-closed languages
• Induced subgraphs and path decompositions

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 Q2163979)