On the public citation graph
NC1: The automata-theoretic viewpoint
0 signed · 76 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/bf01744431openalex-snapshot
Parity, circuits, and the polynomial-time hierarchy
inferredcites →https://doi.org/10.1007/bf01761708openalex-snapshot
Algebraic decision procedures for local testability
inferredcites →https://doi.org/10.1007/bfb0015770openalex-snapshot
Finite group topology and p-adic topology for free monoids
inferredcites →https://doi.org/10.1007/bfb0035785openalex-snapshot
Automata theory meets circuit complexity
inferredcites →https://doi.org/10.1016/0021-8693(87)90048-2openalex-snapshot
Inverse semigroups and varieties of finite semigroups
inferredcites →https://doi.org/10.1016/0022-0000(78)90049-1openalex-snapshot
The dot-depth hierarchy of star-free languages is infinite
inferredcites →https://doi.org/10.1016/0022-0000(80)90003-3openalex-snapshot
Languages of R-trivial monoids
inferredcites →https://doi.org/10.1016/0022-0000(88)90030-xopenalex-snapshot
Parallel computation with threshold functions
inferredcites →https://doi.org/10.1016/0022-0000(89)90037-8openalex-snapshot
Bounded-width polynomial-size branching programs recognize exactly those languages in NC1
inferredcites →https://doi.org/10.1016/0022-0000(90)90022-dopenalex-snapshot
On uniformity within NC1
inferredcites →https://doi.org/10.1016/0022-4049(88)90097-7openalex-snapshot
Locally trivial categories and unambiguous concatenation
inferredcites →https://doi.org/10.1016/0168-0072(83)90038-6openalex-snapshot
∑11-Formulae on finite structures
inferredcites →https://doi.org/10.1016/0196-6774(86)90011-8openalex-snapshot
The NP-completeness column: An ongoing guide
inferredcites →https://doi.org/10.1016/0196-6774(86)90020-9openalex-snapshot
The NP-completeness column: An ongoing guide
inferredcites →https://doi.org/10.1016/0304-3975(81)90057-8openalex-snapshot
Classification of finite monoids: the language approach
inferredcites →https://doi.org/10.1016/0304-3975(92)90152-6openalex-snapshot
Formulas, regular languages and boolean circuits
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/0890-5401(90)90007-5openalex-snapshot
Non-uniform automata over groups
inferredcites →https://doi.org/10.1016/b978-0-12-198820-3.50021-8openalex-snapshot
SUBWORD COUNTING AND NILPOTENT GROUPS
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.1090/s0002-9947-1965-0188316-1openalex-snapshot
Algebraic Theory of Machines. I. Prime Decomposition Theorem for Finite Semigroups and Machines
inferredcites →https://doi.org/10.1109/fscs.1990.89583openalex-snapshot
ON ACC and threshold circuits
inferredcites →https://doi.org/10.1109/sct.1990.113968openalex-snapshot
Extensions to Barrington's M-program model
inferredcites →https://doi.org/10.1109/sfcs.1985.49openalex-snapshot
Separating the polynomial-time hierarchy by oracles
inferredcites →https://doi.org/10.1137/0215040openalex-snapshot
Bounds for Width Two Branching Programs
inferredcites →https://doi.org/10.1137/0218027openalex-snapshot
Relativized Polynomial Time Hierarchies Having Exactly K Levels
inferredcites →https://doi.org/10.1142/s0218196791000043openalex-snapshot
CONSTANT-DEPTH PERIODIC CIRCUITS
inferredcites →https://doi.org/10.1145/12130.12131openalex-snapshot
Bounded-width polynomial-size branching programs recognize exactly those languages in NC 1
inferredcites →https://doi.org/10.1145/28395.28404openalex-snapshot
Algebraic methods in the theory of lower bounds for Boolean circuit complexity
inferredcites →https://doi.org/10.1145/48014.63138openalex-snapshot
Finite monoids and the fine structure of NC 1
inferredcites →https://doi.org/10.1145/800061.808733openalex-snapshot
Borel sets and circuit complexity
inferredcites →https://doi.org/10.1515/9781400882618-002openalex-snapshot
Representation of Events in Nerve Nets and 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.1006/inco.1996.0071openalex-snapshot
Logspace and Logtime Leaf Languages
inferred← citeshttps://doi.org/10.1006/jcss.1998.1588openalex-snapshot
NondeterministicNC1Computation
inferred← citeshttps://doi.org/10.1006/jcss.2000.1742openalex-snapshot
The Descriptive Complexity Approach to LOGCFL
inferred← citeshttps://doi.org/10.1007/11874683_28openalex-snapshot
An Algebraic Point of View on the Crane Beach Property
inferred← citeshttps://doi.org/10.1007/3-540-44612-5_13openalex-snapshot
Equation Satisfiability and Program Satisfiability for Finite Monoids
inferred← citeshttps://doi.org/10.1007/3-540-49381-6_27openalex-snapshot
On the Complexity of Free Monoid Morphisms
inferred← citeshttps://doi.org/10.1007/3-540-56503-5_55openalex-snapshot
Circuits with monoidal gates
inferred← citeshttps://doi.org/10.1007/3-540-57785-8_149openalex-snapshot
A new parallel vector model, with exact characterization of NCk
inferred← citeshttps://doi.org/10.1007/3-540-62034-6_33openalex-snapshot
Circuit complexity before the dawn of the new millennium
inferred← citeshttps://doi.org/10.1007/978-1-4612-1388-8_12openalex-snapshot
Multiparty Communication Complexity of Finite Monoids
inferred← citeshttps://doi.org/10.1007/978-1-4612-1872-2_11openalex-snapshot
Polynomials and Combinatorial Definitions of Languages
inferred← citeshttps://doi.org/10.1007/978-3-030-40608-0_22openalex-snapshot
The Power of Programs over Monoids in J
inferred← citeshttps://doi.org/10.1007/978-3-030-68195-1_3openalex-snapshot
On the Computational Power of Programs over $$\mathsf {BA}_2$$ Monoid
inferred← citeshttps://doi.org/10.1007/978-3-031-52113-3_27openalex-snapshot
Complexity of Spherical Equations in Finite Groups
inferred← citeshttps://doi.org/10.1007/978-3-319-30000-9_22openalex-snapshot
Using Duality in Circuit Complexity
inferred← citeshttps://doi.org/10.1007/978-3-319-42634-1_47openalex-snapshot
Cost Register Automata for Nested Words
inferred← citeshttps://doi.org/10.1007/978-3-642-00982-2_3openalex-snapshot
Descriptional and Computational Complexity of Finite Automata
inferred← citeshttps://doi.org/10.1007/978-94-011-0149-3_5openalex-snapshot
Logics for Regular Languages, Finite Monoids, and Circuit Complexity
inferred← citeshttps://doi.org/10.1007/bf01263424openalex-snapshot
Representing Boolean functions as polynomials modulo composite numbers
inferred← citeshttps://doi.org/10.1007/bfb0055038openalex-snapshot
An algebraic approach to communication complexity
inferred← citeshttps://doi.org/10.1016/0022-0000(93)90039-yopenalex-snapshot
Functions with bounded symmetric communication complexity, programs over commutative monoids, and ACC
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90253-popenalex-snapshot
Extensions to Barrington's M-program model
inferred← citeshttps://doi.org/10.1016/j.ic.2010.11.013openalex-snapshot
Descriptional and computational complexity of finite automata—A survey
inferred← citeshttps://doi.org/10.1016/j.ic.2019.104443openalex-snapshot
A topological approach to non-uniform complexity
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00297-6openalex-snapshot
Finite semigroup varieties defined by programs
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00119-9openalex-snapshot
Languages recognized by finite aperiodic groupoids
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00278-9openalex-snapshot
Programs over semigroups of dot-depth one
inferred← citeshttps://doi.org/10.1109/ccc.1996.507664openalex-snapshot
Nondeterministic NC/sup 1/ computation
inferred← citeshttps://doi.org/10.1109/focs.2006.46openalex-snapshot
Lower bounds for circuits with MOD_m gates
inferred← citeshttps://doi.org/10.1109/sct.1992.215384openalex-snapshot
Circuits, matrices, and nonassociative computation
inferred← citeshttps://doi.org/10.1109/sct.1994.315799openalex-snapshot
Logspace and logtime leaf languages
inferred← citeshttps://doi.org/10.1137/s0097539793249530openalex-snapshot
Finite Monoids: From Word to Circuit Evaluation
inferred← citeshttps://doi.org/10.1145/129712.129756openalex-snapshot
Representing Boolean functions as polynomials modulo composite numbers
inferred← citeshttps://doi.org/10.2168/lmcs-3(1:4)2007openalex-snapshot
Logic Meets Algebra: the Case of Regular Languages
inferred← citeshttps://doi.org/10.46298/lmcs-18(2:12)2022openalex-snapshot
CC-circuits and the expressive power of nilpotent algebras
inferred← citeshttps://doi.org/10.46298/lmcs-18(3:14)2022openalex-snapshot
Tameness and the power of programs over monoids in DA
inferred← citeshttps://doi.org/10.70675/412a4333z5867z452fz9404z271549351d1dopenalex-snapshot
The limits of Nečiporuk's method and the power of programs over monoids taken from small varieties of finite monoids
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.