Simulation problems for one-counter machines

DOI10.1007/3-540-47849-3_28MaRDI QIDQ4496250zbMATH OpenFDO

Authors Zdeněk Sawa, Petr Jančar, Faron Moller

Publication date 13 August 2000

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-47849-3_28

zbMATH Keywords

decidability

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Simulation is decidable for one-counter nets (extended abstract)
• scientific article; zbMATH DE number 1500527
• Simulation problems over one-counter nets
• Decidability of bisimilarity for one-counter processes.
• Bisimulation equivalence is decidable for one-counter processes

Cited in

(10)

• The complexity of bisimilarity-checking for one-counter processes.
• DP lower bounds for equivalence-checking and model-checking of one-counter automata
• Deterministic pushdown-CD-systems of stateless deterministic R(1)-automata
• A generic framework for checking semantic equivalences between pushdown automata and finite-state automata
• Simulation problems over one-counter nets
• An Automata-Theoretical Characterization of Context-Free Trace Languages
• CD-systems of stateless deterministic R(1)-automata governed by an external pushdown store
• Simulation is decidable for one-counter nets (extended abstract)
• scientific article; zbMATH DE number 1500527 (Why is no real title available?)
• Countdown games, and simulation on (succinct) one-counter nets

This page was built for publication: Simulation problems for one-counter machines

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