scholarly journals IMPLEMENTASI DETERMINISTIC FINITE AUTOMATA (DFA) PADA PERANCANGAN APLIKASI PERHITUNGAN UANG HARIAN PERJALANAN DINAS KEMENTERIAN

2021 ◽  
Vol 9 (02) ◽  
pp. 100-104
Author(s):  
Deny Robyanto ◽  
Ade Priyatna Priyatna ◽  
Eni Heni Hermaliani ◽  
Frieyadie Frieyadie ◽  
Windu Gata
Keyword(s):  
Finite Automata ◽  
The State ◽  
Abstract Machine ◽  
Application System ◽  
Deterministic Finite Automata ◽  
One Stage ◽  
Abstract Machines ◽  
Last Stage

Each ministry always has a budget for official travel, especially for the daily money given to personnel who travel in exchange for daily expenses. With the current pendemi need to be held an application system that can reduce contact when handling official travel files. The design of this application will use the implementation of Deterministic Finite Automata (DFA) as an abstract machine to determine the state or stages to determine the transition between these stages to determine the daily money calculation of official travel. From the calculation of daily money will be made recapitulation to be verified and if it is considered appropriate and correct will be transferred to the account that travels to the office. This is the role in making abstract machines for the calculation of daily money using Deterministic Finite Automata (DFA) because each stage is right to one stage next until the last stage that prints proof of transfer.

STATE COMPLEXITY OF ADDITIVE WEIGHTED FINITE AUTOMATA

2007 ◽  
Vol 18 (06) ◽  
pp. 1407-1416 ◽  
Author(s):  
KAI SALOMAA ◽  
PAUL SCHOFIELD
Keyword(s):  
Upper Bound ◽  
Finite Automaton ◽  
Regular Language ◽  
Finite Automata ◽  
The State ◽  
Deterministic Finite Automata ◽  
State Complexity ◽  
Weighted Finite Automata

It is known that the neighborhood of a regular language with respect to an additive distance is regular. We introduce an additive weighted finite automaton model that provides a conceptually simple way to reprove this result. We consider the state complexity of converting additive weighted finite automata to deterministic finite automata. As our main result we establish a tight upper bound for the state complexity of the conversion.

scholarly journals Regular Expressions with Lookahead

2021 ◽  
Vol 27 (4) ◽  
pp. 324-340
Author(s):  
Martin Berglund ◽  
Brink van der Merwe ◽  
Steyn van Litsenborgh
Keyword(s):  
Finite Automata ◽  
The State ◽  
Regular Expressions ◽  
Deterministic Finite Automata ◽  
State Complexity

This paper investigates regular expressions which in addition to the standard operators of union, concatenation, and Kleene star, have lookaheads. We show how to translate regular expressions with lookaheads (REwLA) to equivalent Boolean automata having at most 3 states more than the length of the REwLA. We also investigate the state complexity when translating REwLA to equivalent deterministic finite automata (DFA).

State Complexity of k-Union and k-Intersection for Prefix-Free Regular Languages

2015 ◽  
Vol 26 (02) ◽  
pp. 211-227 ◽  
Author(s):  
Hae-Sung Eom ◽  
Yo-Sub Han ◽  
Kai Salomaa
Keyword(s):  
Lower Bound ◽  
Upper Bound ◽  
Finite Automata ◽  
Constant Factor ◽  
The State ◽  
Regular Languages ◽  
Deterministic Finite Automata ◽  
State Complexity ◽  
Binary Alphabet ◽  
Multiple Intersections

We investigate the state complexity of multiple unions and of multiple intersections for prefix-free regular languages. Prefix-free deterministic finite automata have their own unique structural properties that are crucial for obtaining state complexity upper bounds that are improved from those for general regular languages. We present a tight lower bound construction for k-union using an alphabet of size k + 1 and for k-intersection using a binary alphabet. We prove that the state complexity upper bound for k-union cannot be reached by languages over an alphabet with less than k symbols. We also give a lower bound construction for k-union using a binary alphabet that is within a constant factor of the upper bound.

scholarly journals Two Extensions of Cover Automata

Axioms ◽  
2021 ◽  
Vol 10 (4) ◽  
pp. 338
Author(s):  
Cezar Câmpeanu
Keyword(s):  
Computational Complexity ◽  
Finite Automata ◽  
The State ◽  
Finite Cover ◽  
Deterministic Finite Automata ◽  
State Complexity ◽  
Compact Representations ◽  
Minimization Algorithms ◽  
Deterministic Automata ◽  
Representation Transformation

