Verification of Mathematical Formulae Based on a Combination of Context-Free Grammar and Tree Grammar

DOI10.1007/978-3-540-85110-3_35zbMath1166.68345OpenAlexW1588795928MaRDI QIDQ5505521

Akio Fujiyoshi, Masakazu Suzuki, Seiichi Uchida

Publication date: 27 January 2009

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-85110-3_35

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Grammars and rewriting systems (68Q42)

Related Items (5)

A Practical Algorithm for the Uniform Membership Problem of Labeled Multidigraphs of Tree-Width 2 for Spanning Tree Automata ⋮ Grammatical verification for mathematical formula recognition based on context-free tree grammar ⋮ Recognition of directed acyclic graphs by spanning tree automata ⋮ Recognition of a Spanning Tree of Directed Acyclic Graphs by Tree Automata ⋮ A Practical Algorithm for the Uniform Membership Problem of Labeled Multidigraphs of Tree-Width 2 for Spanning Tree Automata

This page was built for publication: Verification of Mathematical Formulae Based on a Combination of Context-Free Grammar and Tree Grammar