On the public citation graph
Minimizing Deterministic Lattice Automata
0 signed · 37 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.1007/3-540-48683-6_25openalex-snapshot
Model Checking Partial State Spaces with 3-Valued Temporal Logics
inferredcites →https://doi.org/10.1007/3-540-55719-9_67openalex-snapshot
The equality problem for rational series with multiplicities in the tropical semiring is undecidable
inferredcites →https://doi.org/10.1007/3-540-63166-6_10openalex-snapshot
Construction of abstract state graphs with PVS
inferredcites →https://doi.org/10.1007/978-1-4684-2001-2_9openalex-snapshot
Reducibility among Combinatorial Problems
inferredcites →https://doi.org/10.1007/978-3-540-68279-0_8openalex-snapshot
Reducibility Among Combinatorial Problems
inferredcites →https://doi.org/10.1007/978-3-540-70545-1_23openalex-snapshot
Ranking Automata and Games for Prioritized Requirements
inferredcites →https://doi.org/10.1007/978-3-540-71441-5_22openalex-snapshot
Minimization of Lattice Automata
inferredcites →https://doi.org/10.1007/978-3-642-01492-5openalex-snapshot
Handbook of Weighted Automata
inferredcites →https://doi.org/10.1016/0378-4754(81)90068-9openalex-snapshot
Introduction to automata theory, languages and computation
inferredcites →https://doi.org/10.1016/j.fss.2007.03.003openalex-snapshot
Minimization of lattice finite automata and its application to the decomposition of lattice languages
inferredcites →https://doi.org/10.1016/j.tcs.2008.03.010openalex-snapshot
On model checking multiple hybrid views
inferredcites →https://doi.org/10.1016/s0020-0255(98)10073-7openalex-snapshot
Minimization of fuzzy finite automata
inferredcites →https://doi.org/10.1090/s0002-9939-1958-0135681-9openalex-snapshot
Linear Automaton Transformations
inferredcites →https://doi.org/10.1109/lics.2001.932516openalex-snapshot
Temporal logic query checking
inferredcites →https://doi.org/10.1142/s0129054110007192openalex-snapshot
LATTICED SIMULATION RELATIONS AND GAMES
inferredcites →https://doi.org/10.1142/s0218196794000063openalex-snapshot
THE EQUALITY PROBLEM FOR RATIONAL SERIES WITH MULTIPLICITIES IN THE TROPICAL SEMIRING IS UNDECIDABLE
inferredcites →https://doi.org/10.1145/1706299.1706319openalex-snapshot
From Boolean to quantitative notions of correctness
inferredcites →https://doi.org/10.25596/jalc-2005-287openalex-snapshot
On the Determinization of Weighted Automata
inferredcites →https://doi.org/10.3115/1073445.1073454openalex-snapshot
Simpler and more general minimization for weighted finite-state automata
inferredcites →https://doi.org/10.5555/380921.380927openalex-snapshot
Model-checking infinite state-space systems with fine-grained abstractions using SPIN
inferredcites →https://doi.org/10.5555/381473.381516openalex-snapshot
A framework for multi-valued reasoning over inconsistent viewpoints
inferredcites →https://doi.org/10.5555/972695.972698openalex-snapshot
Finite-state transducers in language and speech processing
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-030-86205-3_12openalex-snapshot
Optimization Modulo Non-linear Arithmetic via Incremental Linearization
inferred← citeshttps://doi.org/10.1007/978-3-031-19992-9_17openalex-snapshot
Learning and Characterizing Fully-Ordered Lattice Automata
inferred← citeshttps://doi.org/10.1007/978-3-319-23534-9_10openalex-snapshot
Inherent Vacuity in Lattice Automata
inferred← citeshttps://doi.org/10.1007/978-3-319-24704-5_5openalex-snapshot
Closure, Properties and Closure Properties of Multirelations
inferred← citeshttps://doi.org/10.1016/j.artint.2020.103449openalex-snapshot
Computational complexity of flat and generic Assumption-Based Argumentation, with and without probabilities
inferred← citeshttps://doi.org/10.1016/j.fss.2017.02.008openalex-snapshot
Algorithmic and logical characterizations of bisimulations for non-deterministic fuzzy transition systems
inferred← citeshttps://doi.org/10.1016/j.fss.2024.109108openalex-snapshot
Polynomial crisp-minimization algorithm for fuzzy deterministic automata
inferred← citeshttps://doi.org/10.1016/j.fss.2025.109535openalex-snapshot
Approximate state reduction of fuzzy finite automata
inferred← citeshttps://doi.org/10.1016/j.fss.2025.109677openalex-snapshot
Quasi-deterministic fuzzy automata: Isomorphisms and fuzzy deterministic automata minimization
inferred← citeshttps://doi.org/10.1016/j.ijar.2017.11.009openalex-snapshot
Empirical evaluation of abstract argumentation: Supporting the need for bipolar and probabilistic approaches
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.11.009openalex-snapshot
Uncertainty representation in dynamical systems using rough set theory
inferred← citeshttps://doi.org/10.1109/tfuzz.2023.3268406openalex-snapshot
Minimal Determinization Algorithm for Fuzzy Automata
inferred← citeshttps://doi.org/10.46298/lmcs-18(3:16)2022openalex-snapshot
Minimization and Canonization of GFG Transition-Based Automata
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.