scientific article; zbMATH DE number 1560303

zbMATH Open0981.68105MaRDI QIDQ4527151

Pál Dömösi, M. Ito

Publication date: 1 February 2001

Title of this publication is not available (Why is that?)

zbMATH Keywords

context-free languagesubwords

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Semigroups in automata theory, linguistics, etc. (20M35)

Related Items (2)

Characterization of a word by its subwords ⋮ Counting Finite Languages by Total Word Length

Recommendations

• Languages under substitutions and balanced words 👍 👎
• On the subword density of languages 👍 👎
• Length considerations in context-free languages 👍 👎
• On lengths of words in context-free languages 👍 👎
• Counting subwords and regular languages 👍 👎
• Counting Finite Languages by Total Word Length 👍 👎
• On the character of words of sublinear complexity 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication:

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