Pushdown Automata and Context-Free Grammars in Bisimulation Semantics

DOI10.46298/lmcs-19(1:15)2023OpenAlexW4322775206MaRDI QIDQ5883743

Bas Luttik, Unnamed Author, Jos C. M. Baeten

Publication date: 22 March 2023

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

context-free grammarbisimilaritypushdown automatonintermediate acceptancestate awareness

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Reactive Turing machines
• Transition system specifications with negative premises
• Process algebra with propositional signals
• The meaning of negative premises in transition system specifications. II
• Divide and congruence. III: From decomposition of modal formulas to preservation of stability and divergence
• Expressiveness modulo bisimilarity of regular expressions with parallel composition
• A Process-Theoretic Look at Automata
• A Context-Free Process as a Pushdown Automaton
• Process algebra for synchronous communication
• Branching time and abstraction in bisimulation semantics
• The meaning of negative premises in transition system specifications
• Sequencing and intermediate acceptance: Axiomatisation and decidability of bisimilarity
• Pushdown automata and context-free grammars in bisimulation semantics

This page was built for publication: Pushdown Automata and Context-Free Grammars in Bisimulation Semantics