On the public citation graph
LANGAGE: A Maple package for automaton characterization of regular languages
0 signed · 23 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/(sici)1097-024x(199708)27:8<863::aid-spe109>3.0.co;2-#openalex-snapshot
AG: A set of Maple Packages for Manipulating Automata and Semigroups
inferredcites →https://doi.org/10.1007/bf01761708openalex-snapshot
Algebraic decision procedures for local testability
inferredcites →https://doi.org/10.1016/s0012-365x(73)80005-6openalex-snapshot
Characterizations of locally testable events
inferredcites →https://doi.org/10.1016/s0019-9958(65)90108-7openalex-snapshot
On finite monoids having only trivial subgroups
inferredcites →https://doi.org/10.1016/s0019-9958(85)80058-9openalex-snapshot
Complexity of some problems from the theory of automata
inferredcites →https://doi.org/10.1016/s0022-0000(72)80020-5openalex-snapshot
Locally testable languages
inferredcites →https://doi.org/10.1109/12.93741openalex-snapshot
A polynomial time algorithm for the local testability problem of deterministic finite automata
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-44669-9_33openalex-snapshot
Piecewise and Local Threshold Testability of DFA
inferred← citeshttps://doi.org/10.1007/3-540-44977-9_22openalex-snapshot
A Package TESTAS for Checking Some Kinds of Testability
inferred← citeshttps://doi.org/10.1007/3-540-45089-0_14openalex-snapshot
Reducing the Time Complexity of Testing for Local Threshold Testability
inferred← citeshttps://doi.org/10.1007/3-540-45526-4_15openalex-snapshot
An Algorithm to Verify Local Threshold Testability of Deterministic Finite Automata
inferred← citeshttps://doi.org/10.1007/978-981-97-2300-3_16openalex-snapshot
System Description: A Theorem-Prover for Subregular Systems: The Language Toolkit and Its Interpreter, Plebby
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.07.011openalex-snapshot
Reducing the time complexity of testing for local threshold testability
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00332-6openalex-snapshot
Families of locally testable languages
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00191-7openalex-snapshot
Algorithms finding the order of local testability of deterministic finite automaton and estimations of the order
inferred← citeshttps://doi.org/10.1109/tac.2013.2272885openalex-snapshot
Adaptive Symbolic Control for Finite-State Transition Systems With Grammatical Inference
inferred← citeshttps://doi.org/10.15398/jlm.v9i1.262openalex-snapshot
Typology emerges from simplicity in representations and learning
inferred← citeshttps://doi.org/10.48550/arxiv.2106.02312openalex-snapshot
Verification Tools for Checking some kinds of Testability
inferred← citeshttps://doi.org/10.5555/1756384.1756408openalex-snapshot
A package TESTAS for checking some kinds of testability
inferred← citeshttps://doi.org/10.7275/2n1j-pj39openalex-snapshot
Tier-Based Strictly Local Stringsets: Perspectives from Model and Automata Theory
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.