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. On the computation time of certain classes of boolean functions: Label: en
  2. A unifying framework for the theory of iterative arrays of machines: Label: en
  3. On the problem of computational time and complexity of arithmetic functions: Label: en
  4. The logical complexity of geometric properties in the plane: Label: en
  5. Deterministic simulation of non-deterministic turing machines (Detailed Abstract): Label: en
  6. Pushdown store machines and real-time computation: Label: en
  7. Variations on pushdown machines (Detailed Abstract): Label: en
  8. Towards a theory of semantics and compilers for programming languages: Label: en
  9. Formal models for some features of programming languages: Label: en
  10. Formalization of properties of recursively defined functions: Label: en
  11. Efficient LR(1) processor construction: Label: en
  12. Some properties of precedence languages: Label: en
  13. Properties of deterministic top down grammars: Label: en
  14. Languages in general algebras: Label: en
  15. Computability over arbitrary fields: Label: en
  16. Context-free grammars on trees: Label: en
  17. Transformations and translations from the point of view of generalized finite automata theory: Label: en
  18. Free groups and regular expressions: Label: en
  19. Translations on a context free grammar: Label: en
  20. Speed-ups by changing the order in which sets are enumerated (Preliminary Version): Label: en
  21. Classes of computable functions defined by bounds on computation: Label: en
  22. On minimal-program complexity measures: Label: en
  23. On classes of computable functions: Label: en
  24. On effective procedures for speeding up algorithms: Label: en
  25. Intercalation theorems for stack languages: Label: en
  26. Abstract families of deterministic languages: Label: en
  27. The inherent ambiguity partial algorithm problem for context free languages: Label: en
  28. Quasi-realtime languages (Extended Abstract): Label: en
  29. Abstract families of processors: Label: en
  30. Context-sensitive immediate constituent analysis---context-free languages revisited: Label: en

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