On the Complexity of Semantic Equivalences for Pushdown Automata and BPA

Lecture Notes in Computer Science - Germany
doi 10.1007/3-540-45687-2_36
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Equivalences of Pushdown Systems Are Hard

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

The Quotient Operation on Input-Driven Pushdown Automata

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2017English

Collapsible Pushdown Automata and Recursion Schemes

Proceedings - Symposium on Logic in Computer Science
MathematicsSoftware
2008English

From Security Protocols to Pushdown Automata

ACM Transactions on Computational Logic
Computational MathematicsTheoretical Computer ScienceComputer ScienceLogic
2015English

Simply Typed Fixpoint Calculus and Collapsible Pushdown Automata

Mathematical Structures in Computer Science
MathematicsComputer Science Applications
2015English

The Complexity of Interacting Automata

International Journal of Game Theory
StatisticsProbabilityUncertaintyEconomicsSocial SciencesMathematicsEconometrics
2015English

Deciding Probabilistic Simulation Between Probabilistic Pushdown Automata and Finite-State Systems

Information and Computation
Theoretical Computer ScienceComputational TheoryComputer Science ApplicationsInformation SystemsMathematics
2019English

Reducing an Operational Supervisory Control Problem by Decomposition for Deterministic Pushdown Automata

IFAC Proceedings Volumes
2014English

On the Complexity of Undecidable Problems in Automata Theory

1967English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy