PREFIX-FREE ŁUKASIEWICZ LANGUAGES

DOI10.1142/S0129054107005455MaRDI QIDQ3401490zbMATH OpenOpenAlexFDO

Authors Ludwig Staiger

Publication date 29 January 2010

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0129054107005455

zbMATH Keywords

prefix codesdeterministic context-free languagesdelay of decipherability

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Measures of information, entropy (94A17)

Recommendations

• The boundary of prefix-free languages
• Prefix-free languages: left and right quotient and reversal
• Prefix-free languages: right quotient and reversal
• Prefix-free languages as \(\omega\)-generators
• scientific article; zbMATH DE number 3843156
• Prefix Primitive Languages
• Kuratowski algebras generated by prefix-free languages
• Concatenation-free languages
• n-Prefix–suffix languages^∗
• Star-complement-star on prefix-free languages

Cites work

• scientific article; zbMATH DE number 3943051 (Why is no real title available?)
• INFINITE ITERATED FUNCTION SYSTEMS IN CANTOR SPACE AND THE HAUSDORFF MEASURE OF ω-POWER LANGUAGES
• On the entropy of context-free languages

Cited in

(2)

• A generalization of the language of Łukasiewicz coding rooted planar hypermaps
• Strongly prefix codes and the generalized Raney formula

This page was built for publication: PREFIX-FREE ŁUKASIEWICZ LANGUAGES

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