Gotowa bibliografia na temat „Two-way transducers”
Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych
Spis treści
Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „Two-way transducers”.
Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.
Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.
Artykuły w czasopismach na temat "Two-way transducers"
Wang, Yulei, Jingya Tao, Feifei Guo, Shiyang Li, Xingyi Huang, Jie Dong i Wenwu Cao. "Magnesium Alloy Matching Layer for High-Performance Transducer Applications". Sensors 18, nr 12 (14.12.2018): 4424. http://dx.doi.org/10.3390/s18124424.
Pełny tekst źródłaBaudru, Nicolas, i Pierre-Alain Reynier. "From Two-Way Transducers to Regular Function Expressions". International Journal of Foundations of Computer Science 31, nr 06 (wrzesień 2020): 843–73. http://dx.doi.org/10.1142/s0129054120410087.
Pełny tekst źródłaSklyar, Rostyslav. "A CNTFET-Based Nanowired Induction Two-Way Transducers". ISRN Nanotechnology 2012 (14.05.2012): 1–9. http://dx.doi.org/10.5402/2012/102783.
Pełny tekst źródłaGurari, Eitan M. "Two-way counter machines and finite-state transducers†". International Journal of Computer Mathematics 17, nr 3-4 (styczeń 1985): 229–35. http://dx.doi.org/10.1080/00207168508803465.
Pełny tekst źródłaChoffrut, Christian. "Sequences of words defined by two-way transducers". Theoretical Computer Science 658 (styczeń 2017): 85–96. http://dx.doi.org/10.1016/j.tcs.2016.05.004.
Pełny tekst źródłaEngelfriet, Joost, i Hendrik Jan Hoogeboom. "MSO definable string transductions and two-way finite-state transducers". ACM Transactions on Computational Logic 2, nr 2 (kwiecień 2001): 216–54. http://dx.doi.org/10.1145/371316.371512.
Pełny tekst źródłaEngelfriet, Joost. "Two-way pebble transducers for partial functions and their composition". Acta Informatica 52, nr 7-8 (4.03.2015): 559–71. http://dx.doi.org/10.1007/s00236-015-0224-3.
Pełny tekst źródłaIbarra, Oscar H., i Hsu-Chun Yen. "On the containment and equivalence problems for two-way transducers". Theoretical Computer Science 429 (kwiecień 2012): 155–63. http://dx.doi.org/10.1016/j.tcs.2011.12.034.
Pełny tekst źródłaVágvölgyi, Sándor. "Top-down tree transducers with two-way tree walking look-ahead". Theoretical Computer Science 93, nr 1 (luty 1992): 43–74. http://dx.doi.org/10.1016/0304-3975(92)90211-w.
Pełny tekst źródłaYang, Zhi Nian, Yuan Zhang i Yang Lei. "Fire Test on Two-Way Slab with Two Edges Clamped and Two Edges Simply Supported". Applied Mechanics and Materials 744-746 (marzec 2015): 148–51. http://dx.doi.org/10.4028/www.scientific.net/amm.744-746.148.
Pełny tekst źródłaRozprawy doktorskie na temat "Two-way transducers"
Guillon, B. "Two-wayness: Automata and Transducers". Doctoral thesis, Università degli Studi di Milano, 2016. http://hdl.handle.net/2434/385609.
Pełny tekst źródłaGuillon, Bruno. "Two-wayness : automata and transducers". Sorbonne Paris Cité, 2016. http://www.theses.fr/2016USPCC339.
Pełny tekst źródłaThis PhD is about two natural extensions of Finite Automata (FA): the 2-way fa (2FA) and the 2-way transducers (2T). It is well known that 2FA s are computably equivalent to FAs, even in their nondeterministic (2nfa) variant. However, in the field of descriptional complexity, some questions remain. Raised by Sakoda and Sipser in 1978, the question of the cost of the simulation of 2NFA by 2DFA (the deterministic variant of 2FA) is still open. In this manuscript, we give an answer in a restricted case in which the nondeterministic choices of the simulated 2NFA may occur at the boundaries of the input tape only (2ONFA). We show that every 2ONFA can be simulated by a 2DFA of subexponential (but superpolynomial) size. Under the assumptions L=NL, this cost is reduced to the polynomial level. Moreover, we prove that the complementation and the simulation by a halting 2ONFA is polynomial. We also consider the anologous simulations for alternating devices. Providing a one-way write-only output tape to FAs leads to the notion of transducer. Contrary to the case of finite automata which are acceptor, 2-way transducers strictly extends the computational power of 1-way one, even in the case where both the input and output alphabets are unary. Though 1-way transducers enjoy nice properties and characterizations (algebraic, logical, etc. . . ), 2-way variants are less known, especially the nondeterministic case. In this area, this manuscript gives a new contribution: an algebraic characterization of the relations accepted by two-way transducers when both the input and output alphabets are unary. Actually, it can be reformulated as follows: each unary two-way transducer is equivalent to a sweeping (and even rotating) transducer. We also show that the assumptions made on the size of the alphabets are required, that is, sweeping transducers weakens the 2-way transducers whenever at least one of the alphabet is non-unary. On the path, we discuss on the computational power of some algebraic operations on word relations, introduced in the aim of describing the behavior of 2-way transducers or, more generally, of 2-way weighted automata. In particular, the mirror operation, consisting in reversing the input word in order to describe a right to left scan, draws our attention. Finally, we study another kind of operations, more adapted for binary word relations: the composition. We consider the transitive closure of relations. When the relation belongs to some very restricted sub-family of rational relations, we are able to compute its transitive closure and we set its complexity. This quickly becomes uncomputable when higher classes are considered
Baschenis, Félix. "Minimizing resources for regular word transductions". Thesis, Bordeaux, 2017. http://www.theses.fr/2017BORD0810/document.
Pełny tekst źródłaThe goal of this thesis was to study definability questionsabout finite-state transducers and in particular two-waytransducers. It is known that two-way transducers cover a larger classof transductions than one-way transducers. Then the first question wetackled is the one-way definability problem: is it possible torealize a given two-way transduction by a one-way transducer? Thisproblem was shown to be decidable for functionaltransducers (we also show as a side result that one-way definability becomes undecidable for non-functional transducers) but the decision procedure had non-elementary complexity.We proposed a characterization of one-way definability thatallows us to decide it in double-exponential space, and provide anequivalent one-way transducer of triple-exponential size. We firststudied this question for a restricted class, namely sweepingtransducers, for which the decision procedure and the construction ofthe one-way transducer take one less exponential. For suchtransducers, our procedure is optimal in the sense that we have shownthat there exists a family of functions that are one-way definable andfor which an equivalent one-way transducer requires doubly exponentialsize.The study of sweeping transducers raised other definability questions: Is a given transducer equivalent to some sweeping transducer? And to some sweeping transducer that performs at most k passes? We showed that those questions are decidable and the decision procedure, as well as the equivalent transducer, have the same complexity as in the one-way case. Moreover, as we have shown that there exists a bound on the number of passes required to realize a transduction by a sweeping transducer, we managed to obtain a procedure to minimize the number of passes of a sweeping transducer.Finally we tried to characterize sweeping transducers in other models for regular transductions such as Streaming String transducers (SST) and MSO transductions. As we obtained an equivalence between the number of passes of a sweeping transducer and the number of registers of the equivalent SST we provided a minimization procedure for the number of registers of a large class of SST's. To conclude, our work allowed us to provide a good overall understanding of the definability questions between the models for regular transductions and in particular regarding the resources, whether it is the number of passes (and of course one-way definability is crucial in that aspect) or the number of registers
Li, Junhong Li. "Pier Streamlining as a Bridge Local Scour Countermeasure and the Underlying Scour Mechanism". University of Akron / OhioLINK, 2018. http://rave.ohiolink.edu/etdc/view?acc_num=akron1518565785864439.
Pełny tekst źródłaCzęści książek na temat "Two-way transducers"
Bose, Sougata, S. N. Krishna, Anca Muscholl i Gabriele Puppis. "One-way Resynchronizability of Word Transducers". W Lecture Notes in Computer Science, 124–43. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-71995-1_7.
Pełny tekst źródłaIbarra, Oscar H., i Hsu-Chun Yen. "On Two-Way Transducers". W Developments in Language Theory, 300–311. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-22321-1_26.
Pełny tekst źródłaFeng, Fan, i Andreas Maletti. "Weighted Two-Way Transducers". W Algebraic Informatics, 101–14. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-19685-0_8.
Pełny tekst źródłade Souza, Rodrigo. "Uniformisation of Two-Way Transducers". W Language and Automata Theory and Applications, 547–58. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-37064-9_48.
Pełny tekst źródłaCarton, Olivier. "Two-Way Transducers with a Two-Way Output Tape". W Developments in Language Theory, 263–72. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-31653-1_24.
Pełny tekst źródłaDouéneau-Tabot, Gaëtan. "Pebble minimization: the last theorems". W Lecture Notes in Computer Science, 436–55. Cham: Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-30829-1_21.
Pełny tekst źródłaBaudru, Nicolas, i Pierre-Alain Reynier. "From Two-Way Transducers to Regular Function Expressions". W Developments in Language Theory, 96–108. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-98654-8_8.
Pełny tekst źródłaEngelfriet, Joost, i Sebastian Maneth. "Two-Way Finite State Transducers with Nested Pebbles". W Lecture Notes in Computer Science, 234–44. Berlin, Heidelberg: Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-45687-2_19.
Pełny tekst źródłaChoffrut, Christian, i Bruno Guillon. "An Algebraic Characterization of Unary Two-Way Transducers". W Mathematical Foundations of Computer Science 2014, 196–207. Berlin, Heidelberg: Springer Berlin Heidelberg, 2014. http://dx.doi.org/10.1007/978-3-662-44522-8_17.
Pełny tekst źródłaSmith, Tim. "A Pumping Lemma for Two-Way Finite Transducers". W Mathematical Foundations of Computer Science 2014, 523–34. Berlin, Heidelberg: Springer Berlin Heidelberg, 2014. http://dx.doi.org/10.1007/978-3-662-44522-8_44.
Pełny tekst źródłaStreszczenia konferencji na temat "Two-way transducers"
Filiot, Emmanuel, Olivier Gauwin, Pierre-Alain Reynier i Frederic Servais. "From Two-Way to One-Way Finite State Transducers". W 2013 Twenty-Eighth Annual IEEE/ACM Symposium on Logic in Computer Science (LICS 2013). IEEE, 2013. http://dx.doi.org/10.1109/lics.2013.53.
Pełny tekst źródłaBaschenis, Felix, Olivier Gauwin, Anca Muscholl i Gabriele Puppis. "Untwisting two-way transducers in elementary time". W 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS). IEEE, 2017. http://dx.doi.org/10.1109/lics.2017.8005138.
Pełny tekst źródłaDartois, Luc, Emmanuel Filiot, Pierre-Alain Reynier i Jean-Marc Talbot. "Two-Way Visibly Pushdown Automata and Transducers". W LICS '16: 31st Annual ACM/IEEE Symposium on Logic in Computer Science. New York, NY, USA: ACM, 2016. http://dx.doi.org/10.1145/2933575.2935315.
Pełny tekst źródłaStoppel, F., C. Eisermann, S. Gu-Stoppel, D. Kaden, T. Giese i B. Wagner. "Novel membrane-less two-way MEMS loudspeaker based on piezoelectric dual-concentric actuators". W 2017 19th International Conference on Solid-State Sensors, Actuators and Microsystems (TRANSDUCERS). IEEE, 2017. http://dx.doi.org/10.1109/transducers.2017.7994475.
Pełny tekst źródłaHikmat, O. F., F. A. Mohd Ghazali, A. AbuZaiter i M. S. Mohamed Ali. "A monolithic tunable out-of-plane inductor based on NiTi two-way shape-memory-alloy". W 2017 19th International Conference on Solid-State Sensors, Actuators and Microsystems (TRANSDUCERS). IEEE, 2017. http://dx.doi.org/10.1109/transducers.2017.7994442.
Pełny tekst źródłaLin, Yu-Tzu, Sung-Cheng Lo i Weileun Fang. "Two-Way Piezoelectric MEMS Microspeaker with Novel Structure and Electrode Design for Bandwidth Enhancement". W 2021 21st International Conference on Solid-State Sensors, Actuators and Microsystems (Transducers). IEEE, 2021. http://dx.doi.org/10.1109/transducers50396.2021.9495444.
Pełny tekst źródłaTown, Jason, i Cengiz Camci. "Sub-Miniature Five-Hole Probe Calibration Using a Time Efficient Pitch and Yaw Mechanism and Accuracy Improvements". W ASME 2011 Turbo Expo: Turbine Technical Conference and Exposition. ASMEDC, 2011. http://dx.doi.org/10.1115/gt2011-46391.
Pełny tekst źródłaWang, X., i J. Tang. "Damage Detection Using Impedance Measurement With Magnetic Transducer". W ASME 2009 Conference on Smart Materials, Adaptive Structures and Intelligent Systems. ASMEDC, 2009. http://dx.doi.org/10.1115/smasis2009-1414.
Pełny tekst źródłaKarpachevskyy, Taras, i Swavik Spiewak. "Gravity-Assisted, Passive Cancellation of Disturbances for Inertial Sensors". W ASME 2013 International Mechanical Engineering Congress and Exposition. American Society of Mechanical Engineers, 2013. http://dx.doi.org/10.1115/imece2013-65775.
Pełny tekst źródłaMyers, M. R., A. B. Jorge, D. G. Walker i M. J. Mutton. "Heat Source Localization Sensitivity Analyses for an Ultrasonic Sensor Array". W ASME/JSME 2011 8th Thermal Engineering Joint Conference. ASMEDC, 2011. http://dx.doi.org/10.1115/ajtec2011-44120.
Pełny tekst źródłaRaporty organizacyjne na temat "Two-way transducers"
Gil, Oliver Fernández, i Anni-Yasmin Turhan. Answering Regular Path Queries Under Approximate Semantics in Lightweight Description Logics. Technische Universität Dresden, 2020. http://dx.doi.org/10.25368/2022.261.
Pełny tekst źródła