Reversible pushdown automata
type: Item
instance of: scholarly article
title: Reversible pushdown automata
zbMATH Open document ID: 1250.68166
author: Martin Kutrib
author: Andreas Malcher
published in: Journal of Computer and System Sciences
publication date: 2012-11-06T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 6102593
zbMATH Keywords: reversible computations
zbMATH Keywords: pushdown automata
zbMATH Keywords: formal languages
zbMATH Keywords: closure properties
zbMATH Keywords: decidability questions
MaRDI profile type: Publication
full work available at URL: j.jcss.2011.12.004
OpenAlex ID: W2023439061
cites work: Optimization of LR(k) parsers
cites work: Inference of Reversible Languages
cites work: Logical Reversibility of Computation
cites work: On the efficient construction of quasi-reversible automata for reversible languages
cites work: On locally reversible languages
cites work: Deterministic context free languages
cites work: Properties of quantum languages
cites work: Q4198075
cites work: Q5592246
cites work: Complete problems for deterministic polynomial time
cites work: Learning approximately regular languages with reversible languages
cites work: Fast reversible language recognition using cellular automata
cites work: Real-time reversible iterative arrays
cites work: Irreversibility and Heat Generation in the Computing Process
cites work: Identification of birfsa languages.
cites work: Q4737155
cites work: Reversible computing and cellular automata -- a survey
cites work: Reversing algebraic process calculi
cites work: Q5678435
cites work: Reversible Flowchart Languages and the Structured Reversible Program Theorem
DOI: 10.1016/J.JCSS.2011.12.004
description: scientific article; zbMATH DE number 6102593