Undecidable problems in unreliable computations
Theoretical Computer Science - Latin American theoretical informatics
Using Forward Reachability Analysis for Verification of Lossy Channel Systems
Formal Methods in System Design
ACM Transactions on Computational Logic (TOCL)
The Ordinal Recursive Complexity of Lossy Channel Systems
LICS '08 Proceedings of the 2008 23rd Annual IEEE Symposium on Logic in Computer Science
Leftist Grammars Are Non-primitive Recursive
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Universality Analysis for One-Clock Timed Automata
Fundamenta Informaticae - Fundamentals of Software Engineering 2007: Selected Contributions
Post embedding problem is not primitive recursive, with applications to channel systems
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
The ω-regular post embedding problem
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Pumping and counting on the regular post embedding problem
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Toward a compositional theory of leftist grammars and transformations
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
Pumping and counting on the regular post embedding problem
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Lossy counter machines decidability cheat sheet
RP'10 Proceedings of the 4th international conference on Reachability problems
| Hi-index | 0.00 |
Blocker and coblocker sets are regular languages involved in the algorithmic solution of the Regular Post Embedding Problem. We investigate the computability of these languages and related decision problems.