A characterization of s-languages

DOI10.1016/J.IPL.2003.10.006MaRDI QIDQ1029050zbMATH OpenOpenAlexFDO

Authors Wojciech Fraczak, Anna Podolak

Publication date 9 July 2009

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2003.10.006

zbMATH Keywords

formal languagesminimal deterministic automatonprefix codes-language

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Algorithmic ways of deciding whether an infinite language is a code
• Intercodes and the semigroups they generate
• Some algorithms on the star operation applied to finite languages
• scientific article; zbMATH DE number 3856432

Cites work

• scientific article; zbMATH DE number 4037246 (Why is no real title available?)
• scientific article; zbMATH DE number 3490487 (Why is no real title available?)
• scientific article; zbMATH DE number 3497806 (Why is no real title available?)
• scientific article; zbMATH DE number 1962770 (Why is no real title available?)
• scientific article; zbMATH DE number 941396 (Why is no real title available?)
• Notes on top-down languages

Cited in

(4)

• Disjunctive splittability of languages
• scientific article; zbMATH DE number 95311 (Why is no real title available?)
• Languages that require full scanning of words to determine membership
• Prime normal form and equivalence of simple grammars

This page was built for publication: A characterization of s-languages

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