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 49 results in range #1 to #49.

One-rule trace-rewriting systems and confluence: Label: en
A strategy for speeding-up the computation of characteristic sets: Label: en
Characterizing regular languages with polynomial densities: Label: en
Maintaining proximity in higher dimensional spaces: Label: en
Superposable Trellis Automata: Label: en
Fully abstract semantics for higher order communicating systems: Label: en
Two simple characterizations of well-founded semantics: Label: en
New parallel algorithms for convex hull and triangulation in 3-dimensional space: Label: en
On the nature of events: Label: en
Decision problems for cellular automata and their semigroups: Label: en
Modelling concurrency with semi-commutations: Label: en
A functorial semantics for observed concurrency: Label: en
Almost every set in exponential time is P-bi-immune: Label: en
Inferring a tree from walks: Label: en
Efficient unidimensional universal cellular automaton: Label: en
Definitions and comparisons of local computations on graphs: Label: en
On finite automata with limited nondeterminism (extended abstract): Label: en
The emptiness problem for intersections of regular languages: Label: en
Mobility in the CC-paradigm: Label: en
Small universal one-state linear operator algorithm: Label: en
Insertion and deletion of words: Determinism and reversibility: Label: en
Characterization of context-pree languages by erasing automata: Label: en
Merging and sorting strings in parallel: Label: en
About boundedness for some datalog and DATALOGneg programs: Label: en
Dataflow semantics for Petri nets: Label: en
A threshold for unsatisfiability: Label: en
Poset properties of complex traces: Label: en
The shuffle exchange network has a Hamiltonian path: Label: en
On computational power of weighted finite automata: Label: en
Parallel complexity of iterated morphisms and the arithmetic of small numbers: Label: en
Probabilistic and pluralistic learners with mind changes: Label: en
Strong normalization of substitutions: Label: en
Object interaction: Label: en
Negation elimination in equational formulae: Label: en
Rational transductions and complexity of counting problems: Label: en
On the complexity of incremental computation: Label: en
Promise problems and access to unambiguous computation: Label: en
The degree structure of 1-L reductions: Label: en
Some remarks on the test complexity of iterative logic arrays: Label: en
A perfect parallel dictionary: Label: en
The complexity of graph connectivity: Label: en
Weak parallel machines: A new class of physically feasible parallel machine models: Label: en
On the complexity of small description and related topics: Label: en
Theory of computation over stream algebras, and its applications: Label: en
Neural networks and complexity theory: Label: en
On the expansion of combinatorial polytopes: Label: en
Parallel recognition and ranking of context-free languages: Label: en
Graph layout problems: Label: en
On range searching with semialgebraic sets: Label: en