scientific article; zbMATH DE number 4124985

From MaRDI portal

Revision as of 13:40, 6 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4205068

Jump to:navigation, search

zbMath0686.68011MaRDI QIDQ4205068

No author found.

Publication date: 1989

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

equivalence monadic second-order logic program schemes equational graph

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (6)

An axiomatic definition of context-free rewriting and its application to NLC graph grammars ⋮ The monadic second-order logic of graphs. I: Recognizable sets of finite graphs ⋮ A structural/temporal query language for business processes ⋮ Undecidability of the bandwidth problem on linear graph languages ⋮ Isomorphism of Regular Trees and Words ⋮ On the regular structure of prefix rewriting

This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4205068&oldid=18057221"