On the public citation graph
On the composition of morphisms and inverse morphisms
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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-3-663-09367-1openalex-snapshot
Transductions and Context-Free Languages
inferredcites →https://doi.org/10.1007/bf00264030openalex-snapshot
Sur diverses familles de langages ferm�es par transduction rationnelle
inferredcites →https://doi.org/10.1007/bf01699459openalex-snapshot
On the usefulness of bifaithful rational cones
inferredcites →https://doi.org/10.1016/0020-0255(82)90057-3openalex-snapshot
A homomorphic characterization of principal semiAFLs without using intersection with regular sets
inferredcites →https://doi.org/10.1016/0166-218x(82)90072-5openalex-snapshot
A homomorphic characterization of regular languages
inferredcites →https://doi.org/10.1016/0166-218x(83)90045-8openalex-snapshot
A note on morphic characterization of languages
inferredcites →https://doi.org/10.1016/0304-3975(76)90004-9openalex-snapshot
Some uniformly erasable families of languages
inferredcites →https://doi.org/10.1016/0304-3975(81)90020-7openalex-snapshot
A propos du lemme de substitution
inferredcites →https://doi.org/10.1016/s0022-0000(74)80008-5openalex-snapshot
Comparing complexity classes
inferredcites →https://doi.org/10.1016/s0049-237x(08)72023-8openalex-snapshot
The Algebraic Theory of Context-Free Languages
inferredcites →https://doi.org/10.1051/ita/1979130302411openalex-snapshot
On simple representations of language families
inferredcites →https://doi.org/10.1051/ita/1981150201411openalex-snapshot
Transductions rationnelles décroissantes
inferredcites →https://doi.org/10.2307/2218270openalex-snapshot
Computer Programming and Formal Systems.
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-18088-5_12openalex-snapshot
On recent trends in formal language theory
inferred← citeshttps://doi.org/10.1007/3-540-58131-6_43openalex-snapshot
Identities and transductions
inferred← citeshttps://doi.org/10.1007/978-1-4613-3394-4_4openalex-snapshot
Homomorphic Representations of Certain Classes of Languages
inferred← citeshttps://doi.org/10.1007/978-3-031-07469-1_14openalex-snapshot
Homomorphisms on Graph-Walking Automata
inferred← citeshttps://doi.org/10.1007/978-3-540-31834-7_3openalex-snapshot
Finite Sets of Words and Computing
inferred← citeshttps://doi.org/10.1007/978-3-540-45077-1_33openalex-snapshot
Languages Defined by Generalized Equality Sets
inferred← citeshttps://doi.org/10.1007/978-3-642-37075-5_18openalex-snapshot
The Parametric Ordinal-Recursive Complexity of Post Embedding Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-60207-8_4openalex-snapshot
Synchronized Shuffle and Regular Languages
inferred← citeshttps://doi.org/10.1007/978-3-642-95486-3_20openalex-snapshot
L Systems and Nlog — Reductions
inferred← citeshttps://doi.org/10.1007/bf01185560openalex-snapshot
Deterministic sequential functions
inferred← citeshttps://doi.org/10.1007/bf01237236openalex-snapshot
On characterizations of recursively enumerable languages
inferred← citeshttps://doi.org/10.1007/bf01692069openalex-snapshot
A new normal form for the compositions of morphisms and inverse morphisms
inferred← citeshttps://doi.org/10.1007/bf02088295openalex-snapshot
Cardinality problems of compositions of morphisms and inverse morphisms
inferred← citeshttps://doi.org/10.1007/bfb0016231openalex-snapshot
Recent results in the theory of rational sets
inferred← citeshttps://doi.org/10.1007/bfb0030300openalex-snapshot
A truely morphic characterization of recursively enumerable sets
inferred← citeshttps://doi.org/10.1007/bfb0030317openalex-snapshot
On the equivalence of compositions of morphisms and inverse morphisms on regular languages
inferred← citeshttps://doi.org/10.1007/bfb0035841openalex-snapshot
Cyclic rational transductions and polynomials of rational functions
inferred← citeshttps://doi.org/10.1016/0020-0190(84)90055-3openalex-snapshot
Inverse morphic equivalence on languages
inferred← citeshttps://doi.org/10.1016/0020-0190(88)90135-4openalex-snapshot
Bifaithful starry transductions
inferred← citeshttps://doi.org/10.1016/0022-0000(86)90032-2openalex-snapshot
A simple undecidable problem: Existential agreement of inverses of two morphisms on a regular language
inferred← citeshttps://doi.org/10.1016/0166-218x(86)90018-1openalex-snapshot
On morphic generation of regular languages
inferred← citeshttps://doi.org/10.1016/0166-218x(91)90096-fopenalex-snapshot
Decidability problems for unary output sequential transducers
inferred← citeshttps://doi.org/10.1016/0304-3975(86)90025-3openalex-snapshot
Two characterizations of rational adherences
inferred← citeshttps://doi.org/10.1016/0304-3975(87)90038-7openalex-snapshot
On purely morphic characterizations of context-free languages
inferred← citeshttps://doi.org/10.1016/0304-3975(87)90103-4openalex-snapshot
Representations of language families by homomorphic equality operations and generalized equality sets
inferred← citeshttps://doi.org/10.1016/0304-3975(90)90018-dopenalex-snapshot
The three subfamilies of rational ω-languages closed under ω-transduction
inferred← citeshttps://doi.org/10.1016/0304-3975(90)90126-3openalex-snapshot
Cyclic rational transductions and polynomials of rational functions
inferred← citeshttps://doi.org/10.1016/0304-3975(94)90245-3openalex-snapshot
Representation of rational functions with prefix and suffix codings
inferred← citeshttps://doi.org/10.1016/j.ipl.2005.01.014openalex-snapshot
Equality sets of prefix morphisms and regular star languages
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.04.030openalex-snapshot
On fixed points of rational transductions
inferred← citeshttps://doi.org/10.1016/j.tcs.2023.114197openalex-snapshot
Homomorphisms and inverse homomorphisms on graph-walking automata
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00328-4openalex-snapshot
A characterization of recognizable picture languages by tilings by finite sets
inferred← citeshttps://doi.org/10.1051/ita/1985190302031openalex-snapshot
On the equivalence of compositions of morphisms and inverse morphisms on regular languages
inferred← citeshttps://doi.org/10.1051/ita/1991250100031openalex-snapshot
Minimal generators of submonoids of $A^\infty $
inferred← citeshttps://doi.org/10.1051/ita/1992260302431openalex-snapshot
Compositional representation of rational functions
inferred← citeshttps://doi.org/10.1051/ita:2005035openalex-snapshot
Equality sets for recursively enumerable languages
inferred← citeshttps://doi.org/10.1051/ita:2008014openalex-snapshot
An automata-theoretic approach to the study of the intersection of two submonoids of a free monoid
inferred← citeshttps://doi.org/10.1080/00207168408803437openalex-snapshot
On characterisation of language families in terms of inverse morphisms
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.