The following pages link to (Q5610821):
Displaying 33 items.
- On completion of codes with finite deciphering delay (Q757324) (← links)
- The Ehrenfeucht conjecture: A compactness claim for finitely generated free monoids (Q798007) (← links)
- An extension to trees of the Sardinas and Patterson algorithm (Q1050318) (← links)
- Test sets for morphisms with bounded delay (Q1067414) (← links)
- Systèmes entiers d'équations sur un alphabet fini et conjecture d'Ehrenfeucht (Q1087020) (← links)
- Le degré minimal du groupe d'un code biprefixe fini (Q1132193) (← links)
- Sur le théorème du defaut (Q1132974) (← links)
- La représentation ergodique d'un automate fini (Q1133897) (← links)
- A representation of trees by languages. II (Q1137390) (← links)
- Regular semigroups with D=R as syntactic monoids of prefix codes (Q1146016) (← links)
- Maximal codes with bounded deciphering delay (Q1177932) (← links)
- Prefix codes, trees, and automata (Q1217779) (← links)
- On monoids presented by a single relation (Q1218040) (← links)
- Transductions des langages de Chomsky (Q1220392) (← links)
- Epimorphisms of free monoids (Q1236626) (← links)
- On codes having no finite completions (Q1239130) (← links)
- Regular prefix codes and right power-bounded languages (Q1241492) (← links)
- A representation of trees by languages. I (Q1246271) (← links)
- A combinatorial property of codes having finite synchronization delay (Q1247946) (← links)
- A feature constraint system for logic programming with entailment (Q1314426) (← links)
- Locally complete sets and finite decomposable codes (Q1605335) (← links)
- Synchronization and decomposability for a family of codes. II (Q1893165) (← links)
- On the word problem for special monoids (Q2163877) (← links)
- Bracketed context-free languages (Q2525996) (← links)
- Codes et motifs (Q3031953) (← links)
- On a complete set of operations for factorizing codes (Q3374755) (← links)
- Bi-infinitary codes (Q3479527) (← links)
- (Q3683550) (← links)
- (Q4146262) (← links)
- Codes asynchrones (Q4173294) (← links)
- (Q4198080) (← links)
- Sur certains sous-monoïdes libres (Q5527869) (← links)
- On codes with a finite deciphering delay: Constructing uncompletable words (Q5941067) (← links)
