Deciding atomicity of subword-closed languages

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

Vadim V. Lozin, Aistis Atminas

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)

Related Items (1)

Induced subgraphs and path decompositions

Cites Work

• The micro-world of cographs
• Letter graphs and well-quasi-order by induced subgraphs
• Threshold graphs and related topics
• Handle-rewriting hypergraph grammars
• Nested canalyzing, unate cascade, and polynomial functions
• Growth rates of permutation classes: from countable to uncountable
• 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