On the public citation graph

Probabilistic tree automata and context free languages

https://doi.org/10.1007/bf02798680
0 signed · 17 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/bf01691346openalex-snapshot
Generalized finite automata theory with an application to a decision problem of second-order logic
inferredcites →https://doi.org/10.1016/s0019-9958(63)90290-0openalex-snapshot
Probabilistic automata
inferredcites →https://doi.org/10.1016/s0022-0000(67)80022-9openalex-snapshot
Characterizing derivation trees of context-free grammars through a generalization of finite automata theory
inferredcites →https://doi.org/10.1090/psapm/019/0239886openalex-snapshot
Mathematical theory of automata
inferredcites →https://doi.org/10.1147/rd.32.0114openalex-snapshot
Finite Automata and Their Decision Problems

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11812128_11openalex-snapshot
Tiburon: A Weighted Tree Automata Toolkit
inferred← citeshttps://doi.org/10.1007/3-540-07162-8_684openalex-snapshot
Stretching by probabilistic tree automata and Santos grammars
inferred← citeshttps://doi.org/10.1007/3-540-08442-8_111openalex-snapshot
The Equivalences Problems for Binary EOL-Systems are Decidable
inferred← citeshttps://doi.org/10.1007/978-3-642-01492-5_9openalex-snapshot
Weighted Tree Automata and Tree Transducers
inferred← citeshttps://doi.org/10.1007/bf00995736openalex-snapshot
Stochastic grammars and languages
inferred← citeshttps://doi.org/10.1007/bf01085017openalex-snapshot
Theory of formal grammars
inferred← citeshttps://doi.org/10.1007/bf01088986openalex-snapshot
Probabilistic automata
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00009-7openalex-snapshot
Stochastically costed tree automata: Turakainen's theorem
inferred← citeshttps://doi.org/10.1080/00207169408804300openalex-snapshot
Stochastic tree functions
inferred← citeshttps://doi.org/10.1080/01969727908927605openalex-snapshot
PROBABILISTIC MACHINES AND LANGUAGES
inferred← citeshttps://doi.org/10.3115/1697236.1697238openalex-snapshot
Parsing algorithms based on tree automata
inferred← citeshttps://doi.org/10.48550/arxiv.1510.02036openalex-snapshot
Tree Automata and Tree Grammars
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.