Bi-infinitary codes
From MaRDI portal
Publication:3479527
DOI10.1051/ITA/1990240100671zbMATH Open0701.68061OpenAlexW42421281MaRDI QIDQ3479527FDOQ3479527
Authors: Do Long Van, K. G. Subramanian, Rani Siromoney, Durairaj Gnanaraj Thomas 
Publication date: 1990
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/92350
Recommendations
- scientific article; zbMATH DE number 566083
- Finitary codes for biinfinite words
- On infinitary finite length codes
- On a class of infinitary codes
- Infinite words and biprefix codes
- scientific article; zbMATH DE number 858444
- Perfect binary codes of infinite length
- Maximal bifix codes
- Bifix codes and interval exchanges
- Finite maximal infix codes
Formal languages and automata (68Q45) Prefix, length-variable, comma-free codes (94A45) Semigroups in automata theory, linguistics, etc. (20M35)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Ensembles Reconnaissables de Mots Biinfinis
- Title not available (Why is that?)
- Title not available (Why is that?)
- Ensembles code-compatibles et une généralisation du théorème de Sardinas-Patterson
- Sous-monoides et codes avec des mots infinis
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (6)
This page was built for publication: Bi-infinitary codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3479527)
