Entity usage

From MaRDI portal

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.

List of pages that use a given entity

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

View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)

  1. Approximate Periods with Levenshtein Distance: Label: en
  2. Combination of Context-Free Grammars and Tree Automata for Unranked and Ranked Trees: Label: en
  3. Progressive Solutions to FSM Equations: Label: en
  4. 3-Way Composition of Weighted Finite-State Transducers: Label: en
  5. The Number of Runs in Sturmian Words: Label: en
  6. Finite Eilenberg Machines: Label: en
  7. Deterministic Pushdown Automata and Unary Languages: Label: en
  8. Hyper-Minimization in O(n 2): Label: en
  9. Composed Bisimulation for Tree Automata: Label: en
  10. A Run-Time Efficient Implementation of Compressed Pattern Matching Automata: Label: en
  11. Games for Temporal Logics on Trees: Label: en
  12. On Complexity of Two Dimensional Languages Generated by Transducers: Label: en
  13. Persistent Computations of Turing Machines: Label: en
  14. Five Determinisation Algorithms: Label: en
  15. Pattern Matching in DCA Coded Text: Label: en
  16. Automata-Theoretic Analysis of Bit-Split Languages for Packet Scanning: Label: en
  17. Tree-Series-to-Tree-Series Transformations: Label: en
  18. A Translation from the HTML DTD into a Regular Hedge Grammar: Label: en
  19. Computing Convex Hulls by Automata Iteration: Label: en
  20. Multi-Return Macro Tree Transducers: Label: en
  21. Learning Regular Languages Using Nondeterministic Finite Automata: Label: en
  22. Hopcroft’s Minimization Technique: Queues or Stacks?: Label: en
  23. Testing Whether a Binary and Prolongeable Regular Language L Is Geometrical or Not on the Minimal Deterministic Automaton of Pref(L): Label: en
  24. Antichain-Based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata: Label: en
  25. Antimirov and Mosses’s Rewrite System Revisited: Label: en
  26. Automated Compositional Reasoning of Intuitionistically Closed Regular Properties: Label: en
  27. Concurrency, Synchronization, and Conflicts in Petri Nets: Label: en
  28. Automata, Probability, and Recursion: Label: en
  29. Language Decompositions, Primality, and Trajectory-Based Operations: Label: en
  30. Nondeterministic Finite Automata—Recent Results on the Descriptional and Computational Complexity: Label: en

View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)