On the public citation graph
Computation and Automata
0 signed · 102 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 points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/inco.1998.2718openalex-snapshot
On Number Systems with Finite Degree of Ambiguity
inferred← citeshttps://doi.org/10.1006/inco.1998.2786openalex-snapshot
Derivation Trees of Ground Term Rewriting Systems
inferred← citeshttps://doi.org/10.1007/3-540-18625-5_38openalex-snapshot
On ambiguity of DTOL systems
inferred← citeshttps://doi.org/10.1007/3-540-29937-8_11openalex-snapshot
Membrane Algorithms: Approximate Algorithms for NP-Complete Optimization Problems
inferred← citeshttps://doi.org/10.1007/3-540-36231-2_7openalex-snapshot
Tree Replacement and Public Key Cryptosystem
inferred← citeshttps://doi.org/10.1007/3-540-46011-x_1openalex-snapshot
Automata: From Uncertainty to Quantum
inferred← citeshttps://doi.org/10.1007/3-540-48321-7_3openalex-snapshot
Caesar and DNA — views on cryptology
inferred← citeshttps://doi.org/10.1007/3-540-50647-0_112openalex-snapshot
Basic research for cellular processing
inferred← citeshttps://doi.org/10.1007/3-540-55610-9_180openalex-snapshot
A survey of equivalence notions for net based systems
inferred← citeshttps://doi.org/10.1007/3-540-55808-x_48openalex-snapshot
Characterizing regular languages with polynomial densities
inferred← citeshttps://doi.org/10.1007/3-540-58131-6_53openalex-snapshot
Learning theoretical aspects is important but (Sometimes) dangerous
inferred← citeshttps://doi.org/10.1007/3-540-58131-6_56openalex-snapshot
Cryptographic protocols for auctions and bargaining
inferred← citeshttps://doi.org/10.1007/3-540-58338-6_108openalex-snapshot
The finest homophonic partition and related code concepts
inferred← citeshttps://doi.org/10.1007/978-1-4471-4276-8_2openalex-snapshot
Languages, Decidability, and Complexity
inferred← citeshttps://doi.org/10.1007/978-1-4613-9323-8_19openalex-snapshot
Deciding Code Related Properties by Means of Finite Transducers
inferred← citeshttps://doi.org/10.1007/978-1-4684-5511-3_34openalex-snapshot
IC* Supercomputing Environment
inferred← citeshttps://doi.org/10.1007/978-3-540-24582-7_16openalex-snapshot
Public Key Cryptosystems Based on Free Partially Commutative Monoids and Groups
inferred← citeshttps://doi.org/10.1007/978-3-540-24635-0_7openalex-snapshot
The Power of Networks of Watson-Crick D0L Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-39886-8_1openalex-snapshot
Basic Notation and Terminology
inferred← citeshttps://doi.org/10.1007/978-3-540-92910-9_34openalex-snapshot
Molecular Computing Machineries — Computing Models and Wet Implementations
inferred← citeshttps://doi.org/10.1007/978-3-642-36505-8_9openalex-snapshot
Approximation of Sets Based on Partial Covering
inferred← citeshttps://doi.org/10.1007/978-3-642-44958-1_27openalex-snapshot
Abstraction Super-Structuring Normal Forms: Towards a Theory of Structural Induction
inferred← citeshttps://doi.org/10.1007/978-3-642-58117-5_14openalex-snapshot
A High-Level Language for L-systems and Its Applications
inferred← citeshttps://doi.org/10.1007/978-3-642-59136-5_4openalex-snapshot
Aspects of Classical Language Theory
inferred← citeshttps://doi.org/10.1007/978-3-642-60207-8_19openalex-snapshot
Word Length Controlled DT0L Systems and Slender Languages
inferred← citeshttps://doi.org/10.1007/978-3-642-80350-5_54openalex-snapshot
A Decision Method for the Unambiguity of Sets Defined by Number Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-83462-2_20openalex-snapshot
Cryptosystems for Picture Languages
inferred← citeshttps://doi.org/10.1007/978-3-662-04978-5_4openalex-snapshot
Computably Enumerable Instantaneous Codes
inferred← citeshttps://doi.org/10.1007/978-3-662-07675-0_1openalex-snapshot
Complexity: A Language-Theoretic Point of View
inferred← citeshttps://doi.org/10.1007/978-94-011-1372-4_14openalex-snapshot
The Nearly Perfect Auctioneer: Cryptographic Protocols for Auctions and Bidding
inferred← citeshttps://doi.org/10.1007/bf01068352openalex-snapshot
Formal technology and universal systems. II
inferred← citeshttps://doi.org/10.1007/bf01075083openalex-snapshot
Formal technology and universal systems. I
inferred← citeshttps://doi.org/10.1007/bf01083171openalex-snapshot
On the difficulty of making social choices
inferred← citeshttps://doi.org/10.1007/bf01125123openalex-snapshot
Formal apparatus for knowledge representation based on post production systems
inferred← citeshttps://doi.org/10.1007/bf01384489openalex-snapshot
Cryptographic protocols for Vickrey auctions
inferred← citeshttps://doi.org/10.1007/bf02481771openalex-snapshot
Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors
inferred← citeshttps://doi.org/10.1007/bfb0015940openalex-snapshot
A cryptosystem based on propositional logic
inferred← citeshttps://doi.org/10.1016/0020-0190(87)90044-5openalex-snapshot
A DOL-TOL public key cryptosystem
inferred← citeshttps://doi.org/10.1016/0020-0255(91)90071-2openalex-snapshot
Many aspects of formal languages
inferred← citeshttps://doi.org/10.1016/0167-4048(88)90507-xopenalex-snapshot
A public-key cryptosystem based on language theory
inferred← citeshttps://doi.org/10.1016/0176-2680(92)90027-eopenalex-snapshot
Secret ballot elections and public-key cryptosystems
inferred← citeshttps://doi.org/10.1016/0304-3975(86)90099-xopenalex-snapshot
On a public-key cryptosystem based on iterated morphisms and substitutions
inferred← citeshttps://doi.org/10.1016/0304-3975(88)90105-3openalex-snapshot
On a subclass of ∞-regular languages
inferred← citeshttps://doi.org/10.1016/0304-3975(89)90144-8openalex-snapshot
Observations concerning a public-key cryptosystem based on iterated morphisms
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90077-fopenalex-snapshot
A deterministic algorithm for modular knapsack problems
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00050-6openalex-snapshot
On recursive bounds for the exceptional values in speed-up
inferred← citeshttps://doi.org/10.1016/0304-3975(94)90041-8openalex-snapshot
Rice's theorem for the limit sets of cellular automata
inferred← citeshttps://doi.org/10.1016/0304-4068(91)90001-aopenalex-snapshot
Computability and randomness of Nash equilibrium in infinite games
inferred← citeshttps://doi.org/10.1016/0370-1573(92)90047-4openalex-snapshot
Off-critical statistical models: Factorized scattering theories and bootstrap program
inferred← citeshttps://doi.org/10.1016/j.chaos.2017.09.033openalex-snapshot
“Viral” Turing Machines, computation from noise and combinatorial hierarchies
inferred← citeshttps://doi.org/10.1016/j.engappai.2008.05.005openalex-snapshot
From controlled dynamical systems to context-dependent grammars: A connectionist approach
inferred← citeshttps://doi.org/10.1016/j.ic.2023.105093openalex-snapshot
Bideterministic weighted automata
inferred← citeshttps://doi.org/10.1016/j.ins.2014.03.126openalex-snapshot
A scheme for data confidentiality in Cloud-assisted Wireless Body Area Networks
inferred← citeshttps://doi.org/10.1016/j.jcss.2014.10.004openalex-snapshot
Products of matrices and recursively enumerable sets
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.03.040openalex-snapshot
Hierarchy and equivalence of multi-letter quantum finite automata
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.08.028openalex-snapshot
Quasi-universal k-regular sequences
inferred← citeshttps://doi.org/10.1016/s0005-1098(00)00050-9openalex-snapshot
A survey of computational complexity results in systems and control
inferred← citeshttps://doi.org/10.1016/s0022-0000(05)80025-xopenalex-snapshot
Reversibility and surjectivity problems of cellular automata
inferred← citeshttps://doi.org/10.1016/s0049-237x(98)80012-8openalex-snapshot
Chapter 11 A bibliography of recursive algebra and recursive model theory
inferred← citeshttps://doi.org/10.1016/s0049-237x(98)80047-5openalex-snapshot
Chapter 14 Computability theory and linear orderings
inferred← citeshttps://doi.org/10.1016/s0165-1889(97)00011-0openalex-snapshot
On the computability of Nash equilibria
inferred← citeshttps://doi.org/10.1016/s0166-8641(99)00063-2openalex-snapshot
On complexity of the word problem in braid groups and mapping class groups
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00211-5openalex-snapshot
Multiple splicing systems and the universal computability
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00891-5openalex-snapshot
A family of NFAs which need 2n−α deterministic states
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00221-7openalex-snapshot
Finite nondeterministic automata: Simulation and minimality
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)39238-8openalex-snapshot
Modelling Electromechanical Drive Systems: A Formal Language Approach
inferred← citeshttps://doi.org/10.1023/a:1018945021759openalex-snapshot
A comparative overview ofcryptographic voting protocols
inferred← citeshttps://doi.org/10.1023/a:1021391912063openalex-snapshot
Molecular computing paradigm – toward freedom from Turing's charm
inferred← citeshttps://doi.org/10.1051/ita/2017001openalex-snapshot
Rational series with high image complexity
inferred← citeshttps://doi.org/10.1080/00207160211924openalex-snapshot
Some Characterization of Recursively Enumerable Sets
inferred← citeshttps://doi.org/10.1080/03081079108935155openalex-snapshot
SOME NON-BIOLOGICAL APPLICATIONS OF L-SYSTEMS
inferred← citeshttps://doi.org/10.1080/13546780042000046openalex-snapshot
Dynamic systems as tools for analysing human judgement
inferred← citeshttps://doi.org/10.1080/14640749308401068openalex-snapshot
Finite-State Automata: Dynamic Task Environments in Problem-Solving Research
inferred← citeshttps://doi.org/10.1103/revmodphys.74.347openalex-snapshot
Information and computation: Classical and quantum aspects
inferred← citeshttps://doi.org/10.1109/18.532902openalex-snapshot
The finest homophonic partition and related code concepts
inferred← citeshttps://doi.org/10.1109/32.4652openalex-snapshot
The IC* model of parallel computation and programming environment
inferred← citeshttps://doi.org/10.1109/91.917116openalex-snapshot
New trends in recognizing experimental drives: fuzzy logic and formal language theories
inferred← citeshttps://doi.org/10.1109/ias.2000.882091openalex-snapshot
A novel grammatical inference learning algorithm for automatic modelling of drive systems
inferred← citeshttps://doi.org/10.1109/icec.1997.592299openalex-snapshot
On the power of circular splicing systems and DNA computability
inferred← citeshttps://doi.org/10.1109/icit.2009.4939510openalex-snapshot
Grammatical flux estimator for sensorless ac-drives
inferred← citeshttps://doi.org/10.1109/iecon.2002.1185262openalex-snapshot
Formal language control of induction motor drives
inferred← citeshttps://doi.org/10.1109/jproc.2007.893252openalex-snapshot
Syntactic Modeling and Signal Processing of Multifunction Radars: A Stochastic Context-Free Grammar Approach
inferred← citeshttps://doi.org/10.1145/1017074.1017096openalex-snapshot
On validation of XML streams using finite state machines
inferred← citeshttps://doi.org/10.1145/174130.174141openalex-snapshot
Decidability of bisimulation equivalence for process generating context-free languages
inferred← citeshttps://doi.org/10.1145/62075.62079openalex-snapshot
The IC model of parallel computation and programming environment
inferred← citeshttps://doi.org/10.13164/ma.2016.08openalex-snapshot
Two-dimensional jumping finite automata
inferred← citeshttps://doi.org/10.2307/1913776openalex-snapshot
Learning Rational Expectations Under Computability Constraints
inferred← citeshttps://doi.org/10.25596/jalc-2005-061openalex-snapshot
Some New Aspects of Word-Length Controlled DT0L Systems
inferred← citeshttps://doi.org/10.31274/rtd-180813-17073openalex-snapshot
Structural induction: towards automatic ontology elicitation
inferred← citeshttps://doi.org/10.3233/fi-2010-338openalex-snapshot
Regulated Nondeterminism in Pushdown Automata: The Non-Regular Case
inferred← citeshttps://doi.org/10.4064/aa-61-1-51-67openalex-snapshot
A class of transcendental numbers with explicit g-adic expansion and the Jacobi-Perron algorithm
inferred← citeshttps://doi.org/10.4064/aa-71-4-301-329openalex-snapshot
A class of transcendental numbers having explicit g-adic and Jacobi-Perron expansions of arbitrary dimension
inferred← citeshttps://doi.org/10.4467/20838476si.13.001.2086openalex-snapshot
On Normal Forms and Erasing Rules in Path Controlled Grammars
inferred← citeshttps://doi.org/10.48550/arxiv.1410.4925openalex-snapshot
Finitely unstable theories and computational complexity
inferred← citeshttps://doi.org/10.48550/arxiv.quant-ph/9903008openalex-snapshot
Classical computing, quantum computing, and Shor's factoring algorithm
inferred← citeshttps://doi.org/10.5555/1231159.1231161openalex-snapshot
Automata Recognizing No Words: A Statistical Approach
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.