|
СТ |
Equivalence-Checking with Infinite-State Systems: Techniques and Results |
2002 |
Kucera A., Jancar P. |
|
|
|
Lecture Notes in Computer Science |
04.12.2002 |
|
СТ |
Forgetting automata and context-free languages |
1996 |
Jancar P., Mraz F., Platek M. |
|
|
|
Acta Informatica |
20.09.1996 |
|
СТ |
Restarting Automata |
1995 |
Jancar P., Mraz F., Platek M., Vogel J. |
Lecture Notes in Computer Science |
|
|
Fundamentals of Computation Theory |
18.10.1995 |
|
СТ |
Checking Regular Properties of Petri Nets |
1995 |
Jancar P., Moller F. |
Lecture Notes in Computer Science |
|
|
CONCUR 95: Concurrency Theory |
17.10.1995 |
|
СТ |
On a Decidability Border for Temporal Logics on Petri Nets |
1994 |
Jancar P. |
|
|
Czech Society for Computer Science, Slovak Society for Computer Science |
XXI SOFSEM 94: Contributed Talks |
12.09.1995 |
|
СТ |
All Action-Based Behavioural Equivalences are Undecidable for Labelled Petri Nets |
1995 |
Jancar P. |
|
|
|
EATCS Bull. |
21.07.1995 |
|
СТ |
High Undecidability of Weak Bisimilarity for Petri Nets |
1995 |
Jancar P. |
|
|
|
Lecture Notes in Computer Science |
16.06.1995 |
|
СТ |
A Taxonomy of Forgetting Automata |
1993 |
Jancar P., Mraz F., Platek M. |
|
|
|
Lecture Notes in Computer Science |
21.10.1993 |
|
СТ |
Characterization of Context-Free Languages by Erasing Automata |
1992 |
Jancar P., Mraz F., Platek M. |
|
|
|
Lecture Notes in Computer Science |
17.09.1992 |
