Regular and Context-Free Pattern Languages over Small Alphabets

DOI10.1007/978-3-642-31653-1_13MaRDI QIDQ3167490zbMATH OpenOpenAlexFDO

Authors Daniel Reidenbach, Markus L. Schmid

Publication date 2 November 2012

Published in Developments in Language Theory (Search for Journal in Brave)

Full work available at URL https://dspace.lboro.ac.uk/2134/10117

zbMATH Keywords

context-free languagesregular languagespattern languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Regular and context-free pattern languages over small alphabets
• Regular patterns, regular languages and context-free languages
• Regular languages as local functions with small alphabets
• Small conjunctive varieties of regular languages
• Developments in Language Theory
• scientific article; zbMATH DE number 1834677
• Classes of regular and context-free languages over countably infinite alphabets
• On regularity of context-free languages
• scientific article; zbMATH DE number 6136496
• Detecting patterns in finite regular and context-free languages

Cited in

(5)

• Regular and context-free pattern languages over small alphabets
• Excessively duplicating patterns represent non-regular languages
• Regular patterns, regular languages and context-free languages
• On the generative power of regular pattern grammars
• On regularity of languages generated by copying systems

This page was built for publication: Regular and Context-Free Pattern Languages over Small Alphabets

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