On the public citation graph

Rational transductions and complexity of counting problems

https://doi.org/10.1007/bf01185866
0 signed · 29 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-1-4612-6264-0openalex-snapshot
Automata-Theoretic Aspects of Formal Power Series
inferredcites →https://doi.org/10.1007/978-3-642-73235-5openalex-snapshot
Rational Series and Their Languages
inferredcites →https://doi.org/10.1007/978-3-663-09367-1openalex-snapshot
Transductions and Context-Free Languages
inferredcites →https://doi.org/10.1007/bf02090763openalex-snapshot
The complexity of ranking simple languages
inferredcites →https://doi.org/10.1016/0096-0551(80)90068-5openalex-snapshot
Introduction to formal language theory
inferredcites →https://doi.org/10.1016/0304-3975(87)90011-9openalex-snapshot
Analytic models and ambiguity of context-free languages
inferredcites →https://doi.org/10.1016/0304-3975(91)90023-uopenalex-snapshot
The complexity of computing the number of strings of given length in context-free languages
inferredcites →https://doi.org/10.1016/0304-3975(91)90144-qopenalex-snapshot
Ranking and formal power series
inferredcites →https://doi.org/10.1016/0304-3975(93)90252-oopenalex-snapshot
A very hard log-space counting class
inferredcites →https://doi.org/10.1016/0890-5401(91)90060-fopenalex-snapshot
Effective entropies and data compression
inferredcites →https://doi.org/10.1016/s0019-9958(85)80041-3openalex-snapshot
A taxonomy of problems with fast parallel algorithms
inferredcites →https://doi.org/10.1016/s0022-0000(72)80003-5openalex-snapshot
A homomorphism theorem for weighted context-free grammars
inferredcites →https://doi.org/10.1109/psct.1987.10319259openalex-snapshot
On Ranking
inferredcites →https://doi.org/10.1109/sct.1991.160269openalex-snapshot
Counting auxiliary pushdown automata and semi-unbounded arithmetic circuits
inferredcites →https://doi.org/10.1137/0208032openalex-snapshot
The Complexity of Enumeration and Reliability Problems
inferredcites →https://doi.org/10.1137/0220034openalex-snapshot
Compression and Ranking
inferredcites →https://doi.org/10.1145/321356.321366openalex-snapshot
The Independence of Inherent Ambiguity From Complementedness Among Context-Free Languages
inferredcites →https://doi.org/10.1145/357980.358005openalex-snapshot
An efficient context-free parsing algorithm
inferredcites →https://doi.org/10.5860/choice.26-3305openalex-snapshot
An introduction to formal language theory

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/9781119008200.biblioopenalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1002/9781119042853.biblioopenalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1007/3-540-46541-3_47openalex-snapshot
Random Generation and Approximate Counting of Ambiguously Described Combinatorial Structures
inferred← citeshttps://doi.org/10.1007/978-3-030-57666-0_5openalex-snapshot
From Combinatorial Games to Shape-Symmetric Morphisms
inferred← citeshttps://doi.org/10.1007/978-3-319-09698-8_8openalex-snapshot
Graph Spectral Properties of Deterministic Finite Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-21254-3_4openalex-snapshot
Abstract Numeration Systems
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00184-0openalex-snapshot
Numeration systems on a regular language: arithmetic operations, recognizability and formal power series
inferred← citeshttps://doi.org/10.48550/arxiv.1108.5711openalex-snapshot
On the enumerating series of an abstract numeration system
inferred← citeshttps://doi.org/10.48550/arxiv.1308.0267openalex-snapshot
Text Compression using Abstract Numeration System on a Regular Language
inferred← citeshttps://doi.org/10.48550/arxiv.1405.2553openalex-snapshot
Graph Spectral Properties of Deterministic 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.