765 Hits in 3.7 sec

Comparison of Construction Algorithms for Minimal, Acyclic, Deterministic, Finite-State Automata from Sets of Strings [chapter]

Jan Daciuk
2003 Lecture Notes in Computer Science  
This paper compares various methods for constructing minimal, deterministic, acyclic, finite-state automata (recognizers) from sets of words.  ...  Incremental, semi-incremental, and non-incremental methods have been implemented and evaluated.  ...  The outline of experiments was discussed with Bruce Watson. This research was carried out within the framework of the PIONIER  ... 
doi:10.1007/3-540-44977-9_26 fatcat:ebn4ohc5jrga7lwqb5723v32ta

Incremental construction of minimal acyclic finite-state automata [article]

Jan Daciuk, Stoyan Mihov, Bruce Watson, Richard Watson
2000 arXiv   pre-print
In this paper, we describe a new method for constructing minimal, deterministic, acyclic finite-state automata from a set of strings.  ...  Our approach is to construct a minimal automaton in a single phase by adding new strings one by one and minimizing the resulting automaton on-the-fly.  ...  For this reason, it is only semi-incremental and does not maintain full minimality while adding words -although it usually maintains the automata close enough to minimality for practical applications.  ... 
arXiv:cs/0007009v1 fatcat:gfidqxhnsfdqpksrcttvyzwdpa

Page 2337 of Mathematical Reviews Vol. 58, Issue 3 [page]

1979 Mathematical Reviews  
The class of stationary, independent increment processes on Lie groups is then characterized in terms of semi-groups of probability operators and their infinitesimal generators using results due to Feller  ...  We construct, under the assumption that the a priori density can have a finite nuizher of discontinuities of the first kind, a correction to ¥ whose mean square risk is minimal up to terms of order higher  ... 

Abstracts of Current Computer Literature

1968 IEEE transactions on computers  
The Chebyshev semi-iterative procedure is summarized and the ADI process is defined.  ...  The construction of an algorithm is described in detail.  ... 
doi:10.1109/tc.1968.227415 fatcat:gww3av6fqncynbg6czmzjuomxi

Taming the Complexity of Timeline-Based Planning over Dense Temporal Domains

Laura Bozzelli, Angelo Montanari, Adriano Peron, Michael Wagner
2019 Foundations of Software Technology and Theoretical Computer Science  
and to reduce it to non-emptiness of Timed Automata (TA).  ...  A similar idea is exploited by Event-Clock Automata (ECA) [3], a well-known robust subclass of Timed Automata(TA) [2] .  ...  semantics) that increment and decrement M -instructions are correctly encoded.  ... 
doi:10.4230/lipics.fsttcs.2019.34 dblp:conf/fsttcs/BozzelliMP19a fatcat:xmrgphffb5cyfexovpmfzpwj7q

CAVEAT: technique and tool for computer aided verification and transformation [chapter]

E. Pascal Gribomont, Didier Rossetto
1995 Lecture Notes in Computer Science  
We describe CAVEAT, a technique and a tool (under development) for the stepwise design and verification of nearly finite-state concurrent systems (NFCS).  ...  The second part of CAVEAT (not implemented yet) supports an incremental development method that is fairly systematic, but has proved to be flexible enough in practice. attribute P-type a to negations.  ...  Besides, using Boolean automata can be more effective than using Boolean formulas, and this kind of approach is not restricted to investigating concurrent systems [17] .  ... 
doi:10.1007/3-540-60045-0_41 fatcat:t7jcmd3si5aoljs5gdkw5mivm4

Detecting Opportunities for Differential Maintenance of Extracted Views [article]

Besat Kassaie, Frank Wm. Tompa
2020 arXiv   pre-print
Semi-structured and unstructured data management is challenging, but many of the problems encountered are analogous to problems already addressed in the relational context.  ...  We formally characterize three classes of document updates, namely those that are irrelevant, autonomously computable, and pseudo-irrelevant with respect to a given extractor.  ...  Acknowledgements We gratefully acknowledge financial assistance received from the University of Waterloo and NSERC, the Natural Sciences and Engineering Research Council of Canada.  ... 
arXiv:2007.01973v1 fatcat:6hrwwrlcq5b7rfxxgyvok276ai

Efficient Automata-Based Assertion-Checker Synthesis of PSL Properties

Marc Boule, Zeljko Zilic
2006 High Level Design Validation and Test Workshop (HLDVT), IEEE International  
For this purpose, automata algorithms are developed for the base cases, and a complete set of rewrite rules is developed and applied for all other operators.  ...  We present a technique for automata-based checker generation of PSL properties for dynamic verification.  ...  Since a Boolean expression b can be seen as the sequence {b}, the construction of automata for Boolean expressions in both modes is subsumed by the construction of automata for sequences.  ... 
doi:10.1109/hldvt.2006.319966 dblp:conf/hldvt/BouleZ06 fatcat:yx4ng3z2izhfpjzv4biki4geuu

