Topological characterisation of multi-buffer simulation

DOI10.3233/FI-2021-1999MaRDI QIDQ4989168zbMATH OpenFDO

Authors Milka Hutagalung

Publication date 21 May 2021

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/FI-2021-1999

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Topological characterisation of multi-buffer simulation
• Multi-buffer simulations: decidability and complexity
• Multi-buffer simulations for trace language inclusion
• Buffered simulation games for Büchi automata
• scientific article; zbMATH DE number 1927559

Cites work

• Advanced automata minimization
• Combinatorics on traces
• Computing Simulations over Tree Automata
• Degrees of lookahead in regular infinite games
• Fair simulation
• scientific article; zbMATH DE number 1142314 (Why is no real title available?)
• 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 941396 (Why is no real title available?)
• Multi-buffer simulations for trace language inclusion
• Revealing vs. concealing: more simulation games for Büchi inclusion
• Semi-commutations
• Simulation relations for alternating Büchi automata
• Three applications to rational relations of the high undecidability of the infinite Post correspondence problem in a regular -language

Cited in

(3)

• Topological characterisation of multi-buffer simulation
• Multi-buffer simulations: decidability and complexity
• Multi-buffer simulations for trace language inclusion

This page was built for publication: Topological characterisation of multi-buffer simulation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4989168)