|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
20th Annual Symposium on Foundations of Computer Science (FOCS 1979)
Bijective A-transducers
October 29-October 31
| ASCII Text | x | ||
| H. A. Maurer, H. Nivat, "Bijective A-transducers," Foundations of Computer Science, IEEE Annual Symposium on, pp. 97-100, 20th Annual Symposium on Foundations of Computer Science (FOCS 1979), 1979. | |||
| BibTex | x | ||
| @article{ 10.1109/SFCS.1979.7, author = {H. A. Maurer and H. Nivat}, title = {Bijective A-transducers}, journal ={Foundations of Computer Science, IEEE Annual Symposium on}, volume = {0}, year = {1979}, issn = {0272-5428}, pages = {97-100}, doi = {http://doi.ieeecomputersociety.org/10.1109/SFCS.1979.7}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - CONF JO - Foundations of Computer Science, IEEE Annual Symposium on TI - Bijective A-transducers SN - 0272-5428 SP97 EP100 A1 - H. A. Maurer, A1 - H. Nivat, PY - 1979 VL - 0 JA - Foundations of Computer Science, IEEE Annual Symposium on ER - | |||
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/SFCS.1979.7
In this paper we study bijective a-transducers. We derive necessary and sufficient conditions on pairs of regular sets (R,S) such that a bijective a-transducer, mapping R cnto S exists. The results obtained allow the systematic construction of an a-transducer, mapping a set R onto a set S bijectively for surprisingly "different" regular sets R and S.
Citation:
H. A. Maurer, H. Nivat, "Bijective A-transducers," focs, pp.97-100, 20th Annual Symposium on Foundations of Computer Science (FOCS 1979), 1979
Usage of this product signifies your acceptance of the Terms of Use.