Martin Plátek
About
In The Last Decade
Martin Plátek
27 papers receiving 127 citations
Peers
Comparison fields: 5 of 26
- Artificial Intelligence 124
- Computational Theory and Mathematics 86
- Molecular Biology 82
- Language and Linguistics 12
- Control and Systems Engineering 11
Countries citing papers authored by Martin Plátek
This map shows the geographic impact of Martin Plátek'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 Martin Plátek with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Martin Plátek more than expected).
Fields of papers citing papers by Martin Plátek
This network shows the impact of papers produced by Martin Plátek. 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 Martin Plátek. The network helps show where Martin Plátek may publish in the future.
Co-authorship network of co-authors of Martin Plátek
This figure shows the co-authorship network connecting the top 25 collaborators of Martin Plátek. A scholar is included among the top collaborators of Martin Plátek 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 Martin Plátek. Martin Plátek is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | Pumping Deterministic Monotone Restarting Automata and DCFL. | 0 |
| 2 | Lexicalized Syntactic Analysis by Restarting Automata. | 0 |
| 3 | Robustness versus Sensibility by Two-Way Restarting Automata. | 0 |
| 4 | On h-Lexicalized Automata and h-Syntactic Analysis. | 0 |
| 5 | Towards a formal model of natural language description based on restarting automata with parallel DR-structures. | 1 |
| 6 | In)Dependencies in Functional Generative Description by Restarting Automata. | 2 |
| 7 | 3 | |
| 8 | Segmentation of Complex Sentences ⋆ | 0 |
| 9 | Towards a Formal Model for Functional Generative Description Analysis by Reduction and Restarting Automata | 11 |
| 10 | A Linguistically-Based Segmentation of Complex Sentences. | 6 |
| 11 | 7 | |
| 12 | Deterministic Two-Way Restarting Automata and Marcus Contextual Grammars | 2 |
| 13 | Restarting Automata and Variants of j-Monotonicity. | 2 |
| 14 | Strict Monotonicity and Restarting Automata. | 1 |
| 15 | Deleting Automata with a Restart Operation. | 2 |
| 16 | Construction of a robust parser from a deterministic reduced parser. | 0 |
| 17 | Deleting Automata with a Restart Operation and Marcus Grammars. | 0 |
| 18 | An Implementation of Syntactic Analysis of Czech | 3 |
| 19 | Restarting Automata, Marcus Grammars and Context-Free Languages. | 5 |
| 20 | A note on the Chomsky hierarchy. | 1 |
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.