On the power of pushing or stationary moves for input-driven pushdown automata

DOI10.1016/J.TCS.2024.114503OpenAlexW4392868567MaRDI QIDQ6131193FDOQ6131193

Authors: Martin Kutrib, Andreas Malcher, Matthias Wendlandt 

Publication date: 4 April 2024

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2024.114503

Recommendations

• Tinput-Driven Pushdown Automata
• Tinput-driven pushdown, counter, and stack automata
• Digging input-driven pushdown automata
• Input-driven stack automata
• Further closure properties of input-driven pushdown automata

zbMATH Keywords

deterministic pushdown automatainput-driven pushdown automatacomputational capacitydecidability questionsrepresentation by inverse homomorphism

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Title not available (Why is that?)
• Visibly pushdown languages
• Adding nesting structure to words
• Title not available (Why is that?)
• Title not available (Why is that?)
• Minimizing Variants of Visibly Pushdown Automata
• Synchronization of Pushdown Automata
• Operator precedence and the visibly pushdown property
• On the power of pushing or stationary moves for input-driven pushdown automata
• Tinput-driven pushdown, counter, and stack automata
• Digging input-driven pushdown automata

Cited In (1)

• Input-Driven Double-Head Pushdown Automata

This page was built for publication: On the power of pushing or stationary moves for input-driven pushdown automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6131193)