Languages convex with respect to binary relations, and their closure properties

MaRDI QIDQ5306170zbMATH OpenFDO

Authors Thomas Ang, Janusz Brzozowski

Publication date 8 April 2010

zbMATH Keywords

closedclosurecodeconvexfactorfactorialfreeideallanguageprefixrelationsubwordsuffix

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Complexity in convex languages
• Complexity of proper prefix-convex regular languages
• Complexity of proper prefix-convex regular languages
• Complexity of right-ideal, prefix-closed, and prefix-free regular languages
• scientific article; zbMATH DE number 4078833

Cited in

(15)

• Syntactic complexity of suffix-free languages
• Descriptional complexity of regular languages
• Closure properties of subregular languages under operations
• Complexity of suffix-free regular languages
• Complexity of suffix-free regular languages
• Complexity in convex languages
• scientific article; zbMATH DE number 4078833 (Why is no real title available?)
• scientific article; zbMATH DE number 3570369 (Why is no real title available?)
• Upper bound on syntactic complexity of suffix-free languages
• Decision problems for convex languages
• Complexity of left-ideal, suffix-closed and suffix-free regular languages
• Complexity of proper prefix-convex regular languages
• Complexity of proper prefix-convex regular languages
• Closure properties of subregular languages under operations
• Syntactic complexity of regular ideals

This page was built for publication: Languages convex with respect to binary relations, and their closure properties

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5306170)