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

IFAC Proceedings Volumes
doi 10.3182/20140514-3-fr-4046.00057
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

CD-systems of Stateless Deterministic R(1)-Automata Governed by an External Pushdown Store

RAIRO - Theoretical Informatics and Applications
MathematicsComputer Science ApplicationsSoftware
2011English

Abstractions for Nonblocking Supervisory Control of Extended Finite Automata

2012English

Rabin-Mostowski Index Problem: A Step Beyond Deterministic Automata

2013English

Deterministic Finite Automata

Algebra and Discrete Mathematics
2012English

From Security Protocols to Pushdown Automata

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

Collapsible Pushdown Automata and Recursion Schemes

Proceedings - Symposium on Logic in Computer Science
MathematicsSoftware
2008English

Hyper-Minimization for Deterministic Tree Automata

International Journal of Foundations of Computer Science
Computer Science
2013English

Pushdown Control-Flow Analysis for Free

ACM SIGPLAN Notices
Computer Science
2016English

Simply Typed Fixpoint Calculus and Collapsible Pushdown Automata

Mathematical Structures in Computer Science
MathematicsComputer Science Applications
2015English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy