On the public citation graph

Amore: A system for computing automata, MOnoids, and regular expressions

0 signed · 15 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-1-4613-2215-3openalex-snapshot
Varieties of Formal Languages
inferredcites →https://doi.org/10.1109/tsmc.1981.4308636openalex-snapshot
Methods for Visual Understanding of Hierarchical System Structures

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/11559306_12openalex-snapshot
Proving and Disproving Termination of Higher-Order Functions
inferred← citeshttps://doi.org/10.1007/11602613_68openalex-snapshot
Decision Making Based on Approximate and Smoothed Pareto Curves
inferred← citeshttps://doi.org/10.1007/11672142_46openalex-snapshot
A Faster Algorithm for the Steiner Tree Problem
inferred← citeshttps://doi.org/10.1007/11734666_9openalex-snapshot
Tampering with Motes: Real-World Physical Attacks on Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1007/978-3-030-36778-7_4openalex-snapshot
Virtual Teacher Based Tool for Teaching Context-Free Grammars by Active Pedagogy and eMathTeacher Philosophy
inferred← citeshttps://doi.org/10.1007/978-3-540-71209-1_8openalex-snapshot
Counterexamples in Probabilistic Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-540-75101-4_26openalex-snapshot
Achieving Highly Reliable Embedded Software: An Empirical Evaluation of Different Approaches
inferred← citeshttps://doi.org/10.1007/978-3-642-18098-9_10openalex-snapshot
From Sequential Extended Regular Expressions to NFA with Symbolic Labels
inferred← citeshttps://doi.org/10.1109/synasc.2012.49openalex-snapshot
ReFaM: A Software Tool for Minimizing Nondeterministic Finite Automata
inferred← citeshttps://doi.org/10.1145/1721695.1721702openalex-snapshot
Model checking of software for microcontrollers
inferred← citeshttps://doi.org/10.4236/ijcns.2012.529074openalex-snapshot
Local Search Heuristics for NFA State Minimization Problem
inferred← citeshttps://doi.org/10.5120/ijais15-451298openalex-snapshot
A New NFA Reduction Algorithm for State Minimization Problem
inferred← citeshttps://doi.org/10.5120/ijais15-451324openalex-snapshot
LR Rotation Rule for Creating Minimal NFA
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.