Languages with membership determined by single letter factors

DOI10.1016/J.TCS.2017.04.005MaRDI QIDQ529064zbMATH OpenOpenAlexFDO

Authors Peter M. Higgins, Suhear Alwan

Publication date 18 May 2017

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2017.04.005

zbMATH Keywords

automataregular languagessyntactic monoidword scanning

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Languages that require full scanning of words to determine membership
• Languages and scanners
• Conditional densities of regular languages
• Algorithmic ways of deciding whether an infinite language is a code
• Languages obtained from infinite words

Cites work

• scientific article; zbMATH DE number 1577991 (Why is no real title available?)
• scientific article; zbMATH DE number 3654376 (Why is no real title available?)
• scientific article; zbMATH DE number 53545 (Why is no real title available?)
• scientific article; zbMATH DE number 1024080 (Why is no real title available?)
• scientific article; zbMATH DE number 3419419 (Why is no real title available?)
• Languages that require full scanning of words to determine membership

Cited in

(2)

• Languages that require full scanning of words to determine membership
• Some language families generated by one-letter languages

This page was built for publication: Languages with membership determined by single letter factors

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