Efficient implementation of regular languages using reversed alternating finite automata

Salomaa, Kai; Wu, Xiangyou; Yü, Sheng

doi:10.1016/s0304-3975(99)00020-1

Cited by 6 publications

(2 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…An r-AFA [Chandra et al 1981;Salomaa et al 2000] consists of (Q, Σ, δ, I , F ) where the transition function δ assigns to each state in Q a Boolean combination of the previous values of Q. For example, we could assign δ (q 3 ) = q 1 ∧ (q 2 ∨ ¬q 3 ).…”

Section: Comparison With Finite-state Automatamentioning

confidence: 99%

Modular quantitative monitoring

Alur

Mamouras

Stanford

2019

Proc. ACM Program. Lang.

View full text Add to dashboard Cite

In real-time decision making and runtime monitoring applications, declarative languages are commonly used as they facilitate modular high-level specifications with the compiler guaranteeing evaluation over data streams in an efficient and incremental manner. We introduce the model of Data Transducers to allow modular compilation of queries over streaming data. A data transducer maintains a finite set of data variables and processes a sequence of tagged data values by updating its variables using an allowed set of operations. The model allows unambiguous nondeterminism, exponentially succinct control, and combining values from parallel threads of computation. The semantics of the model immediately suggests an efficient streaming algorithm for evaluation. The expressiveness of data transducers coincides with streamable regular transductions, a robust and streamable class of functions characterized by MSO-definable string-to-DAG transformations with no backward edges. We show that the novel features of data transducers, unlike previously studied transducers, make them as succinct as traditional imperative code for processing data streams, but the structuring of the transition function permits modular compilation. In particular, we show that operations such as parallel composition, union, prefix-sum, and quantitative analogs of combinators for unambiguous parsing, can be implemented by natural and succinct constructions on data transducers. To illustrate the benefits of such modularity in compilation, we define a new language for quantitative monitoring, QRE-Past, that integrates features of past-time temporal logic and quantitative regular expressions. While this combination allows a natural specification of a cardiac arrhythmia detection algorithm in QRE-Past, compilation of QRE-Past specifications into efficient monitors comes for free thanks to succinct constructions on data transducers.

show abstract

Section: Comparison With Finite-state Automatamentioning

confidence: 99%

Modular quantitative monitoring

Alur

Mamouras

Stanford

2019

Proc. ACM Program. Lang.

View full text Add to dashboard Cite

show abstract

“…Independently, AFA were introduced in [3,4] under the name of Boolean automata. Since then most of the subsequent research focused on various types of alternating machines to complexity classes, see for example, [5,6,8,9,10,12,14].…”

Section: Introductionmentioning

confidence: 99%

Deterministic Timed AFA: A New Class of Timed Alternating Finite Automata

Fellah¹,

Friggstad²,

Noureddine³

2007

J. of Computer Science

View full text Add to dashboard Cite

Timed Alternating Finite Automata (TAFA), a natural generalization of Timed Finite Automata (TFA), are synchronous and powerful models for real-time computations. They become an effective and expressive model for developing embedded systems with real-time constraint computations which are required in many applications. We introduce Deterministic Timed Alternating Finite Automata (DTAFA), a new class of timed alternating finite automata, extended with a finite set of restricted and mutually exclusive real-valued clocks on events which trigger the state transitions of the automaton. We show how to transform deterministic n-state TFA into log n-state DTAFA and state some language properties between TFA, DTAFA, and deterministic TFA. We then show that, unlike TFA and TAFA, DTAFA are closed under all Boolean operations, including the complementation

show abstract

Hopcroft’s Minimization Technique: Queues or Stacks?

Păun

Rodríguez‐Patón

Implementation and Applications of Automata

View full text Add to dashboard Cite

Efficient implementation of regular languages using reversed alternating finite automata

Cited by 6 publications

References 12 publications

Modular quantitative monitoring

Modular quantitative monitoring

Deterministic Timed AFA: A New Class of Timed Alternating Finite Automata

Hopcroft’s Minimization Technique: Queues or Stacks?

Contact Info

Product

Resources

About