Penerapan Konsep Finite State Automata (FSA) pada Vending Machine Voucher Internet Corner

Copyless streaming string transducers (copyless SST) have been introduced by R. Alur and P. Černý in 2010 as a one-way deterministic automata model to define transductions of finite strings. Copyless SST extend deterministic finite state automata with a set of variables in which to store intermediate output strings, and those variables can be combined and updated all along the run, in a linear manner, i.e., no variable content can be copied on transitions. It is known that copyless SST capture exactly the class of MSO-definable string-to-string transductions, and are as expressive as deterministic two-way transducers. They enjoy good algorithmic properties. Most notably, they have decidable equivalence problem (in PSpace). On the other hand, HDT0L systems have been introduced for a while, the most prominent result being the decidability of the equivalence problem. In this paper, we propose a semantics of HDT0L systems in terms of transductions, and use it to study the class of deterministic copyful SST. Our contributions are as follows: (i)HDT0L systems and total deterministic copyful SST have the same expressive power, (ii)the equivalence problem for deterministic copyful SST and the equivalence problem for HDT0L systems are inter-reducible, in quadratic time. As a consequence, equivalence of deterministic SST is decidable, (iii)the functionality of non-deterministic copyful SST is decidable, (iv)determining whether a non-deterministic copyful SST can be transformed into an equivalent non-deterministic copyless SST is decidable in polynomial time.

Get full-text (via PubEx)

Synthesis with Mandatory Stop Actions

10.24963/kr.2021/23 ◽

2021 ◽

Author(s):

Giuseppe De Giacomo ◽

Antonio Di Stasio ◽

Giuseppe Perelli ◽

Shufang Zhu

Keyword(s):

Model Checking ◽

Finite State Automata ◽

Deep Impact ◽

Synthesis Technique ◽

Büchi Automata ◽

Finite State ◽

Ltl Synthesis ◽

Buchi Automata ◽

The Impact

We study the impact of the need for the agent to obligatorily instruct the action stop in her strategies. More specifically we consider synthesis (i.e., planning) for LTLf goals under LTL environment specifications in the case the agent must mandatorily stop at a certain point. We show that this obligation makes it impossible to exploit the liveness part of the LTL environment specifications to achieve her goal, effectively reducing the environment specifications to their safety part only. This has a deep impact on the efficiency of solving the synthesis, which can sidestep handling Buchi determinization associated to LTL synthesis, in favor of finite-state automata manipulation as in LTLf synthesis. Next, we add to the agent goal, expressed in LTLf, a safety goal, expressed in LTL. Safety goals must hold forever, even when the agent stops, since the environment can still continue its evolution. Hence the agent, before stopping, must ensure that her safety goal will be maintained even after she stops. To do synthesis in this case, we devise an effective approach that mixes a synthesis technique based on finite-state automata (as in the case of LTLf goals) and model-checking of nondeterministic Buchi automata. In this way, again, we sidestep Buchi automata determinization, hence getting a synthesis technique that is intrinsically simpler than standard LTL synthesis.

Get full-text (via PubEx)

Electronic Dictionaries and Acyclic Finite-State Automata

Topics in Computer Mathematics - Grammars and Automata for String Processing ◽

10.1201/9780203009642.ch18 ◽

2003 ◽

pp. 177-188 ◽

Cited By ~ 3

Author(s):

Denis Maurel

Keyword(s):

Finite State Automata ◽

Finite State

Get full-text (via PubEx)