| ON THE POWER OF TWO-WAY MULTIHEAD QUANTUM FINITE AUTOMATA |
3 |
| REGULAR AND LINEAR PERMUTATION LANGUAGES |
1 |
| CIRCULAR CRITICAL EXPONENTS FOR THUE-MORSE FACTORS |
1 |
| AN EFFICIENT CERTIFICATELESS MULTI-RECEIVER THRESHOLD DECRYPTION SCHEME |
1 |
| STATE HYPERSTRUCTURES OF TREE AUTOMATA BASED ON LATTICE-VALUED LOGIC |
1 |
| Derived sequences of complementary symmetric Rote sequences |
1 |
| Parameterizing higher-order processes on names and processes*** |
0 |
| Edge-bipancyclicity in conditional edge-faulty k-ary n-cubes* |
0 |
| On the length of uncompletable words in unambiguous automata |
0 |
| MINIMUM PARAMETRIC FLOW IN TIME-DEPENDENT DYNAMIC NETWORKS |
0 |
| THE INCLUSION STRUCTURE OF PARTIALLY LOSSY QUEUE MONOIDS AND THEIR TRACE SUBMONOIDS |
0 |
| ON DESCRIBING THE REGULAR CLOSURE OF THE LINEAR LANGUAGES WITH GRAPH-CONTROLLED INSERTION-DELETION SYSTEMS |
0 |
| ON WINNING SHIFTS OF MARKED UNIFORM SUBSTITUTIONS |
0 |
| THE COMPLEXITY OF WEAKLY RECOGNIZING MORPHISMS |
0 |
| LANGUAGE CLASSES ASSOCIATED WITH AUTOMATA OVER MATRIX GROUPS |
0 |
| AUTOMATA WITH CYCLIC MOVE OPERATIONS FOR PICTURE LANGUAGES |
0 |
| ON DOUBLE-JUMPING FINITE AUTOMATA AND THEIR CLOSURE PROPERTIES |
0 |
| EXPRESSIVE CAPACITY OF SUBREGULAR EXPRESSIONS |
0 |
| RANDOMIZED GENERATION OF ERROR CONTROL CODES WITH AUTOMATA AND TRANSDUCERS |
0 |
| THE COMPLEXITY OF CONCATENATION ON DETERMINISTIC AND ALTERNATING FINITE AUTOMATA |
0 |
| DIVING INTO THE QUEUE |
0 |
| ON BONDED SEQUENTIAL AND PARALLEL INSERTION SYSTEMS |
0 |
| UNCOUNTABLE CLASSICAL AND QUANTUM COMPLEXITY CLASSES |
0 |
