Ensembles libres de chemins dans un graphe
From MaRDI portal
Publication:4724661
DOI10.24033/bsmf.2051zbMath0616.05043MaRDI QIDQ4724661
Publication date: 1986
Published in: Bulletin de la Société mathématique de France (Search for Journal in Brave)
Full work available at URL: http://www.numdam.org/item?id=BSMF_1986__114__135_0
Related Items
μ-Bicomplete Categories and Parity Games, Zeta Functions of Formal Languages, Completing codes in a sofic shift, Finite biprefix sets of paths in a graph, Bifix codes and Sturmian words, Codes and sofic constraints, Codes, unambiguous automata and sofic systems., Codes and Automata in Minimal Sets
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the factorization of codes
- Noncommutative factorization of variable-length codes
- Semisimplicity of the algebra associated to a biprefix code
- La transitivite du groupe d'un code biprefixe fini
- On Whitney's 2‐isomorphism theorem for graphs
- Sur certains sous-monoïdes libres