On the public citation graph

The family of one-counter languages is closed under quotient

https://doi.org/10.1007/bf00267045
0 signed · 32 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-4615-2217-1_1openalex-snapshot
Introduction to Formal Language Theory
inferredcites →https://doi.org/10.1007/978-3-663-09367-1openalex-snapshot
Transductions and Context-Free Languages
inferredcites →https://doi.org/10.1007/bf01768474openalex-snapshot
Non-prinicipalité du cylindre des langages à compteur
inferredcites →https://doi.org/10.1016/0022-0000(83)90018-1openalex-snapshot
Langages á un Compteur
inferredcites →https://doi.org/10.1016/0022-0000(84)90013-8openalex-snapshot
Commutative One-counter languages are regular
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(78)90020-8openalex-snapshot
Remarks on blind and partially blind one-way multicounter machines
inferredcites →https://doi.org/10.1016/0304-3975(81)90054-2openalex-snapshot
The power of synchronizing operations on strings
inferredcites →https://doi.org/10.1016/0304-3975(82)90036-6openalex-snapshot
Monadic Thue systems
inferredcites →https://doi.org/10.1016/0378-4754(80)90010-5openalex-snapshot
Fundamentals of computation theory
inferredcites →https://doi.org/10.1016/1385-7258(78)90031-8openalex-snapshot
On characterization of recursively enumerable languages in terms of linear languages and VW-grammars
inferredcites →https://doi.org/10.1016/s0019-9958(67)91032-7openalex-snapshot
Inclusion relations among families of context-free languages
inferredcites →https://doi.org/10.1016/s0022-0000(73)80036-4openalex-snapshot
Two iteration theorems for some families of languages
inferredcites →https://doi.org/10.1016/s0022-0000(74)80027-9openalex-snapshot
Reversal-bounded multipushdown machines
inferredcites →https://doi.org/10.1016/s0022-0000(75)80042-0openalex-snapshot
One counter languages and the IRS condition
inferredcites →https://doi.org/10.1051/ita/197509r200051openalex-snapshot
A note on the recognition of one counter languages
inferredcites →https://doi.org/10.1051/ita/1979130100191openalex-snapshot
On the hierarchy of Petri net languages
inferredcites →https://doi.org/10.1051/ita/1979130201891openalex-snapshot
One counter languages and the chevron operation
inferredcites →https://doi.org/10.5802/aif.287openalex-snapshot
Transductions des langages de Chomsky

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-45711-9_20openalex-snapshot
Upper Bounds for Restricted Splicing
inferred← citeshttps://doi.org/10.1007/978-3-319-25150-9_15openalex-snapshot
Quotients of Unbounded Parallelism
inferred← citeshttps://doi.org/10.1007/978-3-319-60252-3_24openalex-snapshot
The Quotient Operation on Input-Driven Pushdown Automata
inferred← citeshttps://doi.org/10.1007/978-3-662-07675-0_7openalex-snapshot
Language Theory and Molecular Genetics: Generative Mechanisms Suggested by DNA Recombination
inferred← citeshttps://doi.org/10.1007/bf01237236openalex-snapshot
On characterizations of recursively enumerable languages
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90339-uopenalex-snapshot
Weighted systems of equations
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00082-5openalex-snapshot
Computing by splicing
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00035-2openalex-snapshot
On representing recursively enumerable languages by internal contextual languages
inferred← citeshttps://doi.org/10.1080/00207168708803594openalex-snapshot
Quotient and bounded context-free languages
inferred← citeshttps://doi.org/10.1080/00207169608804472openalex-snapshot
Restricted use of the splicing operation1
inferred← citeshttps://doi.org/10.1080/00207169808804634openalex-snapshot
Characterizations of re languages starting from internal contextual languages∗
inferred← citeshttps://doi.org/10.1142/s0129054119400367openalex-snapshot
State Complexity of the Quotient Operation on Input-Driven Pushdown Automata
inferred← citeshttps://doi.org/10.3233/fun-2002-51405openalex-snapshot
One-Turn Regulated Pushdown Automata and Their Reduction
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.