Filters








4,741 Hits in 4.0 sec

Aggregation-based minimization of finite state automata

Johanna Björklund, Loek Cleophas
2020 Acta Informatica  
We present a minimization algorithm for non-deterministic finite state automata that finds and merges bisimulation-equivalent states.  ...  state and input symbol, and |Σ| is the size of the input alphabet.  ...  To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.  ... 
doi:10.1007/s00236-019-00363-5 fatcat:ovsmow44urao7ol2sxesb3oosi

Reducing Timed Automata: A New Approach

Ilham Kitouni
2012 International Journal of Information Sciences and Techniques  
In this paper we present a new approach for reducing timed automata. In fact regions of a region automaton are aggregated according to a coarse equivalence class partitioning based on traces.  ...  KEYWORDS Real time systems, Timed automata, Region automata, model transformation, ATOM3 2 1 0 J J  ...  Hence, we claim that the validation methods based on region automata and digitization of their state spaces are renewed by aggregation regions automata and optimized in the above sense.  ... 
doi:10.5121/ijist.2012.2402 fatcat:jooahysufrbpdez4ex55rtgm34

Page 6369 of Mathematical Reviews Vol. , Issue 97J [page]

1997 Mathematical Reviews  
A state encoding algorithm is formulated to embed the DI*CA based test machine in the synthe- sized FSM while minimizing the hardware overhead.  ...  ; Kharagpur); Pal Chaudhuri, Parimal (6-1]TKH-C; Kharagpur) Theory and application of nongroup cellular automata for synthesis of easily testable finite state machines.  ... 

Page 9250 of Mathematical Reviews Vol. , Issue 2002M [page]

2002 Mathematical Reviews  
Minh Hoang] and Thomas Thierauf, The complexity of the minimal polynomial (408-420); Galina Jiraskova, Note on minimal finite automata (421—431); Jarkko Kari, Synchronizing finite automata on Eulerian  ...  Todd Wareham, The parameterized complexity of intersection and composition operations on sets of finite-state automata (302-310); Bruce W.  ... 

Parallel calculations by automata on direct and back spanning trees of a graph
Параллельные вычисления автоматами на прямом и обратном остовах графа

Igor Burdonov, Alexander Kossachev, Victor Kuliamin
2014 Proceedings of the Institute for System Programming of RAS  
, which require only finite number of bits in each graph vertex, and to represent the function calculated as a composition of so called aggregate function and another one.  ...  The computation is performed by message passing executed by automata distributed on the graph vertices.  ...  Aggregate functions theory presented here is a modification of inductive functions theory given in [ [2] ]. Below we consider functions on finite multisets, which elements belong to some base set X.  ... 
doi:10.15514/ispras-2014-26(6)-5 fatcat:aerpamj6ybaqlccaancxeqnadm

Finding the Minimal DFA of Very Large Finite State Automata with an Application to Token Passing Networks [article]

Vlad Slavici, Daniel Kunkle, Gene Cooperman, Stephen Linton
2011 arXiv   pre-print
Finite state automata (FSA) are ubiquitous in computer science.  ...  That computation produced an intermediate DFA with 525,000 states and an unreported number of states for the corresponding minimal DFA.  ...  In the rest of this paper, Section 2 presents related work. Section 3 presents background on finite state automata and their minimization.  ... 
arXiv:1103.5736v1 fatcat:zrx7suswn5fjljwh3kvjdhxpiy

Bisimulation relations for weighted automata

Peter Buchholz
2008 Theoretical Computer Science  
This paper introduces a general definition of bisimulation which can be applied to finite automata where weights and labels are assigned to transitions.  ...  Furthermore it is shown that forward and backward bisimulation are congruences according to commonly known composition operations for automata.  ...  We consider weighted automata over finite alphabets and with a finite state space.  ... 
doi:10.1016/j.tcs.2007.11.018 fatcat:kkad6emak5dddfbfieatcqqvke

Page 5586 of Mathematical Reviews Vol. , Issue 96i [page]

