LINEAR-TIME PRIME DECOMPOSITION OF REGULAR PREFIX CODES

DOI10.1142/S0129054103002151zbMath1101.68646OpenAlexW2046033718MaRDI QIDQ5696951

Jurek Czyzowicz, Andrzej Pelc, Wojciech Fraczak, Wojciech Rytter

Publication date: 19 October 2005

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

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

zbMATH Keywords

finite automataregular languagesprefix codesconcatenationprime decompositiond-articulation states

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (9)

Conjugacy relations of prefix codes ⋮ INFIX-FREE REGULAR EXPRESSIONS AND LANGUAGES ⋮ OVERLAP-FREE LANGUAGES AND SOLID CODES ⋮ On the existence of prime decompositions ⋮ Length Codes, Products of Languages and Primality ⋮ On Language Decompositions and Primality ⋮ On the decomposition of prefix codes ⋮ Language Decompositions, Primality, and Trajectory-Based Operations ⋮ Variants of codes and indecomposable languages

Cites Work

• Unnamed Item
• Unnamed Item

This page was built for publication: LINEAR-TIME PRIME DECOMPOSITION OF REGULAR PREFIX CODES