On the public citation graph

Sur les g�n�rateurs alg�briques et lin�aires

https://doi.org/10.1007/bf00288769
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/3-540-09118-1openalex-snapshot
Theoretical Computer Science 4th GI Conference
inferredcites →https://doi.org/10.1007/978-3-662-43948-7openalex-snapshot
Automata, Languages, and Programming
inferredcites →https://doi.org/10.1007/978-3-663-09367-1openalex-snapshot
Transductions and Context-Free Languages
inferredcites →https://doi.org/10.1007/bf01683280openalex-snapshot
Top-down tree transducers with regular look-ahead
inferredcites →https://doi.org/10.1016/0020-0190(76)90086-7openalex-snapshot
Copying theorems
inferredcites →https://doi.org/10.1016/0022-0000(80)90010-0openalex-snapshot
Adherences of languages
inferredcites →https://doi.org/10.1016/0304-3975(76)90076-1openalex-snapshot
A relationship between ET0L and EDT0L languages
inferredcites →https://doi.org/10.1016/0304-3975(78)90035-xopenalex-snapshot
One way finite visit automata
inferredcites →https://doi.org/10.1016/0304-3975(79)90049-5openalex-snapshot
A new proof of two theorems about rational transductions
inferredcites →https://doi.org/10.1016/s0019-9958(79)90641-7openalex-snapshot
Substitutions dans les EDT0L systèmes ultralinéaires
inferredcites →https://doi.org/10.1016/s0022-0000(75)80038-9openalex-snapshot
Uniformly erasable AFL
inferredcites →https://doi.org/10.1051/ita/1977110100291openalex-snapshot
Cônes rationnels commutativement clos
inferredcites →https://doi.org/10.1051/ita/1977110402731openalex-snapshot
On some context free languages that are not deterministic ETOL languages
inferredcites →https://doi.org/10.1051/ita/1978120302591openalex-snapshot
Sur les ensembles de mots infinis engendrés par une grammaire algébrique
inferredcites →https://doi.org/10.1145/800133.804333openalex-snapshot
Tree transducers, L systems and two-way machines (Extended Abstract)
inferredcites →https://doi.org/10.1147/rd.91.0047openalex-snapshot
On Relations Defined by Generalized Finite Automata
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-10854-8_26openalex-snapshot
Rational cone and substitution
inferred← citeshttps://doi.org/10.1007/bf00625281openalex-snapshot
Langages satur�s et c�nes d�croissants langages et c�nes bifid�les
inferred← citeshttps://doi.org/10.1007/bf01699459openalex-snapshot
On the usefulness of bifaithful rational cones
inferred← citeshttps://doi.org/10.1007/bfb0017296openalex-snapshot
Quelques proprietes des langages a un Compteur
inferred← citeshttps://doi.org/10.1007/bfb0028821openalex-snapshot
About two-way transducers
inferred← citeshttps://doi.org/10.1007/bfb0036475openalex-snapshot
Une extension aux mots infinis de la notion de transduction rationnelle
inferred← citeshttps://doi.org/10.1016/0022-0000(83)90018-1openalex-snapshot
Langages á un Compteur
inferred← citeshttps://doi.org/10.1016/0304-3975(87)90051-xopenalex-snapshot
Une note sur le théorème de caractérisation des générateurs algébriques
inferred← citeshttps://doi.org/10.1016/0890-5401(87)90012-5openalex-snapshot
The Dyck language D'1∗ is not generated by any matrix grammar of finite index
inferred← citeshttps://doi.org/10.1051/ita/1986200302211openalex-snapshot
Outils et résultats pour les transducteurs boustrophédons
inferred← citeshttps://doi.org/10.1142/s0218196718500145openalex-snapshot
Applications of L systems to group theory
inferred← citeshttps://doi.org/10.1142/s0218196726500165openalex-snapshot
On groups with EDT0L word problem
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.