On the power of pushing or stationary moves for input-driven pushdown automata
type: Item
instance of: scholarly article
title: On the power of pushing or stationary moves for input-driven pushdown automata
author: Martin Kutrib
author: Andreas Malcher
author: Matthias Wendlandt
published in: Theoretical Computer Science
publication date: 2024-04-04T00:00:00Z
Mathematics Subject Classification ID: 68Qxx
zbMATH DE Number: 7827497
zbMATH Keywords: input-driven pushdown automata
zbMATH Keywords: deterministic pushdown automata
zbMATH Keywords: representation by inverse homomorphism
zbMATH Keywords: computational capacity
zbMATH Keywords: decidability questions
MaRDI profile type: MaRDI publication profile
full work available at URL: j.tcs.2024.114503
OpenAlex ID: W4392868567
cites work: Visibly pushdown languages
cites work: Adding nesting structure to words
cites work: Q3219133
cites work: Synchronization of Pushdown Automata
cites work: Minimizing Variants of Visibly Pushdown Automata
cites work: Operator precedence and the visibly pushdown property
cites work: Q3862379
cites work: Digging input-driven pushdown automata
cites work: Tinput-driven pushdown, counter, and stack automata
cites work: On the power of pushing or stationary moves for input-driven pushdown automata
cites work: Q3890112
DOI: 10.1016/J.TCS.2024.114503
Recommended article: Tinput-Driven Pushdown Automata
Recommended article: Tinput-driven pushdown, counter, and stack automata
Recommended article: Digging input-driven pushdown automata
Recommended article: Input-driven stack automata
Recommended article: Further closure properties of input-driven pushdown automata
copyright license: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
description: scientific article; zbMATH DE number 7827497