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 #51 to #100.

Distinguishing Pattern Languages with Membership Examples: Label: en
Expressiveness of Dynamic Networks of Timed Petri Nets: Label: en
Probabilistic Simulation for Probabilistic Data-Aware Business Processes: Label: en
Learning Sequential Tree-to-Word Transducers: Label: en
DFA with a Bounded Activity Level: Label: en
Top-Down Tree Edit-Distance of Regular Tree Languages: Label: en
Are Good-for-Games Automata Good for Probabilistic Model Checking?: Label: en
Interval Temporal Logic Semantics of Box Algebra: Label: en
On Computability and Learnability of the Pumping Lemma Function: Label: en
Minimal Triangulation Algorithms for Perfect Phylogeny Problems: Label: en
On SAT Representations of XOR Constraints: Label: en
Ordered Counter-Abstraction: Label: en
On Context-Diverse Repeats and Their Incremental Computation: Label: en
ω-rational Languages: High Complexity Classes vs. Borel Hierarchy: Label: en
Counting Models of Linear-Time Temporal Logic: Label: en
Reachability Analysis with State-Compatible Automata: Label: en
Algebraic Tools for the Overlapping Tile Product: Label: en
Stochastic k-Tree Grammar and Its Application in Biomolecular Structure Modeling: Label: en
Extremal Combinatorics of Reaction Systems: Label: en
Succinct Encodings of Graph Isomorphism: Label: en
Solutions to the Multi-dimensional Equal Powers Problem Constructed by Composition of Rectangular Morphisms: Label: en
(k,l)-Unambiguity and Quasi-Deterministic Structures: An Alternative for the Determinization: Label: en
Satisfiability for MTL and TPTL over Non-monotonic Data Words: Label: en
Optimal Sorting Networks: Label: en
Shift-Reduce Parsers for Transition Networks: Label: en
On the Construction of a Family of Automata That Are Generically Non-minimal: Label: en
Deciding WQO for Factorial Languages: Label: en
Termination of Rule-Based Calculi for Uniform Semi-Unification: Label: en
On the Complexity of Shortest Path Problems on Discounted Cost Graphs: Label: en
Recursion Schemes, Collapsible Pushdown Automata and Higher-Order Model Checking: Label: en
Complexity Dichotomy for Counting Problems: Label: en
A Turing Machine Distance Hierarchy: Label: en
A Conditional Superpolynomial Lower Bound for Extended Resolution: Label: en
Uniformisation of Two-Way Transducers: Label: en
Infiniteness and Boundedness in 0L, DT0L, and T0L Systems: Label: en
Online Matching of Multiple Regular Patterns with Gaps and Character Classes: Label: en
Pumping, Shrinking and Pronouns: From Context Free to Indexed Grammars: Label: en
Boolean Algebras of Regular ω-Languages: Label: en
Ostrowski Numeration and the Local Period of Sturmian Words: Label: en
Coinductive Proof Techniques for Language Equivalence: Label: en
Model Checking Metric Temporal Logic over Automata with One Counter: Label: en
Asynchronous PC Systems of Pushdown Automata: Label: en
Eliminating Stack Symbols in Push-Down Automata and Linear Indexed Grammars: Label: en
Interval Logics and ωB-Regular Languages: Label: en
Counting Minimal Symmetric Difference NFAs: Label: en
Convergence of Newton’s Method over Commutative Semirings: Label: en
From Regular Tree Expression to Position Tree Automaton: Label: en
Linear-Time Version of Holub’s Algorithm for Morphic Imprimitivity Testing: Label: en
Rewrite Closure and CF Hedge Automata: Label: en
On Bounded Languages and Reversal-Bounded Automata: Label: en