On the public citation graph
The Descriptive Complexity Approach to LOGCFL
0 signed · 60 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.1002/malq.19980440306openalex-snapshot
Elementary Properties of the Finite Ranks
inferredcites →https://doi.org/10.1007/978-1-4612-0289-9openalex-snapshot
Finite Automata, Formal Logic, and Circuit Complexity
inferredcites →https://doi.org/10.1007/bf01212963openalex-snapshot
NC1: The automata-theoretic viewpoint
inferredcites →https://doi.org/10.1007/bf01744431openalex-snapshot
Parity, circuits, and the polynomial-time hierarchy
inferredcites →https://doi.org/10.1007/bf01762237openalex-snapshot
An infinite hierarchy of intersections of context-free languages
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-0000(91)90020-6openalex-snapshot
Properties that characterize LOGCFL
inferredcites →https://doi.org/10.1016/0022-0000(92)90014-aopenalex-snapshot
Regular languages in NC1
inferredcites →https://doi.org/10.1016/0168-0072(83)90038-6openalex-snapshot
∑11-Formulae on finite structures
inferredcites →https://doi.org/10.1016/0304-3975(93)90253-popenalex-snapshot
Extensions to Barrington's M-program model
inferredcites →https://doi.org/10.1016/s0019-9958(63)90306-1openalex-snapshot
On context-free languages and push-down automata
inferredcites →https://doi.org/10.1016/s0019-9958(65)90108-7openalex-snapshot
On finite monoids having only trivial subgroups
inferredcites →https://doi.org/10.1111/j.1755-2567.1966.tb00600.xopenalex-snapshot
First Order Predicate Logic with Generalized Quantifiers
inferredcites →https://doi.org/10.1137/0218043openalex-snapshot
Expressibility and Parallel Complexity
inferredcites →https://doi.org/10.1142/s0129054198000180openalex-snapshot
LINDSTRÖM QUANTIFIERS AND LEAF LANGUAGE DEFINABILITY
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/321623.321625openalex-snapshot
Characterizations of Pushdown Machines in Terms of Time-Bounded Computers
inferredcites →https://doi.org/10.1145/322077.322083openalex-snapshot
On the Tape Complexity of Deterministic Context-Free Languages
inferredcites →https://doi.org/10.1145/48014.63138openalex-snapshot
Finite monoids and the fine structure of NC 1
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-44802-0_25openalex-snapshot
A Generalization of the Büchi-Elgot-Trakhtenbrot Theorem
inferred← citeshttps://doi.org/10.1007/3-540-45022-x_75openalex-snapshot
The Many Faces of a Translation
inferred← citeshttps://doi.org/10.1007/3-540-48523-6_33openalex-snapshot
Computing LOGCFL Certificates
inferred← citeshttps://doi.org/10.1007/3-540-48686-0_19openalex-snapshot
Circuits and Context-Free Languages
inferred← citeshttps://doi.org/10.1007/978-3-319-62809-7_19openalex-snapshot
Two-Variable First Order Logic with Counting Quantifiers: Complexity Results
inferred← citeshttps://doi.org/10.1007/978-3-540-31856-9_41openalex-snapshot
Characterizing TC0 in Terms of Infinite Groups
inferred← citeshttps://doi.org/10.1007/978-3-540-69937-8_21openalex-snapshot
On Second-Order Monadic Groupoidal Quantifiers
inferred← citeshttps://doi.org/10.1007/978-3-540-74456-6_15openalex-snapshot
Linear Circuits, Two-Variable Logic and Weakly Blocked Monoids
inferred← citeshttps://doi.org/10.1007/978-3-540-87531-4_7openalex-snapshot
Extensional Uniformity for Boolean Circuits
inferred← citeshttps://doi.org/10.1007/978-3-642-00982-2_11openalex-snapshot
Non-solvable Groups Are Not in FO+MOD+MÂJ2[REG]
inferred← citeshttps://doi.org/10.1007/978-3-642-32589-2_52openalex-snapshot
The Lower Reaches of Circuit Uniformity
inferred← citeshttps://doi.org/10.1007/978-3-662-45824-2_3openalex-snapshot
Logic-Automata Connections for Transformations
inferred← citeshttps://doi.org/10.1007/978-3-662-48057-1_11openalex-snapshot
A Circuit Complexity Approach to Transductions
inferred← citeshttps://doi.org/10.1007/978-3-662-53132-7_6openalex-snapshot
A Language-Theoretical Approach to Descriptive Complexity
inferred← citeshttps://doi.org/10.1007/s00153-007-0052-4openalex-snapshot
Generalized quantifier and a bounded arithmetic theory for LOGCFL
inferred← citeshttps://doi.org/10.1007/s00224-006-1310-2openalex-snapshot
Characterizing TC0 in Terms of Infinite Groups
inferred← citeshttps://doi.org/10.1007/s00224-015-9630-8openalex-snapshot
The Arithmetic Complexity of Tensor Contraction
inferred← citeshttps://doi.org/10.1007/s00236-012-0157-zopenalex-snapshot
First-order logics: some characterizations and closure properties
inferred← citeshttps://doi.org/10.1016/j.jcss.2004.07.004openalex-snapshot
First-order expressibility of languages with neutral letters or: The Crane Beach conjecture
inferred← citeshttps://doi.org/10.1016/j.jcss.2005.08.003openalex-snapshot
The many faces of a translation
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00108-6openalex-snapshot
Computing LOGCFL certificates
inferred← citeshttps://doi.org/10.1051/ita:2003017openalex-snapshot
Regular languages definable by Lindström quantifiers
inferred← citeshttps://doi.org/10.1109/ccc.2004.1313817openalex-snapshot
Some results on majority quantifiers over words
inferred← citeshttps://doi.org/10.1109/lics.2012.55openalex-snapshot
Non-definability of Languages by Generalized First-order Formulas over (N,+)
inferred← citeshttps://doi.org/10.1137/080741811openalex-snapshot
Extensional Uniformity for Boolean Circuits
inferred← citeshttps://doi.org/10.1145/1071596.1071602openalex-snapshot
Arithmetic, first-order logic, and counting quantifiers
inferred← citeshttps://doi.org/10.1145/309739.309741openalex-snapshot
Uniform characterizations of complexity classes
inferred← citeshttps://doi.org/10.1145/3209108.3209179openalex-snapshot
Model-Theoretic Characterization of Boolean and Arithmetic Circuit Classes of Small Depth
inferred← citeshttps://doi.org/10.1145/371316.371512openalex-snapshot
MSO definable string transductions and two-way finite-state transducers
inferred← citeshttps://doi.org/10.1145/3750044openalex-snapshot
Regular Representations of Uniform TC 0
inferred← citeshttps://doi.org/10.1515/9783110451931-005openalex-snapshot
The computational nature of phonological generalizations
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.2168/lmcs-6(3:25)2010openalex-snapshot
On Second-Order Monadic Monoidal and Groupoidal Quantifiers
inferred← citeshttps://doi.org/10.4230/lipics.icalp.2020.135openalex-snapshot
Comparison-Free Polyregular Functions
inferred← citeshttps://doi.org/10.48550/arxiv.0805.4072openalex-snapshot
Extensional Uniformity for Boolean Circuits
inferred← citeshttps://doi.org/10.70675/6466009fz6cb0z4f56z95a2zb45685141114openalex-snapshot
Langages ε-sûrs et caractérisations des langages d'ordres supérieurs
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.