Search

Search Results

1. Quantum Logical Depth and Shallowness of Streaming Data by One-Way Quantum Finite-State Transducers (Preliminary Report)

   The logical depth of a piece of data has served as a complexity measure to describe the amount of “usefulness” and “non-randomness” of information...

   Tomoyuki Yamakami in Unconventional Computation and Natural Computation

   Conference paper 2021
   

2. Boosting Pushdown and Queue Machines by Preprocessing

   Motivated by preprocessing devices occurring for example in the context of syntactic parsers or HTML sanitization, we study pairs of finite state...

   Martin Kutrib, Andreas Malcher, Matthias Wendlandt in Implementation and Application of Automata

   Conference paper 2018
   

3. Transducing Reversibly with Finite State Machines

   Finite state machines are investigated towards their ability to reversibly compute transductions, that is, to transform inputs into outputs in a...

   Martin Kutrib, Andreas Malcher, Matthias Wendlandt in Implementation and Application of Automata

   Conference paper 2017
   

4. Injection Structures Specified by Finite State Transducers

   An injection structure \({\mathcal A}= (A,f)\)...

   Sam Buss, Douglas Cenzer, ... Jeffrey B. Remmel in Computability and Complexity

   Chapter 2017
   

5. Reversible Pushdown Transducers

   Deterministic pushdown transducers are studied with respect to their ability to compute reversible transductions, that is, to transform inputs into...

   Bruno Guillon, Martin Kutrib, ... Luca Prigioniero in Developments in Language Theory

   Conference paper 2018
   

6. TeSSLa: Temporal Stream-Based Specification Language

   Runtime verification is concerned with monitoring program traces. In particular, stream runtime verification (SRV) takes the program trace as input...

   Lukas Convent, Sebastian Hungerecker, ... Daniel Thoma in Formal Methods: Foundations and Applications

   Conference paper Open access 2018
   

7. Notes on spiking neural P systems and finite automata

   Spiking neural P systems (in short, SN P systems) are membrane computing models inspired by the pulse coding of information in biological neurons. SN...

   Francis George C. Cabarle, Henry N. Adorna, Mario J. Pérez-Jiménez in Natural Computing

   Article 06 July 2016
   

8. Simple linear string constraints

   Modern web applications often suffer from command injection attacks. Even when equipped with sanitization code, many systems can be penetrated due to...

   **ang Fu, Michael C. Powell, ... Chung-Chih Li in Formal Aspects of Computing

   Article 17 January 2012

9. Postselection Finite Quantum Automata

   Postselection for quantum computing devices was introduced by S.Aaronson[2] as an excitingly efficient tool to solve long standing problems of...

   Oksana Scegulnaja-Dubrovska, Lelde Lāce, Rūsiņš Freivalds in Unconventional Computation

   Conference paper 2010
   

10. Size of Quantum Finite State Transducers

    Sizes of quantum and deterministic finite state transducers are compared in the case when both quantum and deterministic finite state transducers...

    Ruben Agadzanyan, Rūsiņš Freivalds in SOFSEM 2007: Theory and Practice of Computer Science

    Conference paper 2007
    

11. A Flexible Rule Compiler for Speech Synthesis

    We present a flexible rule compiler developed for a text-to-speech (TTS) system. The compiler converts a set of rules into a finite-state transducer...

    Wojciech Skut, Stefan Ulrich, Kathrine Hammervold in Intelligent Information Processing and Web Mining

    Conference paper 2004
    

12. Quantum Finite State Transducers

    We introduce quantum finite state transducers (qfst), and study the class of relations which they compute. It turns out that they share many features...

    Rūsinņš Freivalds, Andreas Winter in SOFSEM 2001: Theory and Practice of Informatics

    Conference paper 2001
    

13. Interpretations of synchronous flowchart schemes

    Miklós Bartha in Fundamentals of Computation Theory

    Conference paper 1989