Formal and Natural Computing - Essays Dedicated to Grzegorz Rozenberg [on occasion of his 60th birthday, March 14, 2002]
Shuffle Quotient and Decompositions
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Formal and natural computing
Automatic synthesis of a subclass of schedulers in timed systems
Theoretical Computer Science - Australasian computer science
A loopless algorithm for generating the permutations of a multiset
Theoretical Computer Science - Random generation of combinatorial objects and bijective combinatorics
Trajectory-based embedding relations
Fundamenta Informaticae
Theoretical Computer Science
On properties of bond-free DNA languages
Theoretical Computer Science
State complexity of shuffle on trajectories
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the fourth international workshop on descriptional complexity of formal systems
Decidability of trajectory-based equations
Theoretical Computer Science - Mathematical foundations of computer science 2004
Aspects of shuffle and deletion on trajectories
Theoretical Computer Science
Contextual Grammars with Uniform Sets of Trajectories
Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Synchronized Shuffle on Backbones
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Routes and Products of Monoids
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Codes defined by multiple sets of trajectories
Theoretical Computer Science
Algebraic properties of substitution on trajectories
Theoretical Computer Science
Infinite unfair shuffles and associativity
Theoretical Computer Science
Language Decompositions, Primality, and Trajectory-Based Operations
CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
Characterizing DNA Bond Shapes Using Trajectories
Fundamenta Informaticae
Associativity of Infinite Synchronized Shuffles and Team Automata
Fundamenta Informaticae
Permutation Languages in Formal Linguistics
IWANN '09 Proceedings of the 10th International Work-Conference on Artificial Neural Networks: Part I: Bio-Inspired Systems: Computational and Ambient Intelligence
On the Reversibility of Parallel Insertion, and Its Relation to Comma Codes
CAI '09 Proceedings of the 3rd International Conference on Algebraic Informatics
Languages generated by context-free grammars extended by type AB → BA rules
Journal of Automata, Languages and Combinatorics
Block insertion and deletion on trajectories
Theoretical Computer Science
On language decompositions and primality
Rainbow of computer science
Shuffle on trajectories over finite array languages
IWCIA'11 Proceedings of the 14th international conference on Combinatorial image analysis
Recognizing shuffled languages
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
Hairpin structures defined by DNA trajectories
DNA'06 Proceedings of the 12th international conference on DNA Computing
Preventing undesirable bonds between DNA codewords
DNA'04 Proceedings of the 10th international conference on DNA computing
Substitutions, trajectories and noisy channels
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
Semantic shuffle on and deletion along trajectories
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
Characterizing DNA bond shapes using trajectories
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
Associativity of Infinite Synchronized Shuffles and Team Automata
Fundamenta Informaticae
Characterizing DNA Bond Shapes Using Trajectories
Fundamenta Informaticae
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Synchronized Shuffle on Backbones
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Routes and Products of Monoids
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Contextual Grammars with Uniform Sets of Trajectories
Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
Trajectory-Based Embedding Relations
Fundamenta Informaticae
The poor man's proof assistant: using prolog to develop formal language theoretic proofs
Proceedings of the 2013 companion publication for conference on Systems, programming, & applications: software for humanity
The poor man's proof assistant: using prolog to develop formal language theoretic proofs
Proceedings of the 2013 companion publication for conference on Systems, programming, & applications: software for humanity
Theoretical Computer Science
| Hi-index | 5.24 |