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.

Reachability Analysis of Pushdown Systems with an Upper Stack: Label: en
Hardness Results for Coverability Problem of Well-Structured Pushdown Systems: Label: en
Detecting Useless Transitions in Pushdown Automata: Label: en
On the Computational Power of Affine Automata: Label: en
Color War: Cellular Automata with Majority-Rule: Label: en
Over Which Monoids is the Transducer Determinization Procedure Applicable?: Label: en
Most General Property-Preserving Updates: Label: en
Space Complexity of Reachability Testing in Labelled Graphs: Label: en
Merging Relations: A Way to Compact Petri Nets’ Behaviors Uniformly: Label: en
Cut Languages in Rational Bases: Label: en
A Derivational Model of Discontinuous Parsing: Label: en
Linear Parsing Expression Grammars: Label: en
Lower Bound Methods for the Size of Nondeterministic Finite Automata Revisited: Label: en
Finding DFAs with Maximal Shortest Synchronizing Word Length: Label: en
Derivatives and Finite Automata of Expressions in Star Normal Form: Label: en
Minimization of Finite State Automata Through Partition Aggregation: Label: en
The Weight in Enumeration: Label: en
Consensus String Problem for Multiple Regular Languages: Label: en
Complexity of Left-Ideal, Suffix-Closed and Suffix-Free Regular Languages: Label: en
Two-Dimensional Palindromes and Their Properties: Label: en
Integrated Encryption in Dynamic Arithmetic Compression: Label: en
A Calculus of Cyber-Physical Systems: Label: en
An Automata View to Goal-Directed Methods: Label: en
$$\mathbb {N}$$ -Memory Automata over the Alphabet $$\mathbb {N}$$: Label: en
The Strong, Weak, and Very Weak Finite Context and Kernel Properties: Label: en
Efficient Learning of Tier-Based Strictly k-Local Languages: Label: en
A Stable Non-interleaving Early Operational Semantics for the Pi-Calculus: Label: en
Logic, Languages, and Rules for Web Data Extraction and Reasoning over Data: Label: en
Approximation in Description Logics: How Weighted Tree Automata Can Help to Define the Required Concept Comparison Measures in $$\mathcal {FL}_0$$: Label: en
On the Arithmetics of Discrete Figures: Label: en
Solving Equations on Words with Morphisms and Antimorphisms: Label: en
Computing Depths of Patterns: Label: en
Characterisation of the State Spaces of Live and Bounded Marked Graph Petri Nets: Label: en
Channel Synthesis Revisited: Label: en
Efficient List-Based Computation of the String Subsequence Kernel: Label: en
Covering Pairs in Directed Acyclic Graphs: Label: en
Two Double-Exponential Gaps for Automata with a Limited Pushdown: Label: en
Networks of Polarized Evolutionary Processors Are Computationally Complete: Label: en
Picture Codes with Finite Deciphering Delay: Label: en
Formulae for Polyominoes on Twisted Cylinders: Label: en
Computing Optimal Reachability Costs in Priced Dense-Timed Pushdown Automata: Label: en
Interprocedural Information Flow Analysis of XML Processors: Label: en
On the Parikh Membership Problem for FAs, PDAs, and CMs: Label: en
A Brief History of Strahler Numbers: Label: en
On the State Complexity of Semi-quantum Finite Automata: Label: en
Probabilistic ω-Regular Expressions: Label: en
Complexity of a Problem Concerning Reset Words for Eulerian Binary Automata: Label: en
Computing with Catalan Families: Label: en
Weight-Reducing Hennie Machines and Their Descriptional Complexity: Label: en
Extended Two-Way Ordered Restarting Automata for Picture Languages: Label: en