Complexity of input-driven pushdown automata

A Okhotin, K Salomaa - ACM SIGACT News, 2014 - dl.acm.org
In an input-driven pushdown automaton (IDPDA), the current input symbol determines
whether the automaton performs a push operation, a pop operation, or does not touch the …

Symbolic visibly pushdown automata

L D'Antoni, R Alur - … Aided Verification: 26th International Conference, CAV …, 2014 - Springer
Nested words model data with both linear and hierarchical structure such as XML
documents and program traces. A nested word is a sequence of positions together with a …

Event trend aggregation under rich event matching semantics

O Poppe, C Lei, EA Rundensteiner… - Proceedings of the 2019 …, 2019 - dl.acm.org
Streaming applications from cluster monitoring to algorithmic trading deploy Kleene queries
to detect and aggregate event trends. Rich event matching semantics determine how to …

[HTML][HTML] State complexity of operations on input-driven pushdown automata

A Okhotin, K Salomaa - Journal of Computer and System Sciences, 2017 - Elsevier
The family of languages recognized by deterministic input-driven pushdown automata
(IDPDA; aka visibly pushdown automata, aka nested word automata) is known to be closed …

Xquery streaming by forest transducers

S Hakuta, S Maneth, K Nakano… - 2014 IEEE 30th …, 2014 - ieeexplore.ieee.org
Streaming of XML transformations is a challenging task and only a few existing systems
support streaming. Research approaches generally define custom fragments of XQuery and …

Determinization and minimization of automata for nested words revisited

J Niehren, M Sakho - Algorithms, 2021 - mdpi.com
We consider the problem of determinizing and minimizing automata for nested words in
practice. For this we compile the nested regular expressions (NREs) from the usual XPath …

Fusing effectful comprehensions

O Saarikivi, M Veanes, T Mytkowicz… - ACM SIGPLAN …, 2017 - dl.acm.org
List comprehensions provide a powerful abstraction mechanism for expressing
computations over ordered collections of data declaratively without having to use explicit …

Earliest query answering for deterministic stepwise hedge automata

A Al Serhali, J Niehren - … Conference on Implementation and Application of …, 2023 - Springer
Earliest query answering (EQA) is the problem to enumerate certain query answers on
streams at the earliest events. We consider EQA for regular monadic queries on hedges or …

A benchmark collection of deterministic automata for XPath queries

A Al Serhali, J Niehren - XML Prague 2022, 2022 - inria.hal.science
We provide a benchmark collection of deterministic automata for regular XPath queries. For
this, we select the subcollection of forward navigational XPath queries from a corpus that …

Understanding and improving faculty professional development in teaching

J Layne, J Froyd, N Simpson, R Caso… - 34th Annual Frontiers …, 2004 - ieeexplore.ieee.org
Various entities within and related to higher education offer activities designed to promote
professional development of faculty in the area of teaching. A critical challenge to these …