Cardinality problems of compositions of morphisms and inverse morphisms

DOI10.1007/BF02088295zbMath0685.68065OpenAlexW2091507967MaRDI QIDQ4203829

H. C. M. Kleijn, Tero J.Harju

Publication date: 1989

Published in: Mathematical Systems Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02088295

zbMATH Keywords

cardinality functioncompositions of morphisms

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Word problems, etc. in computability and recursion theory (03D40) Word problems (aspects of algebraic structures) (08A50)

Related Items (1)

The undecidability of some equivalence problems concerning ngsm's and finite substitutions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sur les rélations rationnelles entre monoides libres
• Single-valued a-transducers
• Sur diverses familles de langages fermées par transduction rationnelle
• The unsolvability of the Equivalence Problem for Λ-Free nondeterministic generalized machines

This page was built for publication: Cardinality problems of compositions of morphisms and inverse morphisms