The set of minimal words of a context-free language is context-free

DOI10.1006/JCSS.1997.1497zbMATH Open0897.68058OpenAlexW2035588789MaRDI QIDQ1384533FDOQ1384533

Authors: Jean Berstel, Luc Boasson 

Publication date: 4 August 1998

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcss.1997.1497

Recommendations

• scientific article; zbMATH DE number 1528666
• On the context-free production complexity of finite languages
• scientific article; zbMATH DE number 1091111
• Context-free languages consisting of non-primitive words

zbMATH Keywords

language of minimal words

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• 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?)
• Adherences of languages
• Title not available (Why is that?)

Cited In (5)

• Title not available (Why is that?)
• Min of Mat is not necessarily Mat
• Representing real numbers in a generalized numeration system
• Decimations of languages and state complexity
• The robustness of LWPP and WPP, with an application to graph reconstruction

This page was built for publication: The set of minimal words of a context-free language is context-free

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