How to generate binary codes using context-free grammars

MaRDI QIDQ2754902zbMATH OpenFDO

Authors L. Kászonyi

Publication date 22 June 2005

Published in Alkalmazott Matematikai Lapok. A Magyar Tudomanyos Akademia. Matematikai es Fizikai Tudomanyok Osztalyanak Közlemenyei (Search for Journal in Brave)

zbMATH Keywords

context-free grammars

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Combinatorics on words (68R15)

Recommendations

• HOW TO GENERATE BINARY CODES USING CONTEXT-FREE GRAMMARS
• Some new results on the context-freeness of languages \(Q\cap (ab^*)^n\)
• Binary Tree Code Words as Context-Free Languages
• scientific article; zbMATH DE number 1528638
• scientific article; zbMATH DE number 522846

Cited in

(5)

• Some new results on the context-freeness of languages \(Q\cap (ab^*)^n\)
• scientific article; zbMATH DE number 166134 (Why is no real title available?)
• Semiperiodic vectors and the context-freeness of \(Q_ n = Q\cap (ab^*)^n\)
• HOW TO GENERATE BINARY CODES USING CONTEXT-FREE GRAMMARS
• Bidirectional grammars for machine-code decoding and encoding

This page was built for publication: How to generate binary codes using context-free grammars

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