Descriptional Complexity of Formal Systems: 20th IFIP WG 1.02 International Conference, DCFS 2018, Halifax, NS, Canada, July 25-27, 2018, Proceedings von Konstantinidis, Stavros, Pighizzini, Giovanni

Volltext

Assessment and mitigation of bleeding risk in atrial fibrillation and venous thromboembolism: A Position Paper from the ESC Working Group on Thrombosis, in collaboration with the E... von Gorog, Diana A, Gue, Ying X, Chao, Tze-Fan, Fauchier, Laurent, Ferreiro, Jose Luis, Huber, Kurt, Konstantinidis, Stavros V, Lane, Deirdre A, Marin, Francisco, Oldgren, Jonas, Potpara, Tatjana, Roldan, Vanessa, Rubboli, Andrea, Sibbing, Dirk, Tse, Hung-Fat, Vilahur, Gemma, Lip, Gregory Y H

Volltext

On the size of partial derivatives and the word membership problem von Konstantinidis, Stavros, Machiavelo, António, Moreira, Nelma, Reis, Rogério

Volltext

Simulation of the Transient Thermal Response of a High Pressure Selective Catalytic Reduction Aftertreatment System for a Tier III Two-Stroke Marine Diesel Engine von Foteinos, Michael I, Konstantinidis, Stavros K, Kyrtatos, Nikolaos P, Busk, Kræn Vodder

Volltext

Efficient Algorithms for Computing the Inner Edit Distance of a Regular Language via Transducers von Kari, Lila, Konstantinidis, Stavros, Kopecki, Steffen, Yang, Meng

Volltext

Descriptional Complexity of Formal Systems (DCFS 2019) von Jirásková, Galina, Konstantinidis, Stavros

Volltext

Special section on Descriptional Complexity of Formal Systems von Konstantinidis, Stavros, Pighizzini, Giovanni

Volltext

Descriptional Complexity of Formal Systems: 21st IFIP WG 1.02 International Conference, DCFS 2019, Košice, Slovakia, July 17-19, 2019, Proceedings

Volltext

Implementation and Application of Automata (CIAA 2013) von Konstantinidis, Stavros

Volltext

Alternation in two-way finite automata von Konstantinidis, Stavros, Moreira, Nelma, Reis, Rogerio

Volltext

Partial derivatives of regular expressions over alphabet-invariant and user-defined labels von Konstantinidis, Stavros, Moreira, Nelma, Reis, Rogério

Volltext

Approximate NFA universality and related problems motivated by information theory von Konstantinidis, Stavros, Mastnak, Mitja, Moreira, Nelma, Reis, Rogério

Volltext

Computing the edit distance of a regular language von Konstantinidis, Stavros

Volltext

On the difference set of two transductions von Konstantinidis, Stavros, Moreira, Nelma, Reis, Rogério, Šebej, Juraj

Volltext

On the average complexity of partial derivative transducers von Konstantinidis, Stavros, Machiavelo, António, Moreira, Nelma, Reis, Rogério

Volltext

Early Nested Word Automata for XPath Query Answering on XML Streams von Debarbieux, Denis, Gauwin, Olivier, Niehren, Joachim, Sebastian, Tom, Zergaoui, Mohamed

Volltext

Theoretical and Implementational Aspects of the Formal Language Server (LaSer) von Konstantinidis, Stavros

Volltext

Descriptional Complexity of Formal Systems: 20th IFIP WG 1. 02 International Conference, DCFS 2018, Halifax, NS, Canada, July 25-27, 2018, Proceedings von Konstantinidis, Stavros, Pighizzini, Giovanni

Volltext

State Complexity Characterizations of Parameterized Degree-Bounded Graph Connectivity, Sub-Linear Space Computation, and the Linear Space Hypothesis von Yamakami, Tomoyuki

Volltext

Transducer descriptions of DNA code properties and undecidability of antimorphic problems von Kari, Lila, Konstantinidis, Stavros, Kopecki, Steffen

Volltext