Canonical subalgebraic bases in non-commutative polynomial rings
ISSAC '98 Proceedings of the 1998 international symposium on Symbolic and algebraic computation
The expressibility of languages and relations by word equations
Journal of the ACM (JACM)
On some Schützenberger conjectures
Information and Computation
Confluence problems for trace rewriting systems
Information and Computation
The commutation of finite sets: a challenging problem
Theoretical Computer Science
Some combinatorial results on Bernoulli sets and codes
Theoretical Computer Science
On maximal codes with a finite interpreting delay
Theoretical Computer Science
Locally complete sets and finite decomposable codes
Theoretical Computer Science
Error-detecting properties of languages
Theoretical Computer Science
On the lattice of prefix codes
Theoretical Computer Science
A non-ambiguous decomposition of regular languages and factorizing codes
Discrete Applied Mathematics
Periodicity vectors for labelled trees
Discrete Applied Mathematics
The homomorphism problem for the free monoid
Discrete Mathematics
Squaring transducers: an efficient procedure for deciding functionality and sequentiality
Theoretical Computer Science
Theoretical Computer Science
Factorizing Codes and Schützenberger Conjectures
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
The Branching Point Approach to Conway's Problem
Formal and Natural Computing - Essays Dedicated to Grzegorz Rozenberg [on occasion of his 60th birthday, March 14, 2002]
Constructing Finite Maximal Codes from Schützenberger Conjecture
ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
The Commutation with Codes and Ternary Sets of Words
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
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
Automata and Computational Probabilities
WIA '98 Revised Papers from the Third International Workshop on Automata Implementation
WIA '98 Revised Papers from the Third International Workshop on Automata Implementation
SEA: A Symbolic Environment for Automata Theory
WIA '99 Revised Papers from the 4th International Workshop on Automata Implementation
Brzozowski's Derivatives Extended to Multiplicities
CIAA '01 Revised Papers from the 6th International Conference on Implementation and Application of Automata
Some Petri Net Languages and Codes
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
The Entropy of Lukasiewicz-Languages
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
DNA '00 Revised Papers from the 6th International Workshop on DNA-Based Computers: DNA Computing
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
Characterization results for time-varying codes
Fundamenta Informaticae
The branching point approach to Conway's problem
Formal and natural computing
On the sentence valuation in a semiring
Information Sciences—Informatics and Computer Science: An International Journal
Coding properties of DNA languages
Theoretical Computer Science
Regular component decomposition of regular languages
Theoretical Computer Science
Combinatorial properties of codes with degree n
European Journal of Combinatorics
Theoretical Computer Science
Completion of codes with finite bi-decoding delays
Theoretical Computer Science
Theoretical Computer Science - WORDS
The homomorphism problem for trace monoids
Theoretical Computer Science - WORDS
Derivatives of rational expressions and related theorems
Theoretical Computer Science - Implementation and application automata
On numerically decipherable codes and their homophonic partitions
Information Processing Letters
A characterization of complete finite prefix codes in an arbitrary submonoid of A
Journal of Automata, Languages and Combinatorics
Many aspects of defect theorems
Theoretical Computer Science - Words, languages and combinatorics
Border correlation of binary words
Journal of Combinatorial Theory Series A
Language equations, maximality and error-detection
Journal of Computer and System Sciences
Partial words and the critical factorization theorem
Journal of Combinatorial Theory Series A
Theoretical Computer Science - Descriptional complexity of formal systems
Codes, orderings, and partial words
Theoretical Computer Science
Theoretical Computer Science - Insightful theory
Completions in measure of languages and related combinatorial problems
Theoretical Computer Science - Insightful theory
Meta-EAH: an adaptive encoder based on adaptive codes. Moving between adaptive mechanisms
ISICT '04 Proceedings of the 2004 international symposium on Information and communication technologies
Encyclopedia of Computer Science
Involution codes: with application to DNA coded languages
Natural Computing: an international journal
The structure of reflexive regular splicing languages via Schützenberger constants
Theoretical Computer Science
Codes of central Sturmian words
Theoretical Computer Science - The art of theory
An enhanced property of factorizing codes
Theoretical Computer Science - The art of theory
Growth of repetition-free words: a review
Theoretical Computer Science - The art of theory
Theoretical Computer Science - The art of theory
Regular splicing languages and subclasses
Theoretical Computer Science - The art of theory
A hierarchy of shift equivalent sofic shifts
Theoretical Computer Science - Mathematical foundations of computer science 2004
A language-theoretic approach to covering problems
Journal of Automata, Languages and Combinatorics
Linear splicing and syntactic monoid
Discrete Applied Mathematics
Codes, unambiguous automata and sofic systems
Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
Completing prefix codes in submonoids
Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
On the power of circular splicing
Discrete Applied Mathematics - Special issue: Max-algebra
Remarks on arbitrary multiple pattern interpretations
Information Processing Letters
Computational Biology and Chemistry
Block Substitutions and Their Properties
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
On the Completion of Codes in Submonoids with Finite Rank
Fundamenta Informaticae - SPECIAL ISSUE MCU2004
Fundamenta Informaticae
European Journal of Combinatorics
An algorithmic approach to the problem of a semiretract base
Theoretical Computer Science
Coding with variable block maps
Theoretical Computer Science
On codes defined by bio-operations
Theoretical Computer Science
Periodicity and unbordered words: A proof of the extended duval conjecture
Journal of the ACM (JACM)
Note: On a zeta function associated with automata and codes
Theoretical Computer Science
Existence of finite test-sets for k-power-freeness of uniform morphisms
Discrete Applied Mathematics
Relatively regular languages and thin codes
European Journal of Combinatorics
Prefix-free regular languages and pattern matching
Theoretical Computer Science
Theoretical Computer Science
Completing circular codes in regular submonoids
Theoretical Computer Science
A 2006 review of circular codes in genes
Computers & Mathematics with Applications
Fuzzification of Rational and Recognizable Sets
Fundamenta Informaticae
A relation between trinucleotide comma-free codes and trinucleotide circular codes
Theoretical Computer Science
Information and Computation
How Many Figure Sets Are Codes?
Language and Automata Theory and Applications
The Average State Complexity of the Star of a Finite Set of Words Is Linear
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
On a Generalization of Standard Episturmian Morphisms
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Learning Subclasses of Pure Pattern Languages
ICGI '08 Proceedings of the 9th international colloquium on Grammatical Inference: Algorithms and Applications
Simple-regular expressions and languages
Journal of Automata, Languages and Combinatorics
Involution Solid and Join codes
Fundamenta Informaticae
Discrete Applied Mathematics
Nondeterministic State Complexity of Basic Operations for Prefix-Free Regular Languages
Fundamenta Informaticae
On universal computably enumerable prefix codes
Mathematical Structures in Computer Science
A Class by Principal Congruence of a Syntactically Embedded Language
IEICE - Transactions on Information and Systems
Decision Problems for Convex Languages
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
State Complexity of Combined Operations for Prefix-Free Regular Languages
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Conjugacy of finite biprefix codes
Theoretical Computer Science
Theoretical Computer Science
State complexity of basic operations on suffix-free regular languages
Theoretical Computer Science
Characteristic morphisms of generalized episturmian words
Theoretical Computer Science
Theoretical Computer Science
Circular sturmian words and Hopcroft's algorithm
Theoretical Computer Science
Completing codes in a sofic shift
Theoretical Computer Science
On the size of Boyer-Moore automata
Theoretical Computer Science
Unique Decipherability in the Monoid of Languages: An Application of Rational Relations
CSR '09 Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications
On the Reversibility of Parallel Insertion, and Its Relation to Comma Codes
CAI '09 Proceedings of the 3rd International Conference on Algebraic Informatics
Deciding determinism of caterpillar expressions
Theoretical Computer Science
A characterization of regular circular languages generated by marked splicing systems
Theoretical Computer Science
On the growth of context-free languages
Journal of Automata, Languages and Combinatorics
Theoretical Computer Science
On the power of circular splicing
Discrete Applied Mathematics
Linear splicing and syntactic monoid
Discrete Applied Mathematics
Scenarios and Covert Channels: Another Game...
Electronic Notes in Theoretical Computer Science (ENTCS)
Transducers for the bidirectional decoding of prefix codes
Theoretical Computer Science
Theoretical Computer Science
Collision free hash functions and public key signature schemes
EUROCRYPT'87 Proceedings of the 6th annual international conference on Theory and application of cryptographic techniques
Decision problems for linear and circular splicing systems
DLT'02 Proceedings of the 6th international conference on Developments in language theory
The average lengths of the factors of the standard factorization of lyndon words
DLT'02 Proceedings of the 6th international conference on Developments in language theory
Finite completion of comma-free codes: part I
DLT'02 Proceedings of the 6th international conference on Developments in language theory
On a family of codes with bounded deciphering delay
DLT'02 Proceedings of the 6th international conference on Developments in language theory
Covering problems from a formal language point of view
DLT'03 Proceedings of the 7th international conference on Developments in language theory
Regular languages generated by reflexive finite splicing systems
DLT'03 Proceedings of the 7th international conference on Developments in language theory
CIAA'03 Proceedings of the 8th international conference on Implementation and application of automata
Coding partitions: regularity, maximality and global ambiguity
DLT'07 Proceedings of the 11th international conference on Developments in language theory
Reduced languages as ω-generators
DLT'07 Proceedings of the 11th international conference on Developments in language theory
Deterministic caterpillar expressions
CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
Watson-Crick conjugate and commutative words
DNA13'07 Proceedings of the 13th international conference on DNA computing
On the regularity of circular splicing languages: a survey and new developments
Natural Computing: an international journal
On the number of episturmian palindromes
Theoretical Computer Science
Automata with extremal minimality conditions
DLT'10 Proceedings of the 14th international conference on Developments in language theory
DNA computing: a research snapshot
Algorithms and theory of computation handbook
Directed figure codes: decidability frontier
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Construction of minimal deterministic finite automata from biological motifs
Theoretical Computer Science
Codes base on unambiguous products
ICCCI'10 Proceedings of the Second international conference on Computational collective intelligence: technologies and applications - Volume Part III
Symbolic dynamics, flower automata and infinite traces
CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
Regular splicing languages must have a constant
DLT'11 Proceedings of the 15th international conference on Developments in language theory
Complete codes in a sofic shift
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Prime decomposition problem for several kinds of regular codes
ICTAC'06 Proceedings of the Third international conference on Theoretical Aspects of Computing
DNA codes and their properties
DNA'06 Proceedings of the 12th international conference on DNA Computing
Complexity of operations on cofinite languages
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Central sturmian words: recent developments
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
Varieties of codes and kraft inequality
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
A classification of 20-trinucleotide circular codes
Information and Computation
Finite sets of words and computing
MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality
Completing a code in a regular submonoid of the free monoid
MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality
DNA'04 Proceedings of the 10th international conference on DNA computing
Concatenation state machines and simple functions
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
On the Hausdorff measure of ω-power languages
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
A unified algorithm for extending classes of languages identifiable in the limit from positive data
ICGI'06 Proceedings of the 8th international conference on Grammatical Inference: algorithms and applications
Complexity in convex languages
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Primitive words are unavoidable for context-free languages
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
How to strengthen pseudo-random generators by using compression
EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
Involution solid and join codes
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
Recombinant DNA ,gene splicing as generative devices of formal languages
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
Computational complexity of rule distributions of non-uniform cellular automata
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
A quadratic algorithm for testing of omega-codes
ACIIDS'12 Proceedings of the 4th Asian conference on Intelligent Information and Database Systems - Volume Part I
Theoretical Computer Science
K-Comma Codes and Their Generalizations
Fundamenta Informaticae
Infinite Traces and Symbolic Dynamics - the Minimal Shift Case
Fundamenta Informaticae
The Unique Decipherability in the Monoid of Regular Languages is Undecidable
Fundamenta Informaticae - Theory that Counts: To Oscar Ibarra on His 70th Birthday
Nondeterministic State Complexity of Basic Operations for Prefix-Free Regular Languages
Fundamenta Informaticae
Involution Solid and Join codes
Fundamenta Informaticae
Fundamenta Informaticae
Fuzzification of Rational and Recognizable Sets
Fundamenta Informaticae
Block Substitutions and Their Properties
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
On the Completion of Codes in Submonoids with Finite Rank
Fundamenta Informaticae - SPECIAL ISSUE MCU2004
A generalized palindromization map in free monoids
Theoretical Computer Science
Characterization Results for Time-Varying Codes
Fundamenta Informaticae
Fundamenta Informaticae
On Accepting Pure Lindenmayer Systems
Fundamenta Informaticae
State complexity of basic operations on suffix-free regular languages
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Acta Applicandae Mathematicae: an international survey journal on applying mathematics and mathematical applications
CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata
Multiplied complete fix-free codes and shiftings regarding the 3/4-conjecture
Information Theory, Combinatorics, and Search Theory
| Hi-index | 0.04 |