On the public citation graph
Quantum automata and algebraic groups
0 signed · 90 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.1006/jsco.1998.0211openalex-snapshot
An Algorithm for Computing the Integral Closure
inferredcites →https://doi.org/10.1006/jsco.2001.0446openalex-snapshot
Computing the Radical of an Ideal in Positive Characteristic
inferredcites →https://doi.org/10.1006/jsco.2002.0525openalex-snapshot
Derivations and Radicals of Polynomial Ideals over Fields of Arbitrary Characteristic
inferredcites →https://doi.org/10.1006/jsco.2002.0560openalex-snapshot
The Calculation of Radical Ideals in Positive Characteristic
inferredcites →https://doi.org/10.1007/3-540-07141-5_213openalex-snapshot
The Solution of Problems Relative to Probabilistic Automata in the Frame of the Formal Languages Theory
inferredcites →https://doi.org/10.1007/3-540-08342-1_7openalex-snapshot
Some recursively unsolvable problems relating to isolated cutpoints in probabilistic automata
inferredcites →https://doi.org/10.1007/978-1-4612-0913-3openalex-snapshot
Gröbner Bases: A Computational Approach to Commutative Algebra
inferredcites →https://doi.org/10.1007/978-3-642-58951-5openalex-snapshot
Computational Methods in Commutative Algebra and Algebraic Geometry
inferredcites →https://doi.org/10.1007/978-3-642-74334-4openalex-snapshot
Lie Groups and Algebraic Groups
inferredcites →https://doi.org/10.1007/978-3-662-02838-4_8openalex-snapshot
Differential Galois Theory
inferredcites →https://doi.org/10.1007/978-3-662-04958-7openalex-snapshot
Computational Invariant Theory
inferredcites →https://doi.org/10.1007/978-3-662-11569-5openalex-snapshot
Diophantine Approximation on Linear Algebraic Groups: Transcendence Properties of the Exponential Function in Several Variables
inferredcites →https://doi.org/10.1007/bf02772615openalex-snapshot
Deciding finiteness for matrix semigroups over function fields over finite fields
inferredcites →https://doi.org/10.1007/bf02775029openalex-snapshot
Deciding finiteness for matrix groups over function fields
inferredcites →https://doi.org/10.1007/s00224-003-1061-2openalex-snapshot
Undecidable Problems for Probabilistic Automata of Fixed Dimension
inferredcites →https://doi.org/10.1016/0012-365x(72)90124-0openalex-snapshot
Introduction to probabilistic automata
inferredcites →https://doi.org/10.1016/c2013-0-11297-4openalex-snapshot
Introduction to Probabilistic Automata
inferredcites →https://doi.org/10.1016/s0304-3975(00)00154-7openalex-snapshot
Analogies and differences between quantum and stochastic automata
inferredcites →https://doi.org/10.1016/s0304-3975(98)00191-1openalex-snapshot
Quantum automata and quantum grammars
inferredcites →https://doi.org/10.1016/s0747-7171(10)80003-3openalex-snapshot
On the computational complexity and geometry of the first-order theory of the reals. Part I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals
inferredcites →https://doi.org/10.1016/s0747-7171(10)80005-7openalex-snapshot
On the computational complexity and geometry of the first-order theory of the reals. Part III: Quantifier elimination
inferredcites →https://doi.org/10.1017/cbo9780511897184.016openalex-snapshot
Linear relations on algebraic groups
inferredcites →https://doi.org/10.1109/sfcs.1997.646094openalex-snapshot
On the power of quantum finite state automata
inferredcites →https://doi.org/10.1137/s0097539703425861openalex-snapshot
Decidable and Undecidable Problems about Quantum Automata
inferredcites →https://doi.org/10.1145/164081.164104openalex-snapshot
Deciding finiteness of matrix groups in deterministic polynomial time
inferredcites →https://doi.org/10.1145/235809.235813openalex-snapshot
On the combinatorial and algebraic complexity of quantifier elimination
inferredcites →https://doi.org/10.1515/crll.1911.139.155openalex-snapshot
Über die Darstellung der symmetrischen und der alternierenden Gruppe durch gebrochene lineare Substitutionen.
inferredcites →https://doi.org/10.4064/aa-74-1-81-95openalex-snapshot
An effective lower bound for the height of algebraic numbers
inferredcites →https://doi.org/10.5860/choice.33-4552openalex-snapshot
Commutative algebra with a view toward algebraic geometry
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.2139/ssrn.4531704openalex-extracted
Computing the Binomial Part of a Polynomial Ideal
inferred← citeshttps://doi.org/10.1007/11780342_39openalex-snapshot
Uncomputability Below the Real Halting Problem
inferred← citeshttps://doi.org/10.1007/978-3-030-60026-6_36openalex-snapshot
Characterizing Triviality of the Exponent Lattice of a Polynomial Through Galois and Galois-Like Groups
inferred← citeshttps://doi.org/10.1007/978-3-031-72621-7_7openalex-snapshot
Quantum Automata and Languages of Finite Index
inferred← citeshttps://doi.org/10.1007/978-3-032-28404-4_1openalex-snapshot
On Some Decision Problems on Quantum Automata
inferred← citeshttps://doi.org/10.1007/978-3-540-27836-8_67openalex-snapshot
Universality in Quantum Computation
inferred← citeshttps://doi.org/10.1007/978-3-540-69507-3_25openalex-snapshot
Improved Undecidability Results on the Emptiness Problem of Probabilistic and Quantum Cut-Point Languages
inferred← citeshttps://doi.org/10.1007/978-3-540-74456-6_64openalex-snapshot
Real Computational Universality: The Word Problem for a Class of Groups with Infinite Presentation
inferred← citeshttps://doi.org/10.1007/978-3-642-38771-5_9openalex-snapshot
Quantum Finite Automata and Linear Context-Free Languages: A Decidable Problem
inferred← citeshttps://doi.org/10.1007/s00023-017-0604-zopenalex-snapshot
Universality of Single-Qudit Gates
inferred← citeshttps://doi.org/10.1007/s10208-009-9048-2openalex-snapshot
Real Computational Universality: The Word Problem for a Class of Groups with Infinite Presentation
inferred← citeshttps://doi.org/10.1016/j.exmath.2018.07.002openalex-snapshot
Linear groups and computation
inferred← citeshttps://doi.org/10.1016/j.jalgebra.2006.09.013openalex-snapshot
Deciding universality of quantum gates
inferred← citeshttps://doi.org/10.1016/j.jcss.2021.01.006openalex-snapshot
When are emptiness and containment decidable for probabilistic automata?
inferred← citeshttps://doi.org/10.1016/j.jsc.2006.03.007openalex-snapshot
Around the numeric–symbolic computation of differential Galois groups
inferred← citeshttps://doi.org/10.1016/j.jsc.2008.02.013openalex-snapshot
Constructing algebraic groups from their Lie algebras
inferred← citeshttps://doi.org/10.1016/j.jsc.2017.05.002openalex-snapshot
Embedding algorithms and applications to differential equations
inferred← citeshttps://doi.org/10.1016/j.jsc.2020.08.001openalex-snapshot
A fast algorithm for computing multiplicative relations between the roots of a generic polynomial
inferred← citeshttps://doi.org/10.1016/j.jsc.2022.01.006openalex-snapshot
Computing the Lie algebra of the differential Galois group: The reducible case
inferred← citeshttps://doi.org/10.1016/j.jsc.2024.102298openalex-snapshot
Computing the binomial part of a polynomial ideal
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.01.042openalex-snapshot
Some formal tools for analyzing quantum automata
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.10.023openalex-snapshot
Analyzing ultimate positivity for solvable systems
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115454openalex-snapshot
On the intersection problem for quantum finite automata
inferred← citeshttps://doi.org/10.1017/9781108692397.011openalex-snapshot
Practical Computation with Linear Groups Over Infinite Domains
inferred← citeshttps://doi.org/10.1090/mcom/3232openalex-snapshot
On the computation of the Galois group of linear difference equations
inferred← citeshttps://doi.org/10.1090/mcom/3236openalex-snapshot
Zariski density and computing in arithmetic groups
inferred← citeshttps://doi.org/10.1103/physreva.95.062303openalex-snapshot
Criteria for universality of quantum gates
inferred← citeshttps://doi.org/10.1109/lics56636.2023.10175691openalex-snapshot
Computing the linear hull: Deciding Deterministic? and Unambiguous? for weighted automata over fields
inferred← citeshttps://doi.org/10.1109/lics56636.2023.10175768openalex-snapshot
The Identity Problem in the special affine group of Z2
inferred← citeshttps://doi.org/10.1112/s1461157000001406openalex-snapshot
Finding Integral Linear Dependencies of Algebraic Numbers and Algebraic Lie Algebras
inferred← citeshttps://doi.org/10.1137/23m1581467openalex-snapshot
Semigroup Intersection Problems in the Heisenberg Groups
inferred← citeshttps://doi.org/10.1137/s0097539703425861openalex-snapshot
Decidable and Undecidable Problems about Quantum Automata
inferred← citeshttps://doi.org/10.1142/s0129054114400243openalex-snapshot
ON THE DECIDABILITY OF THE INTERSECTION PROBLEM FOR QUANTUM AUTOMATA AND CONTEXT-FREE LANGUAGES
inferred← citeshttps://doi.org/10.1145/2429135.2429159openalex-snapshot
Numeric-symbolic methods for computing the Liouvillian solutions of differential equations and systems
inferred← citeshttps://doi.org/10.1145/3209108.3209142openalex-snapshot
Polynomial Invariants for Affine Programs
inferred← citeshttps://doi.org/10.1145/3326229.3326243openalex-snapshot
An Effective Framework for Constructing Exponent Lattice Basis of Nonzero Algebraic Numbers
inferred← citeshttps://doi.org/10.1145/3476446.3536172openalex-snapshot
On the Computation of the Zariski Closure of Finitely Generated Groups of Matrices
inferred← citeshttps://doi.org/10.1145/3614319openalex-snapshot
On Strongest Algebraic Program Invariants
inferred← citeshttps://doi.org/10.1145/3618260.3649609openalex-snapshot
Semigroup Algorithmic Problems in Metabelian Groups
inferred← citeshttps://doi.org/10.1145/3636362.3636365openalex-snapshot
Recent Advances in Algorithmic Problems for Semigroups
inferred← citeshttps://doi.org/10.1145/3704862openalex-snapshot
Simple Linear Loops: Algebraic Invariants and Applications
inferred← citeshttps://doi.org/10.1145/3776698openalex-snapshot
Determination Problems for Orbit Closures and Matrix Groups
inferred← citeshttps://doi.org/10.20517/jsegc.2021.11openalex-snapshot
Green computing: three examples of how non-trivial mathematical analysis can help
inferred← citeshttps://doi.org/10.23638/lmcs-15(3:22)2019openalex-snapshot
Alternating, private alternating, and quantum alternating realtime automata
inferred← citeshttps://doi.org/10.35376/10324/5297openalex-snapshot
Métodos numérico-simbólicos para calcular soluciones liouvillianas de ecuaciones diferenciales lineales
inferred← citeshttps://doi.org/10.4230/lipics.concur.2020.32openalex-snapshot
Algebraic Invariants for Linear Hybrid Automata
inferred← citeshttps://doi.org/10.4230/lipics.concur.2021.28openalex-snapshot
The Orbit Problem for Parametric Linear Dynamical Systems
inferred← citeshttps://doi.org/10.4230/lipics.icalp.2019.44openalex-snapshot
On Reachability Problems for Low-Dimensional Matrix Semigroups
inferred← citeshttps://doi.org/10.4230/lipics.mfcs.2022.61openalex-snapshot
Large Galois groups with applications to Zariski density
inferred← citeshttps://doi.org/10.46298/lmcs-21(2:21)2025openalex-snapshot
The Identity Problem in the special affine group of $\mathbb{Z}^2$
inferred← citeshttps://doi.org/10.48550/arxiv.1111.5425openalex-snapshot
Are problems in Quantum Information Theory (un)decidable?
inferred← citeshttps://doi.org/10.48550/arxiv.1308.3301openalex-snapshot
Undecidability of MM-QFAs Language Equivalence Problem
inferred← citeshttps://doi.org/10.48550/arxiv.1603.08167openalex-snapshot
Embedding algorithms and applications to differential equations
inferred← citeshttps://doi.org/10.48550/arxiv.1805.03070openalex-snapshot
Continuous theory of operator expansions of finite dimensional Hilbert spaces, continuous structures of quantum circuits and decidability
inferred← citeshttps://doi.org/10.5281/zenodo.200730openalex-snapshot
FIGURE 5 in Two new species of protoplophorid mites (Acari: Oribatida: Protoplophoridae) from Thailand
inferred← citeshttps://doi.org/10.5555/2634074.2634101openalex-snapshot
Positivity problems for low-order linear recurrence sequences
inferred← citeshttps://doi.org/10.82308/31455openalex-snapshot
Applications of algebraic automata theory to quantum finite 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.