Theoretical Aspects of Computing – ICTAC 2005

DOI10.1007/11560647zbMATH Open1169.68474OpenAlexW4300984554MaRDI QIDQ5395094

Yo-Sub Han, D. Wood

Publication date: 1 November 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11560647

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Prefix, length-variable, comma-free codes (94A45)

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Complexity of suffix-free regular languages 👍 👎
• Non-regular Maximal Prefix-Free Subsets of Regular Languages 👍 👎
• Complexity of Suffix-Free Regular Languages 👍 👎
• On Language Decompositions and Primality 👍 👎
• Prime Decompositions of Regular Languages 👍 👎
• Minimal Union-Free Decompositions of Regular Languages 👍 👎
• Prefix-Free Subsets of Regular Languages and Descriptional Complexity 👍 👎

This page was built for publication: Theoretical Aspects of Computing – ICTAC 2005

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