On the public citation graph
A probabilistic model of computing with words
0 signed · 69 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-10856-4_72openalex-snapshot
Probabilistic two-way machines
inferredcites →https://doi.org/10.1007/978-1-4612-0707-8openalex-snapshot
Neural Networks and Analog Computation
inferredcites →https://doi.org/10.1007/978-1-4615-1361-2_1openalex-snapshot
From Computing With Numbers to Computing With Words - From Manipulation of Measurements to Manipulation of Perceptions
inferredcites →https://doi.org/10.1007/978-3-642-76626-8openalex-snapshot
Speech Recognition and Understanding
inferredcites →https://doi.org/10.1007/978-3-642-76626-8_34openalex-snapshot
Stochastic Grammars and Pattern Recognition
inferredcites →https://doi.org/10.1016/0012-365x(72)90124-0openalex-snapshot
Introduction to probabilistic automata
inferredcites →https://doi.org/10.1016/0096-0551(80)90011-9openalex-snapshot
Introduction to automata theory, languages, and computation
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/c2013-0-11297-4openalex-snapshot
Introduction to Probabilistic Automata
inferredcites →https://doi.org/10.1016/s0019-9958(69)90554-3openalex-snapshot
Probabilistic and weighted grammars
inferredcites →https://doi.org/10.1016/s0304-3975(98)00191-1openalex-snapshot
Quantum automata and quantum grammars
inferredcites →https://doi.org/10.1023/a:1015731405826openalex-snapshot
Characterization of Sequential Quantum Machines
inferredcites →https://doi.org/10.1090/s0002-9939-1969-0249221-4openalex-snapshot
Probabilistic Turing Machines and Computability
inferredcites →https://doi.org/10.1098/rspa.1985.0070openalex-snapshot
Quantum theory, the Church–Turing principle and the universal quantum computer
inferredcites →https://doi.org/10.1109/proc.1983.12755openalex-snapshot
Syntactic pattern recognition and applications
inferredcites →https://doi.org/10.1109/sfcs.1997openalex-snapshot
Proceedings 38th Annual Symposium on Foundations of Computer Science
inferredcites →https://doi.org/10.1109/sfcs.1998.743469openalex-snapshot
1-way quantum finite automata: strengths, weaknesses and generalizations
inferredcites →https://doi.org/10.1109/t-c.1973.223746openalex-snapshot
Applying Probability Measures to Abstract Languages
inferredcites →https://doi.org/10.1109/t-c.1974.224001openalex-snapshot
Determination of Probabilistic Grammars for Functionally Specified Probability-Measure Languages
inferredcites →https://doi.org/10.1109/tfuzz.2002.803497openalex-snapshot
A formal model of computing with words
inferredcites →https://doi.org/10.1109/tfuzz.2003.819841openalex-snapshot
Computing with words via turing machines: a formal approach
inferredcites →https://doi.org/10.1111/j.1749-6632.2001.tb05718.xopenalex-snapshot
From Computing with Numbers to Computing with Words
inferredcites →https://doi.org/10.1126/science.7973651openalex-snapshot
Molecular Computation of Solutions to Combinatorial Problems
inferredcites →https://doi.org/10.1137/0206049openalex-snapshot
Computational Complexity of Probabilistic Turing Machines
inferredcites →https://doi.org/10.1137/s0097539799353443openalex-snapshot
Characterizations of 1-Way Quantum Finite Automata
inferredcites →https://doi.org/10.1145/175247.175255openalex-snapshot
Fuzzy logic, neural networks, and soft computing
inferredcites →https://doi.org/10.1145/356827.356829openalex-snapshot
Probabilistic Languages: A Review and Some Open Questions
inferredcites →https://doi.org/10.1145/581771.581773openalex-snapshot
Dense quantum coding and quantum finite automata
inferredcites →https://doi.org/10.1360/02yf9038openalex-snapshot
Automata theory based on complete residuated lattice-valued logic (II)
inferredcites →https://doi.org/10.1515/9781400882618-010openalex-snapshot
Computability by Probabilistic Machines
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/int.21952openalex-snapshot
A general type-2 fuzzy model for computing with words
inferred← citeshttps://doi.org/10.1007/978-3-319-18750-1_12openalex-snapshot
Advanced Computing with Words: Status and Challenges
inferred← citeshttps://doi.org/10.1007/s00500-018-3502-5openalex-snapshot
A formal model of semantic computing
inferred← citeshttps://doi.org/10.1007/s00500-024-09829-2openalex-snapshot
Hybrid model of general fuzzy automata and semantic computing: an application to transportation e-service
inferred← citeshttps://doi.org/10.1016/bs.adcom.2021.01.007openalex-snapshot
Generic quantum hardware accelerators for conventional systems
inferred← citeshttps://doi.org/10.1016/j.fss.2008.07.009openalex-snapshot
Grammar theory based on lattice-ordered monoid
inferred← citeshttps://doi.org/10.1016/j.fss.2008.07.010openalex-snapshot
Automata theory based on complete residuated lattice-valued logic: Pushdown automata
inferred← citeshttps://doi.org/10.1016/j.fss.2009.08.003openalex-snapshot
Lattice-valued fuzzy Turing machines: Computing power, universality and efficiency
inferred← citeshttps://doi.org/10.1016/j.fss.2012.03.001openalex-snapshot
Automata theory based on complete residuated lattice-valued logic: Turing machines
inferred← citeshttps://doi.org/10.1016/j.ijar.2008.03.004openalex-snapshot
Ontological approach to development of computing with words based systems
inferred← citeshttps://doi.org/10.1016/j.ins.2009.06.028openalex-snapshot
Approximation of fuzzy context-free grammars
inferred← citeshttps://doi.org/10.1016/j.ins.2014.05.055openalex-snapshot
An interval type-2 fuzzy model of computing with words
inferred← citeshttps://doi.org/10.1016/j.jcss.2012.09.002openalex-snapshot
Probabilistic automata for computing with words
inferred← citeshttps://doi.org/10.1016/s0947-3580(08)70768-4openalex-snapshot
Final Comments by the Authors
inferred← citeshttps://doi.org/10.1088/1757-899x/1047/1/012097openalex-snapshot
A reliability index for fuzzy expert group criterion
inferred← citeshttps://doi.org/10.1093/comjnl/bxv104openalex-snapshot
Parallel Fuzzy Regular Expression and its Conversion to Epsilon-Free Fuzzy Automaton
inferred← citeshttps://doi.org/10.1109/coginf.2010.5599686openalex-snapshot
Deterministic, probabilistic, fuzzy and quantum automata: Two unifying formulations
inferred← citeshttps://doi.org/10.1109/hpcs.2017.77openalex-snapshot
Revising Antimirov's Partial Derivatives for Fuzzy Regular Expressions
inferred← citeshttps://doi.org/10.1109/nlpke.2005.1598714openalex-snapshot
A Lattice-Valued Model of Computing with Words
inferred← citeshttps://doi.org/10.1109/ted.2007.893191openalex-snapshot
Universal Bias Dependence of Excess Current Induced by Self-Heating Effect for a-Si:H TFTs
inferred← citeshttps://doi.org/10.1109/tfuzz.2007.896301openalex-snapshot
Retraction and Generalized Extension of Computing With Words
inferred← citeshttps://doi.org/10.1109/tfuzz.2009.2035816openalex-snapshot
A Fuzzy Petri-Nets Model for Computing With Words
inferred← citeshttps://doi.org/10.1142/s1793005722500053openalex-snapshot
An Interval Type-2 Fuzzy Model of Computing with Words via Interval Type-2 Fuzzy Finite Rough Automata with Application in COVID-19 Deduction
inferred← citeshttps://doi.org/10.3217/jucs-016-01-0003openalex-snapshot
Some Views on Information Fusion and Logic Based Approaches in Decision Making under Uncertainty
inferred← citeshttps://doi.org/10.3233/ifs-152038openalex-snapshot
Conversion of fuzzy automata into fuzzy regular expressions using transitive closure
inferred← citeshttps://doi.org/10.3390/e21090903openalex-snapshot
A Formal Model for Semantic Computing Based on Generalized Probabilistic Automata
inferred← citeshttps://doi.org/10.48550/arxiv.1112.3435openalex-snapshot
An Alternative Interpretation of Linguistic Variables as Linguistic Finite Automata
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0604070openalex-snapshot
Retraction and Generalized Extension of Computing with Words
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.