Skip to search formSkip to main contentSkip to account menu

Pattern language (formal languages)

Known as: Pattern language (disambiguation) 
In theoretical computer science, a pattern language is a formal language that can be defined as the set of all particular instances of a string of… 
Wikipedia (opens in a new tab)

Related topics

Related topics

14 relations
Chomsky hierarchyContext-free languageEmpty stringFormal language

Broader (2)

Machine learningTheoretical computer science

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
Visible - actionable - sustainable: sustainable interaction design in professional domains
The growing body of sustainable HCI shows that new interfaces may increase awareness and motivate action for environmental impact… 
Review
2006
Review
2006
Proceedings of the 15th Conference on Pattern Languages of Programs
Welcome to PLoP '08, the 15th Conference on Pattern Languages of Programs, a premier event for pattern authors and pattern… 
2001
2001
Identification of Framework Hot Spots Using Pattern Languages
One of the major factors that brings complexity to framework development is the identification of its hot spots, i.e., the… 
2000
2000
Frameworks and pattern languages: an intriguing relationship
The goal of this paper is the comparison betw een Application Frameworks and Pattern Languages. Frameworks and pattern languages… 
1998
1998
Learnability of a subclass of extended pattern languages
Angluin introduced the class of pattern languages as term languages over strings on a finite alphabet, and showed that the class… 
1998
1998
Characteristic Sets for Unions of Regular Pattern Languages and Compactness
The paper deals with the class RPk of sets of at most k regular patterns. A semantics of a set P of regular patterns is a union L… 
1994
1994
Finding solutions through pattern languages
Considers how interest in patterns and pattern languages has been on the upswing, fueled by the realization among software… 
1990
1990
Polynomial-Time Inference of Pattern Languages
1984
1984
Polynomial Time Inference of General Pattern Languages
Assume a finite alphabet of constant symbols and a disjoint infinite alphabet of variable symbols. A pattern p is a non-empty… 
Highly Cited
1968
Highly Cited
1968
Languages of Encoded Line Patterns
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)