Verified Decision Procedures on Context-Free Grammars

DOI10.1007/978-3-540-74591-4_14zbMath1144.68324OpenAlexW1601251910MaRDI QIDQ3523174

Yasuhiko Minamide

Publication date: 2 September 2008

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

Full work available at URL: https://doi.org/10.1007/978-3-540-74591-4_14

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (2)

Formalizing the Logic-Automaton Connection ⋮ Monoid-Based Approach to the Inclusion Problem on Superdeterministic Pushdown Automata

This page was built for publication: Verified Decision Procedures on Context-Free Grammars