An Efficient Coq Tactic for Deciding Kleene Algebras [chapter]

Thomas Braibant, Damien Pous
2010 Lecture Notes in Computer Science  
This tactic relies on a careful implementation of efficient finite automata algorithms, so that it solves casual equations almost instantaneously.  ...  We present a reflexive tactic for deciding the equational theory of Kleene algebras in the Coq proof assistant.  ...  Algebraic hierarchy The mathematical definition of a Kleene algebra is incremental: a Kleene algebra is a non-commutative semiring, which is itself composed of a monoid and a semi-lattice.  ... 
doi:10.1007/978-3-642-14052-5_13 fatcat:5dcm5rz4jrcohh55ectexyd7gu

Synthesizing Efficient Dynamic Programming Algorithms [article]

Ruyi Ji, Tianran Zhu, Yingfei Xiong, Zhenjiang Hu
2022 arXiv   pre-print
MetHyl consists of a transformation system and efficient synthesis algorithms, where the former transforms a hylomorphism to an efficient dynamic programming algorithm via four synthesis tasks, and the  ...  The results show that MetHyl achieves exponential speed-ups on 97.3% tasks and the time complexity of the standard solutions on 70.3% tasks with an average time cost of less than one minute.  ...  Most of them are manual or semi-automated.  ... 
arXiv:2202.12208v1 fatcat:skigzfludrfixflzbhtnss4jx4


2012 International Journal of Foundations of Computer Science  
Maxime Crochemore, Laura Giambruno: On-line construction of a small automaton for a finite set of words, pp. 15-28.  ...  For the suffixes of a text, we propose a modified construction that leads to an even smaller automaton.  ...  For instance Watson in [15] presented a semi-incremental algorithm for constructing minimal acyclic deterministic automata and Sgarbas et al. in [10] proposed an efficient algorithm to insert a word  ... 
doi:10.1142/s0129054112400138 fatcat:476qpih3jngrjnwfljz7v4f7vq

One-Level Prosodic Morphology [article]

Markus Walther
1999 arXiv   pre-print
The paper then presents implemented case studies of Ulwa construct state infixation, German hypocoristic truncation and Tagalog over-applying reduplication that illustrate the expressive power of this  ...  The non-finite-state copying aspect of reduplication is mapped to automata intersection, itself a non-finite-state operation.  ...  the minimization properties of automata containing repeat arcs are rather different from those of repeat-free automata as well.  ... 
arXiv:cs/9911011v1 fatcat:yhzkiz5vgne6hhqiztfhx7m3d4

Integration of Requirements Engineering and Test-Case Generation via OSLC

Bernhard K. Aichernig, Klaus Hormaier, Florian Lorber, Dejan Nickovic, Rupert Schlick, Didier Simoneau, Stefan Tiran
2014 2014 14th International Conference on Quality Software  
The framework preserves a fine grained traceability of informal and formal requirements, test cases and implementation models throughout every step of the workflow.  ...  We present a requirement-centered analysis and testing framework that integrates methods and tools for capturing and formalizing textual customer requirements, analyzing requirements consistency, generating  ...  timed automata) to a textual representation.  ... 
doi:10.1109/qsic.2014.13 dblp:conf/qsic/AichernigHLNSST14 fatcat:vgz43xlej5ce7dm5jiz6qzo5ru

Cellular Automata: Reversibility, Semi-reversibility and Randomness [article]

Kamalika Bhattacharjee
2019 arXiv   pre-print
This dissertation targets to construct a bridge between these two cases. To do so, reversibility of CAs is redefined and the notion of semi-reversible CAs is introduced.  ...  This dissertation also explores CAs as source of randomness and build pseudo-random number generators (PRNGs) based on CAs.  ...  There are many interesting results regarding reversibility of 1-dimensional CAs, over a given local map R, for the first three cases: Theorem 4.1 : The following statements hold for 1-dimensional infinite  ... 
arXiv:1911.03609v1 fatcat:522xu4usonfdbguuckurl4eeqi

Basic Operations for Generating Behavioral Mutants

Fevzi Belli, Christof J. Budnik, W. Eric Wong
2006 Second Workshop on Mutation Analysis (Mutation 2006 - ISSRE Workshops 2006)  
This paper attempts to subsume the existing great variety of mutation operations to two basic operations, insertion and omission and their combinations.  ...  A case study applies the approach to these models for generating mutants of different features and compares the fault detection capacity of the mutants generated.  ...  [8] also includes an algorithm to construct CESs which represent minimal walks (A walk is a complete ElS that starts in [ and terminates in ]).  ... 
doi:10.1109/mutation.2006.2 fatcat:7qnv23k4vjg6vi4bes25k2ogqq
« Previous Showing results 1 — 15 out of 765 results