On a question of McNaughton and Papert
From MaRDI portal
Publication:4766057
DOI10.1016/S0019-9958(74)90821-3zbMath0279.68054MaRDI QIDQ4766057
Publication date: 1974
Published in: Information and Control (Search for Journal in Brave)
Formal languages and automata (68Q45) Representation of semigroups; actions of semigroups on sets (20M30)
Related Items (27)
On varieties of rational languages and variable length codes. II ⋮ Code theory and fuzzy subsemigroups ⋮ On primitive words with non-primitive product ⋮ Unnamed Item ⋮ A completion algorithm for codes with bounded synchronization delay ⋮ Primitive sets of words ⋮ Unnamed Item ⋮ On some properties of very pure codes ⋮ On optimal factorization of free semigroups into free subsemigroups ⋮ Reducing the local alphabet size in tiling systems by means of 2D comma-free codes ⋮ Recognizability of morphisms ⋮ Codes and local constraints ⋮ On varieties of rational languages and variable-length codes ⋮ A note on renewal systems ⋮ The Karoubi envelope of the mirage of a subshift ⋮ On the fixpoints of monogenic functions in free monoids ⋮ A note on pure codes ⋮ Properties of pure codes ⋮ Pseudo-cyclic renewal systems ⋮ Properties of code events and homomorphisms over regular events ⋮ A combinatorial property of codes having finite synchronization delay ⋮ Circular codes and synchronization ⋮ Synchronization and simplification ⋮ Cyclic renewal systems ⋮ Codes engendrant certains systèmes sofiques. (Codes generating certain sofic systems) ⋮ Some methods for generating infinite sequences ⋮ The alphabetic complexity in homomorphic definitions of word, tree and picture languages
This page was built for publication: On a question of McNaughton and Papert
