On the public citation graph

Sur diverses familles de langages ferm�es par transduction rationnelle

0 signed · 55 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/bf01691106openalex-snapshot

Chains of full AFL's

inferredcites →https://doi.org/10.1007/bf01694004openalex-snapshot

A helpful result for proving inherent ambiguity

inferredcites →https://doi.org/10.1016/s0022-0000(70)80016-2openalex-snapshot

Principal AFL

inferredcites →https://doi.org/10.1145/321250.321254openalex-snapshot

A New Normal-Form Theorem for Context-Free Phrase Structure Grammars

inferredcites →https://doi.org/10.1145/800157.805043openalex-snapshot

An iteration theorem for one-counter languages.

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-07407-4_2openalex-snapshot

Le cylindre des langages lineaires n'est pas principal

inferred← citeshttps://doi.org/10.1007/3-540-08138-0_12openalex-snapshot

Un langage algebrique non-generateur

inferred← citeshttps://doi.org/10.1007/3-540-08138-0_14openalex-snapshot

Familles de langages fermees par crochet et crochet ouvert

inferred← citeshttps://doi.org/10.1007/3-540-08353-7_125openalex-snapshot

Classification of the context-free languages

inferred← citeshttps://doi.org/10.1007/3-540-08860-1_3openalex-snapshot

Sur l'inversion des morphismes d'arbres

inferred← citeshttps://doi.org/10.1007/3-540-09526-8_18openalex-snapshot

Relationships between AFDL's and cylinders

inferred← citeshttps://doi.org/10.1007/3-540-10854-8_26openalex-snapshot

Rational cone and substitution

inferred← citeshttps://doi.org/10.1007/978-3-322-92151-2_8openalex-snapshot

Transduktoren und Zweibandautomaten

inferred← citeshttps://doi.org/10.1007/978-3-540-30203-2_26openalex-snapshot

Composition of Path Transductions

inferred← citeshttps://doi.org/10.1007/bf00288963openalex-snapshot

Ind�pendance forte de certaines op�rations

inferred← citeshttps://doi.org/10.1007/bf00289070openalex-snapshot

Op�rations de cylindre et applications s�quentielles gauches inverses

inferred← citeshttps://doi.org/10.1007/bf00289506openalex-snapshot

Familles de langages translatables et ferm�es par crochet

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/bf01768473openalex-snapshot

Le cylindre des langages linéaires

inferred← citeshttps://doi.org/10.1007/bf01768474openalex-snapshot

Non-prinicipalité du cylindre des langages à compteur

inferred← citeshttps://doi.org/10.1007/bf02088295openalex-snapshot

Cardinality problems of compositions of morphisms and inverse morphisms

inferred← citeshttps://doi.org/10.1007/bf02573161openalex-snapshot

Fixed point languages of rational transductions

inferred← citeshttps://doi.org/10.1007/bfb0017296openalex-snapshot

Quelques proprietes des langages a un Compteur

inferred← citeshttps://doi.org/10.1007/bfb0029636openalex-snapshot

Rational ω-transductions

inferred← citeshttps://doi.org/10.1007/bfb0036926openalex-snapshot

On the composition of morphisms and inverse morphisms

inferred← citeshttps://doi.org/10.1016/0012-365x(74)90020-xopenalex-snapshot

Transductions de series formelles

inferred← citeshttps://doi.org/10.1016/0020-0190(74)90050-7openalex-snapshot

The inclusion of the substitution closure of linear and one-counter languages in the largest sub-AFL of the family of algebraic languages is proper

inferred← citeshttps://doi.org/10.1016/0020-0190(88)90135-4openalex-snapshot

Bifaithful starry transductions

inferred← citeshttps://doi.org/10.1016/0022-0000(79)90039-4openalex-snapshot

Cônes rationnels commutatifs

inferred← citeshttps://doi.org/10.1016/0022-0000(83)90018-1openalex-snapshot

Langages á un Compteur

inferred← citeshttps://doi.org/10.1016/0304-3975(76)90033-5openalex-snapshot

Langages algebriques, paires iterantes et transductions rationnelles

inferred← citeshttps://doi.org/10.1016/0304-3975(77)90003-2openalex-snapshot

Produit dans le cône rationnel engendré par D*1

inferred← citeshttps://doi.org/10.1016/0304-3975(79)90038-0openalex-snapshot

Familles de langages fermees par crochet ouvert

inferred← citeshttps://doi.org/10.1016/0304-3975(80)90047-xopenalex-snapshot

Automates a file

inferred← citeshttps://doi.org/10.1016/0304-3975(81)90056-6openalex-snapshot

Substitution of semi-AFL's

inferred← citeshttps://doi.org/10.1016/0304-3975(82)90098-6openalex-snapshot

Morphismes et bimorphismes d'arbres

inferred← citeshttps://doi.org/10.1016/0304-3975(84)90053-7openalex-snapshot

Partial commutations and faithful rational transductions

inferred← citeshttps://doi.org/10.1016/b978-0-12-115350-2.50008-7openalex-snapshot

GENERATORS OF CONES AND CYLINDERS11Preparation of this paper was supported in part by the National Science Foundation under Grant No. MCS79-04012.

inferred← citeshttps://doi.org/10.1016/s0019-9958(75)90140-0openalex-snapshot

Sur un Théorème de Shamir

inferred← citeshttps://doi.org/10.1016/s0019-9958(76)90518-0openalex-snapshot

Structural similarity in context-free languages

inferred← citeshttps://doi.org/10.1016/s0019-9958(79)90641-7openalex-snapshot

Substitutions dans les EDT0L systèmes ultralinéaires

inferred← citeshttps://doi.org/10.1016/s0022-0000(73)80036-4openalex-snapshot

Two iteration theorems for some families of languages

inferred← citeshttps://doi.org/10.1051/ita/197509r100051openalex-snapshot

Une double hiérarchie infinie de langages vérifiables

inferred← citeshttps://doi.org/10.1051/ita/197509r200251openalex-snapshot

Sur l'image, par une transduction rationnelle, des mots sur une lettre

inferred← citeshttps://doi.org/10.1051/ita/1977110100291openalex-snapshot

Cônes rationnels commutativement clos

inferred← citeshttps://doi.org/10.1051/ita/1978120301811openalex-snapshot

Note sur la non-principalité de certaines FAL

inferred← citeshttps://doi.org/10.1051/ita/1979130100691openalex-snapshot

Langages très simples générateurs

inferred← citeshttps://doi.org/10.1051/ita/1979130201891openalex-snapshot

One counter languages and the chevron operation

inferred← citeshttps://doi.org/10.1051/ita/1979130403631openalex-snapshot

Quelques problèmes ouverts en théorie des langages algébriques

inferred← citeshttps://doi.org/10.1051/ita/1981150201411openalex-snapshot

Transductions rationnelles décroissantes

inferred← citeshttps://doi.org/10.1051/ita/1986200100551openalex-snapshot

Single-tape reset machines

inferred← citeshttps://doi.org/10.1109/sfcs.1976.23openalex-snapshot

Parenthesis generators

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.