On a Problem of Satyanarayana Regarding the Recognizability of Codes
RD Giri - Algebra and its Applications: ICAA, Aligarh, India …, 2016 - Springer
M. Satyanarayana posed a problem in 2001: which infinite codes are recognizable.
Recognizable code means a code accepted by a finite automaton. Equivalently a code X is …
Recognizable code means a code accepted by a finite automaton. Equivalently a code X is …
On the recognizability of right complete codes
RD Giri - Journal of Automata, Languages and Combinatorics, 2015 - dl.acm.org
A code or a language X is recognizable if and only if it can be presented by a regular
expression. Alternatively X is recognizable if the family of sets u-1X is finite. It is natural to …
expression. Alternatively X is recognizable if the family of sets u-1X is finite. It is natural to …
[PDF][PDF] REMARKS ON SEMAPHORE CODES
I Babcsányi - math.bme.hu
Abstract In [4] M. Satyanarayana raised the following two problems: 1. Find necessary and
sufficient conditions when a right complete code L over an alphabet A satisfies one of the …
sufficient conditions when a right complete code L over an alphabet A satisfies one of the …