Languages with membership determined by single letter factors

DOI10.1016/J.TCS.2017.04.005zbMATH Open1370.68174OpenAlexW2609847050MaRDI QIDQ529064FDOQ529064

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

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

zbMATH Keywords

automataregular languagessyntactic monoidword scanning

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Languages that require full scanning of words to determine membership
• Title not available (Why is that?)

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)