Petr Jančar
- Computational Theory and Mathematics top 2%
- Artificial Intelligence top 5%
- Software top 10%
- Computer Networks and Communications
- Management Information Systems
- Co-authors
- Antonı́n KučeraLuboš BrimFaron MollerRichard MayrJiřı́ SrbaJavier EsparzaStanislav BöhmStefan Göller
- Topics
- Formal Methods in Verification (33 papers)semigroups and automata theory (23 papers)Petri Nets in System Modeling (20 papers)
- Journals
- SHILAP Revista de lepidopterologíaJournal of the ACMTheoretical Computer Science
- Partner nations
- CzechiaGermanyUnited Kingdom
In The Last Decade
Petr Jančar
45 papers receiving 343 citations
Peers
Comparison fields: 5 of 34
- Computational Theory and Mathematics 325
- Artificial Intelligence 222
- Software 54
- Computer Networks and Communications 45
- Management Information Systems 33
Countries citing papers authored by Petr Jančar
This map shows the geographic impact of Petr Jančar's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Petr Jančar with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Petr Jančar more than expected).
Fields of papers citing papers by Petr Jančar
This network shows the impact of papers produced by Petr Jančar. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Petr Jančar. The network helps show where Petr Jančar may publish in the future.
Co-authorship network of co-authors of Petr Jančar
This figure shows the co-authorship network connecting the top 25 collaborators of Petr Jančar. A scholar is included among the top collaborators of Petr Jančar based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Petr Jančar. Petr Jančar is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 2 | |
| 2 | 2 | |
| 3 | 3 | |
| 4 | 11 | |
| 5 | Short Decidability Proof for DPDA Language Equivalence via 1st Order Grammar Bisimilarity | 1 |
| 6 | 0 | |
| 7 | 3 | |
| 8 | Behavioural equivalences on finite-state systems are PTIME-hard | 7 |
| 9 | 10 | |
| 10 | 6 | |
| 11 | 22 | |
| 12 | 9 | |
| 13 | Simulation and Bisimulation over One-Counter Processes | 1 |
| 14 | 14 | |
| 15 | Proceedings of the MFCS'98 Workshop on Concurrency | 1 |
| 16 | Deleting Automata with a Restart Operation. | 2 |
| 17 | All action-based behavioural equivalences are undecidable for labelled Petri nets. | 1 |
| 18 | Restarting Automata, Marcus Grammars and Context-Free Languages. | 5 |
| 19 | 52 | |
| 20 | 30 |
About Petr Jančar
Petr Jančar is a scholar working on Computational Theory and Mathematics, Software and Artificial Intelligence, having authored 48 papers that have together received 359 indexed citations. Recurring topics across this work include Formal Methods in Verification (33 papers), semigroups and automata theory (23 papers) and Petri Nets in System Modeling (20 papers). The work is most often cited by research in Computational Theory and Mathematics (325 citations), Software (54 citations) and Artificial Intelligence (222 citations). Petr Jančar has collaborated with scholars based in Czechia, Germany and United Kingdom. Frequent co-authors include Antonı́n Kučera, Luboš Brim, Faron Moller, Richard Mayr, Jiřı́ Srba, Javier Esparza, Stanislav Böhm, Stefan Göller, Vojtěch Forejt and R. Rodney Howell. Their work appears in journals such as SHILAP Revista de lepidopterología, Journal of the ACM and Theoretical Computer Science.
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.