Deterministic Finite Cover Automata (DFCA) are compact representations of finite languages. Deterministic Finite Automata with “do not care” symbols and Multiple Entry Deterministic Finite Automata are both compact representations of regular languages. This paper studies the benefits of combining these representations to get even more compact representations of finite languages. DFCAs are extended by accepting either “do not care” symbols or considering multiple entry DFCAs. We study for each of the two models the existence of the minimization or simplification algorithms and their computational complexity, the state complexity of these representations compared with other representations of the same language, and the bounds for state complexity in case we perform a representation transformation. Minimization for both models proves to be NP-hard. A method is presented to transform minimization algorithms for deterministic automata into simplification algorithms applicable to these extended models. DFCAs with “do not care” symbols prove to have comparable state complexity as Nondeterministic Finite Cover Automata. Furthermore, for multiple entry DFCAs, we can have a tight estimate of the state complexity of the transformation into equivalent DFCA.

scholarly journals A Functional Correspondence between Monadic Evaluators and Abstract Machines for Languages with Computational Effects

2003 ◽  
Vol 10 (35) ◽  
Author(s):  
Mads Sig Ager ◽  
Olivier Danvy ◽  
Jan Midtgaard
Keyword(s):  
Lambda Calculus ◽  
The State ◽  
Abstract Machine ◽  
Abstract Machines ◽  
Canonical State

We extend our correspondence between evaluators and abstract machines from the pure setting of the lambda-calculus to the impure setting of the computational lambda-calculus. Specifically, we show how to derive new abstract machines from monadic evaluators for the computational lambda-calculus. Starting from a monadic evaluator and a given monad, we inline the components of the monad in the evaluator and we derive the corresponding abstract machine by closure-converting, CPS-transforming, and defunctionalizing this inlined interpreter. We illustrate the construction first with the identity monad, obtaining yet again the CEK machine, and then with a state monad, an exception monad, and a combination of both.<br /> <br />In addition, we characterize the tail-recursive stack inspection presented by Clements and Felleisen at ESOP 2003 as a canonical state monad. Combining this state monad with an exception monad, we construct an abstract machine for a language with exceptions and properly tail-recursive stack inspection. The construction scales to other monads--including one more properly dedicated to stack inspection than the state monad--and other monadic evaluators.

Deterministic finite automata with recursive calls and DPDAs

2003 ◽  
Vol 87 (4) ◽  
pp. 187-193
Author(s):  
Jean H. Gallier ◽  
Salvatore La Torre ◽  
Supratik Mukhopadhyay
Keyword(s):  
Finite Automata ◽  
Deterministic Finite Automata

The detection and stabilisation of limit cycle for deterministic finite automata

2017 ◽  
Vol 91 (4) ◽  
pp. 874-886 ◽  
Author(s):  
Xiaoguang Han ◽  
Zengqiang Chen ◽  
Zhongxin Liu ◽  
Qing Zhang
Keyword(s):  
Limit Cycle ◽  
Finite Automata ◽  
Deterministic Finite Automata

Space-bounded OTMs and REG ∞

Computability ◽  
2021 ◽  
pp. 1-16
Author(s):  
Merlin Carl
Keyword(s):  
Complexity Theory ◽  
Turing Machine ◽  
Finite Automata ◽  
Regular Languages ◽  
The Other ◽  
Deterministic Finite Automata ◽  
Logarithmic Space ◽  
Working Space ◽  
Important Theorem

An important theorem in classical complexity theory is that REG = LOGLOGSPACE, i.e., that languages decidable with double-logarithmic space bound are regular. We consider a transfinite analogue of this theorem. To this end, we introduce deterministic ordinal automata (DOAs) and show that they satisfy many of the basic statements of the theory of deterministic finite automata and regular languages. We then consider languages decidable by an ordinal Turing machine (OTM), introduced by P. Koepke in 2005 and show that if the working space of an OTM is of strictly smaller cardinality than the input length for all sufficiently long inputs, the language so decided is also decidable by a DOA, which is a transfinite analogue of LOGLOGSPACE ⊆ REG; the other direction, however, is easily seen to fail.

Sign in / Sign up

Export Citation Format

Share Document