Pages that link to "Item:Q2703009"

The following pages link to International Journal of Foundations of Computer Science (Q2703009):

Displaying 50 items.

• Uncountable realtime probabilistic classes (Q2400994) (← links)
• SPECIAL ISSUE ON INTERCONNECTION NETWORKS-EDITORS' FOREWORD (Q2703010) (← links)
• THE PERMUTATIONAL GRAPH: A NEW NETWORK TOPOLOGY (Q2703011) (← links)
• THE DIAMETER AND HAMILTONIAN CYCLE OF THE GENERALIZED DE BRUIJN GRAPHS <font>UG_B</font>(n, n(n+1)) (Q2703012) (← links)
• THE CUBE-OF-RINGS INTERCONNECTION NETWORK (Q2703014) (← links)
• A DYNAMIC SCHEDULING COMMUNICATION PROTOCOL AND ITS ANALYSIS FOR HYPERCUBE NETWORKS (Q2703015) (← links)
• NETWORK PROPERTIES OF DOUBLE AND TRIPLE FIXED STEP GRAPHS (Q2703016) (← links)
• SHUFFLE-RING: A NEW CONSTANT-DEGREE NETWORK (Q2703017) (← links)
• INTEGER SORTING AND ROUTING IN ARRAYS WITH RECONFIGURABLE OPTICAL BUSES (Q2703018) (← links)
• The Critical Exponent is Computable for Automatic Sequences (Q2789533) (← links)
• From Finite Automata to Regular Expressions and Back — A Summary on Descriptional Complexity (Q2800411) (← links)
• Simplification Problems for Deterministic Pushdown Automata on Infinite Words (Q2800412) (← links)
• A Survey on Decidable Equivalence Problems for Tree Transducers (Q2800413) (← links)
• Returning Parallel Communicating Finite Automata with Communication Bounds: Hierarchies, Decidabilities, and Undecidabilities (Q2800414) (← links)
• On Determinism and Unambiguity of Weighted Two-Way Automata (Q2800415) (← links)
• Optimal Bounds for the Similarity Density of the Thue-Morse Word with Overlap-Free and 73-Power-Free Infinite Binary Words (Q2800416) (← links)
• The Finite Index Restriction Meets Hybrid Modes in Cooperating Distributed Grammar Systems (Q2800417) (← links)
• Erratum: The Complexity of Satisfiability for Fragments of CTL and CTL^⋆ (Q2800418) (← links)
• EDZL Scheduling and Schedulability Analysis for Performance Asymmetric Multiprocessors (Q2806553) (← links)
• On the Computational Complexity of Finite Operations (Q2806555) (← links)
• Separability of <i>M</i>-Equivalent Words by Morphisms (Q2806556) (← links)
• New Constructions of Optimal Frequency-Hopping Sequence Sets with Low-Hit-Zone (Q2806557) (← links)
• On the Complexity of Concurrent Multiset Rewriting (Q2806558) (← links)
• Efficient Certificateless Proxy Signature Scheme (Q2806559) (← links)
• Past Present (Q2814832) (← links)
• Average Case Analysis of Brzozowski's Algorithm (Q2814833) (← links)
• Cayley Automatic Representations of Wreath Products (Q2814835) (← links)
• Set Automata (Q2814837) (← links)
• New Results on the Minimum Amount of Useful Space (Q2814840) (← links)
• The Complexity of Fixed-Height Patterned Tile Self-assembly (Q2830225) (← links)
• Derivative-Based Diagnosis of Regular Expression Ambiguity (Q2830226) (← links)
• Algorithms for Longest Common Abelian Factors (Q2833540) (← links)
• Parikh Matrices and Strong <i>M</i>-Equivalence (Q2833541) (← links)
• Subset Synchronization and Careful Synchronization of Binary Finite Automata (Q2833542) (← links)
• Belated Analyses of Three Credit-Based Adaptive Polling Algorithms (Q2833543) (← links)
• Secret Sharing Schemes from Linear Codes overFp + vFp (Q2833544) (← links)
• Self-Stabilizing Prefix Tree Based Overlay Networks (Q2833545) (← links)
• Abelian Complexity and Frequencies of Letters in Infinite Words (Q2833546) (← links)
• Corrigendum: "Simple Matrix Grammars and Their Leftmost Variants [3]" (Q2833548) (← links)
• ON PANSIOT WORDS AVOIDING 3-REPETITIONS (Q2841970) (← links)
• CONSTRUCTING PREMAXIMAL BINARY CUBE-FREE WORDS OF ANY LEVEL (Q2841971) (← links)
• SUBSTITUTIONS OVER INFINITE ALPHABET GENERATING (−<i>β</i>)-INTEGERS (Q2841973) (← links)
• UNARY PATTERNS WITH INVOLUTION (Q2841974) (← links)
• PERMUTATION COMPLEXITY AND THE LETTER DOUBLING MAP (Q2841975) (← links)
• FULL MONOIDS AND MAXIMAL CODES (Q2841976) (← links)
• BOUNDED PARIKH AUTOMATA (Q2841977) (← links)
• FROM REGULAR TO STRICTLY LOCALLY TESTABLE LANGUAGES (Q2841978) (← links)
• CONDITIONAL FAULT DIAGNOSABILITY OF DUAL-CUBES (Q2841979) (← links)
• EQUALITY SETS OF MORPHIC WORD SEQUENCES (Q2841980) (← links)
• TOWARDS MORE EFFICIENT INFECTION AND FIRE FIGHTING (Q2841981) (← links)