Intersection with Regular Languages is a closure property of context-free languages that specifies the result of intersecting a context-free language with a regular language, yielding a language that remains context-free.
11
Publications
225
Citations
17
Authors
11
Institutions
Publications per year
2017–2026
2
Parents
Publications
11
Graph Logics with Rational Relations
Pablo Barceló, Diego Figueira, Leonid Libkin · Logical Methods in Computer Science · 2013 · 37 citations · Full text
On the state complexity of intersection of regular languages
Sheng Yü, Qingyu Zhuang · ACM SIGACT News · 1991 · 30 citations · Full text
1–5 of 11
Authors
17
- PB
3
h-index
- DF
2
h-index
- LL
2
h-index
- IP
1
h-index
- QZ
1
h-index
1–5 of 17
Institutions
11
University of Chile
Santiago, Chile
3 h-index
4 publications
89 citations
University of Edinburgh
Edinburgh, United Kingdom
2 h-index
3 publications
97 citations
University of Helsinki
Helsinki, Finland
1 h-index
1 publications
13 citations
Indiana University South Bend
South Bend, United States
1 h-index
1 publications
18 citations
University of Michigan
Ann Arbor, United States
1 h-index
3 publications
48 citations
University of Oulu
Oulu, Finland
1 h-index
1 publications
17 citations
University of Prince Edward Island
Charlottetown, Canada
1 h-index
1 publications
18 citations
University of Liverpool
Liverpool, United Kingdom
1 h-index
2 publications
30 citations
1–8 of 11
Venues
- Theoretical Computer Science
1 publications · 18 citations
1
h-index
- International Journal of Foundations of Computer Science
IJFCS · 1 publications · 13 citations
1
h-index
- Logical Methods in Computer Science
LMCS · 1 publications · 37 citations
1
h-index
- ACM SIGACT News
1 publications · 30 citations
1
h-index
- International Journal of Computer Mathematics
1 publications · 17 citations
1
h-index
1–5