Anti-commutative languages and n-codes

DOI10.1016/0166-218X(92)90284-HzbMath0679.68140MaRDI QIDQ1823000

H. J. Shyr, Gabriel Thierrin, Masami Ito, Helmut Jürgensen

Publication date: 1989

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

decidability\(C_ 2(X)\)anti-commutative languagesn-code hierarchyn-codes

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (9)

Transducers and the decidability of independence in free monoids ⋮ Relations on free monoids, their independent sets, and codes¹ ⋮ Structure of 3-infix-outfix maximal codes. ⋮ \(n\)-PS-codes, 2-infix-outfix codes and some related classes of codes ⋮ Languages whose \(n\)-element subsets are codes ⋮ Outfix and infix codes and related classes of languages ⋮ Disjunctive languages and compatible orders ⋮ \(k\)-p-infix codes and semaphore codes ⋮ Codes, orderings, and partial words

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Anti-commutative languages and n-codes