TAILIEUCHUNG - B-codes and their relationship with alternative codes

Codes of bounded words (b-codes, ♦-codes), an extension of the notion of ordinary codes, have been first introduced and considered by P. T. Huy et al. in 2009. In this note, we consider some new subclasses of b-codes. In particular, characteristic properties of such codes are established. Also, relationships between b-codes, alternative codes and their subclasses are considered. | Journal of Computer Science and Cybernetics, , (2017), 263–271 DOI B-CODES AND THEIR RELATIONSHIP WITH ALTERNATIVE CODES NGO THI HIEN Ha Noi University of Science and Technology; Abstract. Codes of bounded words (b-codes, ♦-codes), an extension of the notion of ordinary codes, have been first introduced and considered by P. T. Huy et al. in 2009. In this note, we consider some new subclasses of b-codes. In particular, characteristic properties of such codes are established. Also, relationships between b-codes, alternative codes and their subclasses are considered. Keywords. Alternative code, b-code, norm b-code, two-side b-code, left b-code, strict b-code. Mathematics Subject Classification (2010): 94A45, 68Q45. 1. INTRODUCTION The theory of length-variable codes has been initiated by M. P. Sch¨ utzenberger in the 1950s and then developed by many others. A direction in this theory concentrates studying codes defined by control parameters or related with multi-value [1, 2, 4, 10, 13, 14, 16]. A code is a language such that every text encoded by words of the language can be decoded in a unique way. Codes are useful in many areas of application such as information processing, data compression, cryptography, information transmission and so on. For background of the theory of codes we refer to [3, 11, 15]. As mentioned above, the definition of codes is essentially based on unambiguity of the (catenation) product of words. Different modifications of such a product may lead to different extensions of the notion of codes. Such an approach has been proposed by P. T. Huy et al. which deals with the so-called even alternative codes and codes of bounded words (or ♦-codes, for short) [5, 6, 7, 10, 17, 18, 19, 20]. They demonstrated the importance characterizations as well as algorithms to test for these classes. For simplicity, ♦-codes, weak left ♦-codes, weak right ♦-codes and strict ♦-codes in [17, 18] are

• Cơ sở dữ liệu
• Journal of Computer Science and Cybernetics
• B codes and their relationship with alternative codes
• B codes and their relationshi
• Norm b code
• Two side b code
• Left b code
• strict b code
• Mathematics Subject Classification
• Nonstandard finite difference schemes
• Solving a modified epidemiological model for computer viruses
• Nonstandard finite difference
• Computer virus propagation model
• Multi objective evolutionary algorithms
• Evolutionary algorithms and foundation
• development and open issues
• EC enables computer scientists
• Evolutionary algorithms designed
• Learning interaction measure
• Relevance feedback in image retrieval
• Multi feature query
• The fuzzy density values
• Quality of transmission aware routing in ad hoc networks
• Cross layer model combined
• The static agent
• Ad hoc networks
• QoT aware routing
• sattic agent
• Algorithm to build fuzzy decision tree for data classification problem
• Fuzziness intervals matching
• Fuzzy decision tree
• The fuzzy data mining problem
• Hedges algebras and fuzzy partition problem for qualitative attributes
• Construct the membership functions
• Fuzzy Association Rules
• Member ship functions
• Characterizations for several classes of alternative codes
• Several classes of alternative codes
• norm alternative code
• Left norm alternative code
• Two sided alternative code
• Left alternative code
• Strict alternative code
• Packet classification algorithm
• Multi way priority trie
• Significant number of researchers
• Both theoretically and experimentally proved
• Solving min max capacitated vehicle routing problem by local search
• Solving min max capacitated vehicle routing problem
• Solving min max capacitated
• Proposed algorithms compared
• Novel control approach for optimal power flow
• Hybrid wind photovoltaic diesel generation systems
• Diesel generation systems
• Analytical control model
• Mobile ad hoc network
• Valid route testing mechanism
• Using Network Simulator
• Random movement network topology
• Rough set theory
• Polynomial time complexity
• Algorithm finding object reducts
• Improved genetic algorithm
• Test data generation for simulink models
• Conventional genetic algorithm
• Generate test data for Simulink models
• Nonholonomic wheeled mobile robot
• Wheeled mobile robot
• Function neural network
• Unknown external disturbances
• Modeling the differential motion of a mobile manipulator
• Designing a new visual servoing
• Tracking a flying target
• Reinforcement learning algorithm
• Efficient navigation framework
• Autonomous mobile robots
• The mobile robots
• Interpolation based on semantic distance weighting
• Hedge algebra and its application
• Semantic distance weighting
• Bi linear interpolation
• Linguistic rule base system
• Transform the current Web
• Conceptual data model
• Ti meER model
• The temporal databases into OWL ontology
• The ER model into ontology
• Sliding mode control
• Sliding mode control for a planar parallel robot driven
• Electric motors in a task space
• The substructure method
• Greedy Randomized Adaptive Search Procedure
• Multiple Traveling Repairmen Problem with Distance Constraints
• Variable Neighborhood Descent
• Traveling Repairman Problem
• On the real world semantics interpretability
• Fuzzy rule based systems under fuzzy set approach
• Hedge algebra approach
• The RWS interpretability
• Alternating current electrical systems
• Integer quadratic programming
• Non linear knapsack problems arising
• Polynomial time approximation schemes
• Statistical implication rules
• Collaborative filtering recommender system
• Statistical implicative analysis
• The accuracy of recommender systems
• Picture fuzzy sets
• Picture fuzzy t norms
• Picture fuzzy t conorm
• De Morgan picture operator triple
• Taxonomic assignment for large scale metagenomic data
• High perfomance systems
• Large scale metagenomic data
• Achieve good performance