Fundamenta Informaticae

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-06-01 to 2025-06-01.)
ArticleCitations
On the Length of Shortest Strings Accepted by Two-way Finite Automata11
Complexity Assessments for Decidable Fragments of Set Theory. I: A Taxonomy for the Boolean Case*6
On the Complexity of Techniques That Make Transition Systems Implementable by Boolean Nets6
Decision Problems on Copying and Shuffling6
A Dynamical System Approach to Polyominoes Generation6
Link Residual Closeness of Harary Graphs5
Computing Square Roots in Quaternion Algebras5
Discovering Process Models with Long-Term Dependencies while Providing Guarantees and Filtering Infrequent Behavior Patterns5
Computational and Descriptional Power of Nondeterministic Iterated Uniform Finite-State Transducers5
Global Types and Event Structure Semantics for Asynchronous Multiparty Sessions5
Introduction to Probabilistic Concurrent Systems5
On the Complexity of Proving Polyhedral Reductions5
Coxeter Invariants for Non-negative Unit Forms of Dynkin Type ????r4
On Finding Hamiltonian Cycles in Barnette Graphs4
On Morphisms Preserving Palindromic Richness3
Morphisms and Minimisation of Weighted Automata3
A Note on Calculi for Non-deterministic Many-valued Logics3
Minimal Size of Counters for (Real-Time) Multicounter Automata3
Preface3
On the Expressive Power of Non-deterministic and Unambiguous Petri Nets over Infinite Words3
On Boolean Automata Networks (de)Composition13
Edge Forcing in Butterfly Networks2
Coverability, Termination, and Finiteness in Recursive Petri Nets2
Causal Semantics for BPP Nets with Silent Moves2
Reversible Regular Languages: Logical and Algebraic Characterisations2
Adaptive Merging on Phase Change Memory2
Perturbation Results for Distance-edge-monitoring Numbers2
Formal Concepts and Residuation on Multilattices2
High-degree Compression Functions on Alternative Models of Elliptic Curves and their Applications2
Order-theoretic Trees: Monadic Second-order Descriptions and Regularity2
Structural Liveness of Immediate Observation Petri Nets2
Number Conservation via Particle Flow in One-dimensional Cellular Automata2
Place the Vertices Anywhere on the Curve and Simplify2
A Detailed Study of the Distributed Rough Set Based Locality Sensitive Hashing Feature Selection Technique2
Circular Interval-valued Computers and Simulation of (Red-green) Turing Machines2
On Completeness of Cost Metrics and Meta-Search Algorithms in $-Calculus2
Single-sample Versus Case-control Sampling Scheme for Positive Unlabeled Data: the Story of Two Scenarios2
Perpetual Free-choice Petri Nets are Lucent Proof of a Theorem of van der Aalst Using CP-exhaustions2
Tomography and Applications1
Preface1
The Inverse of Ackermann Function is Computable in Linear Time1
Time-free Solution to Independent Set Problem using P Systems with Active Membranes1
Investigating Reversibility of Steps in Petri Nets1
Computing Parameterized Invariants of Parameterized Petri Nets1
Resource Bisimilarity in Petri Nets is Decidable1
The Complexity of Synthesis of b-Bounded Petri Nets1
A Non-Deterministic Multiset Query Language1
Parametric Analyses of Attack-fault Trees*1
Solving Infinite Games in the Baire Space1
Optimal Local Identifying and Local Locating-dominating Codes1
Cost Problems for Parametric Time Petri Nets*1
Separating the Words of a Language by Counting Factors1
A Polyhedral Abstraction for Petri Nets and its Application to SMT-Based Model Checking1
Preface1
Cost Automata, Safe Schemes, and Downward Closures1
Absent Subsequences in Words1
Adding Metalogic Features to Knowledge Representation Languages*1
A Note of Generalization of Fractional ID-factor-critical Graphs1
Efficient Algorithms for Maximum Induced Matching Problem in Permutation and Trapezoid Graphs1
Symbolic and Structural Model-Checking1
Automated Repair of Process Models with Non-local Constraints Using State-Based Region Theory1
Preface1
Spanning Structures in Walker–Breaker Games1
Relations between Control Mechanisms for Sequential Grammars11
On Random Number Generation for Kernel Applications1
Error Correction for Discrete Tomography1
0.19612503051758