Automata that recognize intersections of free submonoids

DOI10.1016/S0019-9958(77)90050-XMaRDI QIDQ4154498zbMATH OpenFDO

Authors Meera Blattner

Publication date 1977

Published in Information and Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0019-9958(77)90050-X

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35)

Cited in

(9)

• On the degree of ambiguity of finite automata
• scientific article; zbMATH DE number 7559164 (Why is no real title available?)
• Finite sequentiality of finitely ambiguous max-plus tree automata
• Finite sequentiality of finitely ambiguous max-plus tree automata
• The post correspondence problem and equalisers for certain free group and monoid morphisms
• Finite sequentiality of unambiguous max-plus tree automata
• Universal algebras
• A note on intersections of free submonoids of a free monoid
• The poset of retracts of a free monoid

This page was built for publication: Automata that recognize intersections of free submonoids

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4154498)