Stack and locally finite transformations on structures with reversible transitions

DOI10.1007/BF01070102zbMath0543.68007OpenAlexW2006782631MaRDI QIDQ3332226

Anatoly V. Anisimov

Publication date: 1983

Published in: Cybernetics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01070102

zbMATH Keywords

decidability propertiesdata structuresrecursion eliminationdeterministic stack computations

Mathematics Subject Classification ID

Data structures (68P05) General topics in the theory of software (68N01)

Related Items (1)

Locally finite properties of data structures and their computation

Cites Work

• A system which automatically improves programs
• Structural equivalence of context-free grammars
• Notes on recursion elimination
• An efficient machine-independent procedure for garbage collection in various list structures
• Generalized finite automata theory with an application to a decision problem of second-order logic
• Decidability of Second-Order Theories and Automata on Infinite Trees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Stack and locally finite transformations on structures with reversible transitions