Generalized langford languages

DOI10.1080/00207168908803731MaRDI QIDQ4207601zbMATH OpenOpenAlexFDO

Authors Monica Marcus

Publication date 1989

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207168908803731

zbMATH Keywords

finite languagegeneralized Langford stringregular language

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Discrete mathematics in relation to computer science (68R99)

Recommendations

• scientific article; zbMATH DE number 4092801
• scientific article; zbMATH DE number 4094841
• scientific article; zbMATH DE number 4172403
• Langford strings are square-free
• scientific article; zbMATH DE number 4152360

Cites work

• Langford strings, formal languages and contextual ambiguity

Cited in

(14)

• Generalized language equations with multiple solutions
• More languages of generalised star height 1
• On languages defined by generalized principal right congruences
• scientific article; zbMATH DE number 4172403 (Why is no real title available?)
• scientific article; zbMATH DE number 4092801 (Why is no real title available?)
• scientific article; zbMATH DE number 4094841 (Why is no real title available?)
• scientific article; zbMATH DE number 4108174 (Why is no real title available?)
• Langford strings are square-free
• scientific article; zbMATH DE number 150524 (Why is no real title available?)
• Generalized Sturmian languages
• Lexicographical Generation of a Generalized Dyck Language
• scientific article; zbMATH DE number 2097480 (Why is no real title available?)
• Languages in general algebras
• Post-plus languages

This page was built for publication: Generalized langford languages

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