Polypodic codes

DOI10.1051/ITA:2002002zbMATH Open1013.68085OpenAlexW4239376074MaRDI QIDQ4800263FDOQ4800263

Authors: Symeon Bozapalidis, Olympia Louscou-Bozapalidou 

Publication date: 2 April 2003

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=ITA_2002__36_1_5_0

Recommendations

• Grammatical codes of trees
• scientific article; zbMATH DE number 475410
• scientific article; zbMATH DE number 3985118
• Properties of grammatical codes of trees
• Codes, orderings, and partial words

zbMATH Keywords

code decomposition

Mathematics Subject Classification ID

Applications of graph theory (05C90) Combinatorics in computer science (68R05) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Cites Work

• Bottom-up and top-down tree transformations— a comparison
• Title not available (Why is that?)
• Title not available (Why is that?)
• Superassociative systems and logical functors
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (3)

• Title not available (Why is that?)
• Polyadic Codes Revisited
• Title not available (Why is that?)

This page was built for publication: Polypodic codes

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