Recommendations
Cites work
- scientific article; zbMATH DE number 3940742 (Why is no real title available?)
- scientific article; zbMATH DE number 3765164 (Why is no real title available?)
- scientific article; zbMATH DE number 1142324 (Why is no real title available?)
- scientific article; zbMATH DE number 3894467 (Why is no real title available?)
- scientific article; zbMATH DE number 3413820 (Why is no real title available?)
- Computing Algebraic Formulas Using a Constant Number of Registers
- Definability by programs in first-order structures
- First-order dynamic logic
- Limitations of the program memory and the expressive power of dynamic logics
- On the index of a context-free grammar and language
- Pebbling with an auxiliary pushdown
- Programming as a Discipline of Mathematical Nature
- Some open questions in the theory of program schemes and dynamic logics
- Unbounded program memory adds to the expressive power of first-order programming logic
Cited in
(7)- Computer Science Logic
- White pebbles help
- Pebble games over ordered structural abstractions
- Recursion versus tail recursion over \(\overline{\mathbb{F}}_p\)
- PEBBLE GAMES AND LINEAR EQUATIONS
- A difference in complexity between recursion and tail recursion
- Graph reachability and pebble automata over infinite alphabets
This page was built for publication: An infinite pebble game and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1362906)
