LINEAR-TIME PRIME DECOMPOSITION OF REGULAR PREFIX CODES
From MaRDI portal
Publication:5696951
DOI10.1142/S0129054103002151zbMath1101.68646MaRDI 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
finite automata; regular languages; prefix codes; concatenation; prime decomposition; d-articulation states
68Q45: Formal languages and automata
Related Items
INFIX-FREE REGULAR EXPRESSIONS AND LANGUAGES, Conjugacy relations of prefix codes, On the decomposition of prefix codes, On the existence of prime decompositions, Variants of codes and indecomposable languages, On Language Decompositions and Primality, OVERLAP-FREE LANGUAGES AND SOLID CODES, Length Codes, Products of Languages and Primality, Language Decompositions, Primality, and Trajectory-Based Operations
Cites Work