Langford strings, formal languages and contextual ambiguity

DOI10.1080/00207168908803693zbMATH Open0667.68087OpenAlexW2090182543MaRDI QIDQ3820032FDOQ3820032

Solomon Marcus, Gheorghe Păun

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/00207168908803693

zbMATH Keywords

combinatorics on wordsChomsky hierarchyalgebraic linguisticscontextual ambiguityLangford strings

Mathematics Subject Classification ID

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

Cites Work

• On Langford’s Problem (I)
• Title not available (Why is that?)

Cited In (5)

• Analyzing the environment structure of higher-order languages using frame strings
• Generalized langford languages
• Improvements on contours based segmentation for DNA microarray image processing
• The String-Meaning Relations Definable by Lambek Grammars and Context-Free Grammars
• On inherently ambiguous E0L languages

Recommendations

• The String-Meaning Relations Definable by Lambek Grammars and Context-Free Grammars 👍 👎
• Ambiguity in omega context free languages 👍 👎
• On inherently ambiguous E0L languages 👍 👎
• Formal Languages, Formally and Coinductively 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: Langford strings, formal languages and contextual ambiguity

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