Fundamenta Informaticae

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
Finding Codes on Infinite Grids Automatically	0
Computing Square Roots in Quaternion Algebras	0
Efficient Algorithms for Maximum Induced Matching Problem in Permutation and Trapezoid Graphs	0
On Finding Hamiltonian Cycles in Barnette Graphs	0

Investigating Reversibility of Steps in Petri Nets	0
Preface	0
Strong Regulatory Graphs	0
Preface	0
Adding Metalogic Features to Knowledge Representation Languages*	0
Methods for Efficient Unfolding of Colored Petri Nets	0
On Morphisms Preserving Palindromic Richness	0
Coxeter Invariants for Non-negative Unit Forms of Dynkin Type ????r	0
Symbolic and Structural Model-Checking	0
Nonatomic Non-Cooperative Neighbourhood Balancing Games	0
Preface: Information Granulation in Data Science and Scalable Computing	0
Solving Infinite Games in the Baire Space	0
Cost Problems for Parametric Time Petri Nets*	0
Free-choice Nets with Home Clusters are Lucent	0
On the Expressive Power of Non-deterministic and Unambiguous Petri Nets over Infinite Words	0
Affine Completeness of Some Free Binary Algebras	0
Perturbation Results for Distance-edge-monitoring Numbers	0
High-degree Compression Functions on Alternative Models of Elliptic Curves and their Applications	0
On Boolean Automata Networks (de)Composition1	0
Place the Vertices Anywhere on the Curve and Simplify	0
A Graph Theoretical Framework for the Strong Gram Classification of Non-negative Unit Forms of Dynkin Type ????n	0
Polynomial-time Classification of Skew-symmetrizable Matrices with a Positive Definite Quasi-Cartan Companion	0
Languages Accepted by Weighted Restarting Automata*	0
Residuated Algebraic Structures in the Vicinity of Pre-rough Algebra and Decidability	0
Maximal and Minimal Dynamic Petri Net Slicing	0
Time-free Solution to Independent Set Problem using P Systems with Active Membranes	0
On Rough Approximations of Languages under Infinite Index Indiscernibility Relations	0
Persistent Stochastic Non-Interference	0
Preface	0
Towards Syntactic Epistemic Logic	0
Optimal Local Identifying and Local Locating-dominating Codes	0
Skeleton Abstraction for Universal Temporal Properties	0
Resource Bisimilarity in Petri Nets is Decidable	0
Preface	0
Perfect Domination, Roman Domination and Perfect Roman Domination in Lexicographic Product Graphs	0
A Linear Bound on the k-rendezvous Time for Primitive Sets of NZ Matrices	0
Scattered Context Grammars with One Non-Context-Free Production are Computationally Complete	0
A New Description of Transversal Matroids Through Rough Set Approach	0
Parametric Schedulability Analysis of a Launcher Flight Control System under Reactivity Constraints*	0
Synthesis of Pure and Impure Petri Nets with Restricted Place-environments: Complexity Issues	0
KNN Loss and Deep KNN	0
On Insecure Uses of BGN for Privacy Preserving Data Aggregation Protocols	0
Continuous Domains in Formal Concept Analysis	0
Clustering Geometrically-Modeled Points in the Aggregated Uncertainty Model	0
Self-Verifying Pushdown and Queue Automata	0
Decidability of Definability Issues in the Theory of Real Addition	0
On Three Domination-based Identification Problems in Block Graphs	0
Reachability in Simple Neural Networks	0
Preface	0
On Iiro Honkala’s Contributions to Identifying Codes	0
Parametric Analyses of Attack-fault Trees*	0
A Local Diagnosis Algorithm for Hypercube-like Networks under the BGM Diagnosis Model	0
Preface	0
Morphisms and Minimisation of Weighted Automata	0
A Non-Deterministic Multiset Query Language	0
On the Tutte and Matching Polynomials for Complete Graphs	0
Myhill-Nerode Theorem for Higher-Dimensional Automata	0
Diffuse and Localized Functional Dysconnectivity in Schizophrenia: a Bootstrapped Top-Down Approach	0
Causal Semantics for BPP Nets with Silent Moves	0
Using Hoare Logic in a Process Algebra Setting	0
A Detailed Study of the Distributed Rough Set Based Locality Sensitive Hashing Feature Selection Technique	0
Diameter of General Knödel Graphs	0
Preface	0
A Rewriting-logic-with-SMT-based Formal Analysis and Parameter Synthesis Framework for Parametric Time Petri Nets	0
Freeness Problem for Matrix Semigroups of Parikh Matrices	0
Non-Self-Embedding Grammars and Descriptional Complexity	0
Computing Parameterized Invariants of Parameterized Petri Nets	0
Elimination Distance to Bounded Degree on Planar Graphs Preprint	0
On the Hardness of Energy Minimisation for Crystal Structure Prediction	0
Global Types and Event Structure Semantics for Asynchronous Multiparty Sessions	0
Decidability Questions for Insertion Systems and Related Models	0
A Unified Method to Decentralized State Detection and Fault Diagnosis/prediction of Discrete-event Systems	0
Waiting Nets: State Classes and Taxonomy	0
Soundness Verification of Data-Aware Process Models with Variable-to-Variable Conditions	0
Coverability, Termination, and Finiteness in Recursive Petri Nets	0
Exact and Approximate Algorithms for Computing Betweenness Centrality in Directed Graphs	0
Minimal Size of Counters for (Real-Time) Multicounter Automata	0
Closeness and Vertex Residual Closeness of Harary Graphs	0
On Rotation Distance of Rank Bounded Trees	0
On Complexity Bounds and Confluence of Parallel Term Rewriting*	0

Spanning Structures in Walker–Breaker Games	0
Recognizing Visibility Graphs of Triangulated Irregular Networks	0
Proving Confluence in the Confluence Framework with CONFident	0
Automated Repair of Process Models with Non-local Constraints Using State-Based Region Theory	0
Reconstruction of Convex Sets from One or Two X-rays	0
Nominal Unification and Matching of Higher Order Expressions with Recursive Let	0
The Inverse of Ackermann Function is Computable in Linear Time	0
Preface	0
Network Capacity Bound for Personalized PageRank in Multimodal Networks	0
Edge Forcing in Butterfly Networks	0
Two Sufficient Conditions for Graphs to Admit Path Factors	0
Tomography and Applications	0
Separating the Words of a Language by Counting Factors	0
Daniel Simson Obituary	0
Query-Points Visibility Constraint Minimum Link Paths in Simple Polygons	0
A Note on Calculi for Non-deterministic Many-valued Logics	0
Testing Boolean Functions Properties	0
On Taxicab Distance Mean Functions and their Geometric Applications: Methods, Implementations and Examples	0
Generative Capacity of Contextual Grammars with Subregular Selection Languages*	0
Theory of Constructive Semigroups with Apartness – Foundations, Development and Practice	0
Formal Concepts and Residuation on Multilattices	0