On Some Properties of Graph of Prefix Code (original) (raw)
Related papers
Prime Decompositions of Regular Prefix Codes
Lecture Notes in Computer Science, 2003
2005
On Some Properties of Maximal Prefix Codes and Machine Learning for Automata
Frontiers in artificial intelligence and applications, 2024
On the lattice of prefix codes
Theoretical Computer Science, 2002
On the minimum distance graph of an extended Preparata code
Kevin Phelps, Cristina Fernandez-Cordoba
Designs, Codes and Cryptography, 2010
A combinatorial property of finite prefix codes
Information and Control, 1978
A Note on the Maximum Size of a Prefix Code
IEEE Access
Descriptional and computational complexity of finite automata—A survey
Information and Computation, 2011
On the Maximum Size of a Prefix Code
On equations for regular languages, finite automata, and sequential networks
Theoretical Computer Science, 1980
A study of the total graph in genetic code algebra
Network Biology, 2022
New Theoretical and Computational Results For Regular Languages
1991
THEORY OF COMPUTER SCIENCE Automata, Languages and Computation THIRD EDITION
Shailesh Kumar Mishra xrygVEJVTj
Formal Languages and Automata Theory
On viewing block codes as finite automata
Theoretical Computer Science, 2003
Searching on combinatorial structures and integer codes
An O(n 2 ) Time Algorithm for Deciding Whether a Regular Language is a Code
On universal computably enumerable prefix codes
Mathematical Structures in Computer Science, 2009
The minimum identifying code graphs
Discrete Applied Mathematics, 2012
A Study on Prime Labeling of Some Special Graphs
International Journal of Scientific Research in Science, Engineering and Technology IJSRSET
On the Representation of Finite Automata
Computing Research Repository, 2009
Codes, orderings, and partial words
Theoretical Computer Science, 2004
On the stabilizers of the minimum-weight codewords of some binary codes from graphs on triples
Quaestiones Mathematicae, 2007
Finite Automata, Digraph Connectivity, and Regular Expression Size
Lecture Notes in Computer Science, 2008
Identifying Codes over L-graphs
2011
A graph theoretic approach to automata minimality
Theoretical Computer Science, 2012
Acta Cybernetica, 1994
Binary codes and permutation decoding sets from the graph products of cycles
Binary codes and partial permutation decoding sets from the odd graphs
Central European Journal of Mathematics, 2014
Finite automata on directed graphs
Journal of Computer and System Sciences, 1992
On the structure of compacted subword graphs of Thue–Morse words and their applications
Jakub Radoszewski, Wojciech Rytter
Journal of Discrete Algorithms, 2012
Automata Theory and Formal Languages
Texts in Computer Science, 2021