Bisimulation Equivalence of First-Order Grammars

DOI10.1007/978-3-662-43951-7_20zbMath1410.68192arXiv1405.7923OpenAlexW1502255017MaRDI QIDQ5167841

Petr Jančar

Publication date: 1 July 2014

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1405.7923

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Grammars and rewriting systems (68Q42)

Related Items (4)

A generic framework for checking semantic equivalences between pushdown automata and finite-state automata ⋮ Equivalence of pushdown automata via first-order grammars ⋮ Unnamed Item ⋮ Deciding semantic finiteness of pushdown processes and first-order grammars w.r.t. bisimulation equivalence

This page was built for publication: Bisimulation Equivalence of First-Order Grammars