LALBLC A Program Testing the Equivalence of dpda’s

DOI10.1007/978-3-642-39274-0_16zbMath1298.68139OpenAlexW50533088MaRDI QIDQ5327493

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 pushdown automataequivalence problemdeterministic context-free grammars

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (4)

From Security Protocols to Pushdown Automata ⋮ Nested session types ⋮ A survey of symbolic methods for establishing equivalence-based properties in cryptographic protocols ⋮ Deciding the Bisimilarity of Context-Free Session Types

Uses Software

• LALBLC

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