Regular Transductions is a formal model of computation that belongs to the class of finite-state transducers, distinguished by its ability to map input strings from a regular language to output strings over another alphabet using deterministic or nondeterministic transitions with single-symbol output actions, thereby preserving regularity in both domain and range.
6
Publications
1.6K
Citations
8
Authors
6
Institutions
Publications per year
2017–2026
1
Variants
Regular Transduction
Parents
Publications
6
Transductions and Context-Free Languages
Jean Berstel · 1979 · 1.3K citations
Mans Hulden · 2009 · 222 citations · Full text
1–5 of 6
Authors
8
- RA
2
h-index
- MH
1
h-index
- KM
1
h-index
- JR
1
h-index
- JB
1
h-index
1–5 of 8
Institutions
6
California University of Pennsylvania
California, United States
2 h-index
4 publications
206 citations
Tel Aviv University
Tel Aviv, Israel
1 h-index
1 publications
10 citations
University of Pennsylvania
Philadelphia, United States
1 h-index
2 publications
166 citations
University of Arizona
Tucson, United States
1 h-index
1 publications
222 citations
Rice University
Houston, United States
1 h-index
1 publications
20 citations
Laboratoire d'Informatique Gaspard-Monge
Champs-sur-Marne, France
1 h-index
1 publications
1.3K citations
1–6 of 6
Venues
- Proceedings of the ACM on Programming Languages
PACMPL · 1 publications · 20 citations
1
h-index
- HAL (Le Centre pour la Communication Scientifique Directe)
Repository · 1 publications · 14 citations
1
h-index
- Acta Informatica
1 publications · 10 citations
1
h-index
- DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
Repository · 1 publications · 83 citations
1
h-index
1–4