OOIR: Observatory of International Research

Papers

(The TQCC of Fundamenta Informaticae is 1. The table below lists those papers that are above that threshold based on CrossRef citation counts [max. 250 papers]. The publications cover those that have been published in the past four years, i.e., from 2021-04-01 to 2025-04-01.)

Article	Citations
Complexity and Equivalency of Multiset Dimension and ID-colorings	11
Acyclic and Cyclic Reversing Computations in Petri Nets	6
On the Length of Shortest Strings Accepted by Two-way Finite Automata	6
Boris (Boaz) Trakhtenbrot — The Beginning	6
The 1966 International Congress of Mathematicians: A Micro-memoir	6
A Dynamical System Approach to Polyominoes Generation	6
Perpetual Free-choice Petri Nets are Lucent Proof of a Theorem of van der Aalst Using CP-exhaustions	5
A Note of Generalization of Fractional ID-factor-critical Graphs	5
Self-stabilisation of Cellular Automata on Tilings	5
Preface	5
Mining Clinical Process from Hospital Information System: A Granular Computing Approach	5
Exact Wirelength of Embedding 3-Ary n-Cubes into Certain Cylinders and Trees	5
Structure and Power: an Emerging Landscape	4
On Completeness of Cost Metrics and Meta-Search Algorithms in $-Calculus	3
Circular Interval-valued Computers and Simulation of (Red-green) Turing Machines	3
Decision Problems on Copying and Shuffling	3
Piecewise Affine Dynamical Models of Petri Nets – Application to Emergency Call Centers*	3
Reversible Regular Languages: Logical and Algebraic Characterisations	3
Order-theoretic Trees: Monadic Second-order Descriptions and Regularity	3
String Covering: A Survey	3
Physical Computational Complexity and First-order Logic	3
Structural Liveness of Immediate Observation Petri Nets	3
A Congruence-Based Perspective on Finite Tree Automata	2
Universal Address Sequence Generator for Memory Built-in Self-test	2
Computing Singular Elements Modulo Squares	2

Right Buchberger Algorithm over Bijective Skew PBW Extensions	2
On Random Number Generation for Kernel Applications	2
Discovering Process Models with Long-Term Dependencies while Providing Guarantees and Filtering Infrequent Behavior Patterns	2
Absent Subsequences in Words	2
On Minimization and Learning of Deterministic ω-Automata in the Presence of Don’t Care Words	2
A Complete Taxonomy of Restarting Automata without Auxiliary Symbols*	2
Some Basic Techniques Allowing Petri Net Synthesis: Complexity and Algorithmic Issues	2
A Polynomial-Time Construction of a Hitting Set for Read-Once Branching Programs of Width 3	2
Relations between Control Mechanisms for Sequential Grammars1	2
Compression on the Twisted Jacobi Intersection	2
Gathering over Meeting Nodes in Infinite Grid*	2
A Generalization of Falsity in Finitely-many Valued Logics	2
Two-Sided Strictly Locally Testable Languages	2
Link Residual Closeness of Harary Graphs	2
Error Correction for Discrete Tomography	2
Taking Complete Finite Prefixes To High Level, Symbolically*	2
Computational and Descriptional Power of Nondeterministic Iterated Uniform Finite-State Transducers	1
Coinductive Algorithms for Büchi Automata	1
A Polyhedral Abstraction for Petri Nets and its Application to SMT-Based Model Checking	1
On Local Antimagic Vertex Coloring for Complete Full t-ary Trees	1
Complexity Assessments for Decidable Fragments of Set Theory. I: A Taxonomy for the Boolean Case*	1
Preface	1
Adaptive Merging on Phase Change Memory	1
Number Conservation via Particle Flow in One-dimensional Cellular Automata	1
On the 2-domination Number of Cylinders with Small Cycles	1
Descriptional Complexity of Finite Automata – Selected Highlights	1
Characteristics of de Bruijn’s early proof checker Automath	1
Improved Descriptional Complexity Results for Simple Semi-Conditional Grammars	1
Preface	1
Computing the Length of Sum of Squares and Pythagoras Element in a Global Field	1
On the Complexity of Techniques That Make Transition Systems Implementable by Boolean Nets	1
Preface	1
A Strong Gram Classification of Non-negative Unit Forms of Dynkin Type ????_r	1
Inferring Unobserved Events in Systems with Shared Resources and Queues	1
The Complexity of Synthesis of b-Bounded Petri Nets	1
Correctness Notions for Petri Nets with Identifiers	1
Introduction to Probabilistic Concurrent Systems	1
Commuting Upper Triangular Binary Morphisms	1
On the Complexity of Proving Polyhedral Reductions	1
Unfoldings and Coverings of Weighted Graphs	1
Cost Automata, Safe Schemes, and Downward Closures	1
Preface	1
Relation-Algebraic Verification of Disjoint-Set Forests	1
Preface	1
Getting There and Back Again	1
Articulations and Products of Transition Systems and their Applications to Petri Net Synthesis	1