LALBLC A Program Testing the Equivalence of dpda’s

DOI10.1007/978-3-642-39274-0_16MaRDI QIDQ5327493zbMATH OpenOpenAlexFDO

Authors Patrick Henry, Géraud Sénizergues

Publication date 7 August 2013

Published in Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-39274-0_16

zbMATH Keywords

deterministic context-free grammarsdeterministic pushdown automataequivalence problem

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited in

(6)

• Nested session types
• A survey of symbolic methods for establishing equivalence-based properties in cryptographic protocols
• Deciding the bisimilarity of context-free session types
• From security protocols to pushdown automata
• Subtyping context-free session types
• Subtyping context-free session types

Describes a project that uses

Uses Software

• LALBLC

This page was built for publication: LALBLC A Program Testing the Equivalence of dpda’s

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