Alexander Meduna
About
In The Last Decade
Alexander Meduna
82 papers receiving 399 citations
Peers
Comparison fields: 5 of 28
- Computational Theory and Mathematics 386
- Molecular Biology 364
- Artificial Intelligence 360
- Hardware and Architecture 25
- Mechanical Engineering 19
Countries citing papers authored by Alexander Meduna
This map shows the geographic impact of Alexander Meduna'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 Alexander Meduna with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Alexander Meduna more than expected).
Fields of papers citing papers by Alexander Meduna
This network shows the impact of papers produced by Alexander Meduna. 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 Alexander Meduna. The network helps show where Alexander Meduna may publish in the future.
Co-authorship network of co-authors of Alexander Meduna
This figure shows the co-authorship network connecting the top 25 collaborators of Alexander Meduna. A scholar is included among the top collaborators of Alexander Meduna 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 Alexander Meduna. Alexander Meduna is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | A jumping 5' → 3' Watson-Crick finite automata model. | 4 |
| 2 | Synchronous versions of regulated grammars : generative power and linguistic applications | 1 |
| 3 | Tree-controlled grammars with restrictions placed upon cuts and paths. | 0 |
| 4 | Advanced static analysis for decompilation using scattered context grammars | 2 |
| 5 | Design of an automatically generated retargetable decompiler | 3 |
| 6 | Multigenerative grammar systems and matrix grammars | 1 |
| 7 | Descriptional Complexity of Generalized Forbidding Grammars. | 3 |
| 8 | Self-regulating finite automata | 6 |
| 9 | Descriptional Complexity of Grammars Regulated by Context Conditions. | 1 |
| 10 | Reduction of Scattered Context Generators of Sentences Preceded by Their Leftmost Parses. | 1 |
| 11 | Generation of sentences with their parses: the case of propagating scattered context grammars | 2 |
| 12 | Self-reproducing pushdown transducers. | 1 |
| 13 | Two-way metalinear PC grammar systems and their descriptional complexity | 3 |
| 14 | Reduction of simple semi-conditional grammars with respect to the number of conditional productions | 8 |
| 15 | Grammars without context conditions. | 1 |
| 16 | Symbiotic E0L systems | 3 |
| 17 | Global context conditional grammars | 2 |
| 18 | On state grammars | 7 |
| 19 | A note on exponential density of ETOL languages. | 1 |
| 20 | Evaluated grammars | 2 |
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.