scientific article; zbMATH DE number 1754582
From MaRDI portal
Publication:4535007
zbMath0986.68517MaRDI QIDQ4535007
Publication date: 12 June 2002
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2076/20760024
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Grammars and rewriting systems (68Q42)
Related Items (6)
A generic framework for checking semantic equivalences between pushdown automata and finite-state automata ⋮ Monotonic Abstraction for Programs with Dynamic Memory Heaps ⋮ On the complexity of checking semantic equivalences between pushdown processes and finite-state processes ⋮ A general approach to comparing infinite-state systems with their finite-state specifications ⋮ Generalized rewrite theories, coherence completion, and symbolic methods ⋮ Iterating transducers
Uses Software
This page was built for publication:
