[Lecture Notes in Computer Science] Mathematical Foundations of Computer Science 1984 Volume 176 || Process logics : two decidability results
- 作者Chytil, M. P.; Koubek, V.
- 文件大小456.89KB
- 发表时间1984
- DOI10.1007/bfb0030309
- 页码282-290
[Lecture Notes in Computer Science] Mathematical Foundations of Computer Science 1988 Volume 324 || Robust oracle machinesChytil, Michal P.; Koubek, Václav; Janiga, Ladislav · 1988
[Lecture Notes in Computer Science] Mathematical Foundations of Computer Science 1988 Volume 324 || Reusable specification componentsChytil, Michal P.; Koubek, Václav; Janiga, Ladislav · 1988
[Lecture Notes in Computer Science] Mathematical Foundations of Computer Science 1988 Volume 324 || Comparing interconnection networksChytil, Michal P.; Koubek, Václav; Janiga, Ladislav · 1988
[Lecture Notes in Computer Science] Mathematical Foundations of Computer Science 1988 Volume 324 || Distribution of Sequential ProcessesChytil, Michal P.; Koubek, Václav; Janiga, Ladislav · 1988
[Lecture Notes in Computer Science] Mathematical Foundations of Computer Science 1988 Volume 324 || Positive/Negative conditional rewritingChytil, Michal P.; Koubek, Václav; Janiga, Ladislav · 1988
[Lecture Notes in Computer Science] Mathematical Foundations of Computer Science 1988 Volume 324 || String matching with constraintsChytil, Michal P.; Koubek, Václav; Janiga, Ladislav · 1988
[Lecture Notes in Computer Science] Mathematical Foundations of Computer Science 1988 Volume 324 || On complexity of countingChytil, Michal P.; Koubek, Václav; Janiga, Ladislav · 1988
[Lecture Notes in Computer Science] Mathematical Foundations of Computer Science 1988 Volume 324 || Functional programming and combinatory algebrasChytil, Michal P.; Koubek, Václav; Janiga, Ladislav · 1988