Entity usage

This page lists pages that use the given entity (e.g. Q42). The list is sorted by descending page ID, so that newer pages are listed first.

Showing below up to 50 results in range #1 to #50.

Tree-Based Generation of Restricted Graph Languages: Label: en
Synthesizing Computable Functions from Rational Specifications Over Infinite Words: Label: en
Reachability Analysis of Self Modifying Code: Label: en
Transportation Problem Allowing Sending and Bringing Back: Label: en
Fault-Tolerance of Star Graph Based on Subgraph Fault Pattern: Label: en
Online and Approximate Network Construction from Bounded Connectivity Constraints: Label: en
Strong Menger Connectivity of Folded Hypercubes with Faulty Subcube: Label: en
Infinite Families of 2-Designs from a Class of Linear Codes Related to Dembowski-Ostrom Functions: Label: en
Tight Upper Bounds on Distinct Maximal (Sub-)Repetitions in Highly Compressible Strings: Label: en
The Hardest LL(k) Language: Label: en
Definability Results for Top-Down Tree Transducers: Label: en
Reversible Top-Down Syntax Analysis: Label: en
Forbidden Patterns for FO² Alternation Over Finite and Infinite Words: Label: en
Integer Weighted Automata on Infinite Words: Label: en
Two-Way Non-Uniform Finite Automata: Label: en
Balanced-by-Construction Regular and ω-Regular Languages: Label: en
Extremal Binary PFAs with Small Number of States: Label: en
Special Issue: 25th International Conference on Developments in Language Theory (DLT 2021) — Preface: Label: en
Minimizing I/Os in Out-of-Core Task Tree Scheduling: Label: en
Optimal Gathering Over Weber Meeting Nodes in Infinite Grid: Label: en
Analysis of Vulnerability of Some Transformation Networks: Label: en
Embedded Edge-Connectivity Reliability Evaluation of Augmented Hypercube Interconnection Networks: Label: en
Additional Closeness of Cycle Graphs: Label: en
Fault-Tolerant Strong Menger (Edge) Connectivity of DCC Linear Congruential Graphs: Label: en
The Component (Edge) Connectivity of Round Matching Composition Networks: Label: en
Finite Approximations and Similarity of Languages: Label: en
New Bounds for Some Topological Indices: Label: en
Metric Properties of Non-Commuting Graph Associated to Two Groups: Label: en
Hybrid Enhanced Binary Honey Badger Algorithm with Quadratic Programming for Cardinality Constrained Portfolio Optimization: Label: en
Locating Number of Biswapped Networks: Label: en
Multilayer Stacked Probabilistic Belief Network-Based Brain Tumor Segmentation and Classification: Label: en
Mathematical Modelling and Computational Analysis of Covid-19 Epidemic in Erbil Kurdistan Using Modified Lagrange Interpolating Polynomial: Label: en
A Steganography Embedding Method Based on CDF-DWT Technique for Reversible Data Hiding Application Using Elgamal Algorithm: Label: en
Preface: Label: en
A Novel Approach Towards Degree and Walsh-Transform of Boolean Functions: Label: en
Subnetwork Preclusion of (n,k)-Star Networks: Label: en
Isolated Rupture in Thorny Networks: Label: en
Two Effective Properties of ω-Rational Functions: Label: en
Alternate Lucas Cubes: Label: en
On the Construction of Multiply Constant-Weight Codes: Label: en
The (n,k)-Modified-Bubble-Sort Graph: A Generalized Modified-Bubble-Sort Graph: Label: en
Error-Free Affine, Unitary, and Probabilistic OBDDs: Label: en
Space Complexity of Stack Automata Models: Label: en
Normalish Amenable Subgroups of the R. Thompson Groups: Label: en
On the Balancedness of Tree-to-Word Transducers: Label: en
Simplifications of Uniform Expressions Specified by Systems: Label: en
Sublinear-Time Language Recognition and Decision by One-Dimensional Cellular Automata: Label: en
Descriptional Complexity of Semi-Simple Splicing Systems: Label: en
On the Interplay of Direct Topological Factorizations and Cellular Automata Dynamics on Beta-Shifts: Label: en
Recognizing Lexicographically Smallest Words and Computing Successors in Regular Languages: Label: en