The base of the intersection of two free submonoids

DOI10.1016/0166-218X(85)90036-8zbMath0583.20046OpenAlexW1980310062MaRDI QIDQ1070043

Ronald V. Book

Publication date: 1985

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(85)90036-8

zbMATH Keywords

polynomial-time algorithmcircular codebase of the intersectionfree submonoids

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35) Graph theory (05C99)

Related Items (1)

Codes modulo finite monadic string-rewriting systems

Cites Work

• Unnamed Item
• Unnamed Item
• On Information Lossless Automata of Finite Order
• Ambiguity in Graphs and Expressions
• On the Intersection of Finitely Generated Free Groups

This page was built for publication: The base of the intersection of two free submonoids