Iterated function systems and control languages
Information and Computation
Error-detecting properties of languages
Theoretical Computer Science
Codes, Involutions, and DNA Encodings
Formal and Natural Computing - Essays Dedicated to Grzegorz Rozenberg [on occasion of his 60th birthday, March 14, 2002]
Improving Information Retrieval System Security via an Optimal Maximal Coding Scheme
EurAsia-ICT '02 Proceedings of the First EurAsian Conference on Information and Communication Technology
The Root of a Language and Its Complexity
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Coding Properties of DNA Languages
DNA 7 Revised Papers from the 7th International Workshop on DNA-Based Computers: DNA Computing
PCM '01 Proceedings of the Second IEEE Pacific Rim Conference on Multimedia: Advances in Multimedia Information Processing
Codes, involutions, and DNA encodings
Formal and natural computing
Coding properties of DNA languages
Theoretical Computer Science
Asymptotically optimal low-cost solid codes
Journal of Automata, Languages and Combinatorics
Language equations, maximality and error-detection
Journal of Computer and System Sciences
Block Substitutions and Their Properties
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Fundamenta Informaticae
Codes defined by multiple sets of trajectories
Theoretical Computer Science
Outfix-Free Regular Languages and Prime Outfix-Free Decomposition
Fundamenta Informaticae
Information and Computation
Simple-regular expressions and languages
Journal of Automata, Languages and Combinatorics
Involution Solid and Join codes
Fundamenta Informaticae
Nondeterministic State Complexity of Basic Operations for Prefix-Free Regular Languages
Fundamenta Informaticae
Decision Problems for Convex Languages
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
State complexity of basic operations on suffix-free regular languages
Theoretical Computer Science
Markers and deterministic acceptors for non-deterministic languages
Journal of Automata, Languages and Combinatorics
Homomorphisms preserving types of density
Acta Cybernetica
Decision problems for convex languages
Information and Computation
Peptide computing: universality and theoretical model
UC'06 Proceedings of the 5th international conference on Unconventional Computation
Overlap-Free regular languages
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
Prime decomposition problem for several kinds of regular codes
ICTAC'06 Proceedings of the Third international conference on Theoretical Aspects of Computing
Bond-free languages: formalizations, maximality and construction methods
DNA'04 Proceedings of the 10th international conference on DNA computing
On codes defined by bio-operations
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
Codes and length-increasing transitive binary relations
ICTAC'05 Proceedings of the Second international conference on Theoretical Aspects of Computing
Outfix-free regular languages and prime outfix-free decomposition
ICTAC'05 Proceedings of the Second international conference on Theoretical Aspects of Computing
Complexity in convex languages
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Theoretical Computer Science
Involution solid and join codes
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
K-Comma Codes and Their Generalizations
Fundamenta Informaticae
Nondeterministic State Complexity of Basic Operations for Prefix-Free Regular Languages
Fundamenta Informaticae
Involution Solid and Join codes
Fundamenta Informaticae
Fundamenta Informaticae
Outfix-Free Regular Languages and Prime Outfix-Free Decomposition
Fundamenta Informaticae
Block Substitutions and Their Properties
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
State complexity of basic operations on suffix-free regular languages
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata
| Hi-index | 0.00 |