1996 Mathematical Reviews  
We solve the problem of calculating the number of states of a minimal DGA for a given language, by giving a procedure that effectively constructs it starting from the minimal (conventional) deterministic  ...  We show that Turing machines can be modeled by means of PCS of dimension 3. On the other hand, in the case of dimension 2, it is impossible to model the functioning of some finite automata.  ... 

Automata-based Quantitative Verification [article]

Suguman Bansal
2020 arXiv   pre-print
Comparators enable automata-based methods in the numerical phase, hence eradicating the dependence on numerical methods.  ...  The introduced framework, called comparator automata or comparators in short, builds on automata-theoretic foundations to generalize across a variety of cost models.  ...  Definition 2.1 (Aggregate function automaton, ω-Regular aggregate function) Let Σ be a finite set, and β ≥ 2 be an integer-valued base.  ... 
arXiv:2010.02055v1 fatcat:jynqpn2msrdi5j72t3fm6yuiti

Durational Actions Timed Automata: Determinization and Expressiveness

Ilham Kitouni, Hiba Hachichi, Kenza Bouarroudj, Djamel-Eddine Saidouni
2012 International Journal of Applied Information Systems  
Next, we propose a simple framework to aggregate region of DATA* for reducing its space state.  ...  This study is based on an aggregation region automata procedure to reduce the combinatorial explosion of regions. Finally, we discuss equivalence and validation of systems.  ...  the minimization of state space.  ... 
doi:10.5120/ijais12-450609 fatcat:sl3sxwfoajee5lyyfthdbnntdm

Shift operators and complex systems

Luai Jaff, Cyrille Bertelle, Gerard H.E. Duchamp
2008 International journal of Modeling, identification and control  
In a previous paper (14) , some of the authors dealt with the use of automata with (various type of) multiplicities for modelizing agents with rational behaviour and how one could perform genetic operations  ...  In this paper, we emphasize the role played by shift operators to identify automata with similar behaviour.  ...  Several domains have been developped within automata theory including: cellular automata, boolean automata (or finites-state automata) and multiplicity automata.  ... 
doi:10.1504/ijmic.2008.018184 fatcat:2377c5mpqfgixoe6rhpnrrgtbe

Page 6323 of Mathematical Reviews Vol. , Issue 93k [page]

1993 Mathematical Reviews  
Summary: “A characterization of additive cellular automata (CAs) on the basis of the invariant, minimal and characteristic poly- nomials is reported in this paper.  ...  At the very end a proper inclusion of the class of w-tree sets recognizable by deter- ministic top-down automata and the class of w-trees acceptable by q@-tree automata is stated.  ... 

Page 103 of Automation and Remote Control Vol. 20, Issue 1 [page]

1959 Automation and Remote Control  
logical functions one may form a system of equations and may determine the properties of the system of automata states.  ...  In the section of finite automata theory there were considered several questions dealing with the theory of automatic systems which consist of finite numbers of elements, each of which can have a finite  ... 

Finite-state Strategies in Delay Games

Martin Zimmermann
2017 Electronic Proceedings in Theoretical Computer Science  
What is a finite-state strategy in a delay game?  ...  conditions that satisfy a certain aggregation property.  ...  single state. • The winner of an arena-based Muller game has a finite-state strategy with n!  ... 
doi:10.4204/eptcs.256.11 fatcat:xbabfsnirzfq5lrqjcin7ow4ue

Backward and forward bisimulation minimization of tree automata

Johanna Högberg, Andreas Maletti, Jonathan May
2009 Theoretical Computer Science  
] bisimulation minimization algorithm for finite-state tree automata by introducing backward and forward bisimulation and developing minimization algorithms for them.  ...  Minimization via backward bisimulation generalizes the previous algorithm and can yield smaller automata but is just as fast.  ...  Acknowledgments The authors acknowledge the support and advice of Frank Drewes and Kevin Knight. We thank Lisa Kaati for providing data and information relevant to the details of [6] .  ... 
doi:10.1016/j.tcs.2009.03.022 fatcat:xwzqbdemzfhwlabn4nksa5l2ce
« Previous Showing results 1 — 15 out of 4,741 results