Multi-buffer simulations for trace language inclusion
From MaRDI portal
Recommendations
Cites work
- Advanced automata minimization
- Borel determinacy
- Buffered simulation games for Büchi automata
- Checking for language inclusion using simulation preorders
- Computing Simulations over Tree Automata
- Conditionally Optimal Algorithms for Generalized B\"uchi Games
- Degrees of lookahead in regular infinite games
- scientific article; zbMATH DE number 1927559 (Why is no real title available?)
- scientific article; zbMATH DE number 1754630 (Why is no real title available?)
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- Mixing Lossy and Perfect Fifo Channels
- On Communicating Finite-State Machines
- Recursive Predicates and Quantifiers
- Revealing vs. concealing: more simulation games for Büchi inclusion
- Simulation relations for alternating Büchi automata
- The theory of ends, pushdown automata, and second-order logic
- Three applications to rational relations of the high undecidability of the infinite Post correspondence problem in a regular -language
Cited in
(5)
This page was built for publication: Multi-buffer simulations for trace language inclusion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5015280)