Thematische Bibliographien / Reduction of automata

Inhaltsverzeichnis

Zeitschriftenartikel
Dissertationen
Bücher
Buchteile
Konferenzberichte
Berichte der Organisationen

Auswahl der wissenschaftlichen Literatur zum Thema „Reduction of automata“

Autor: Grafiati

Veröffentlicht am 28. Juni 2021

Zuletzt aktualisiert am 1. Februar 2022

Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an

Wählen Sie eine Art der Quelle aus:

Machen Sie sich mit den Listen der aktuellen Artikel, Bücher, Dissertationen, Berichten und anderer wissenschaftlichen Quellen zum Thema "Reduction of automata" bekannt.

Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.

Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.

Zeitschriftenartikel zum Thema "Reduction of automata"

Kilibarda, Goran. „On reduction of automata in labyrinths“. Publications de l'Institut Math?matique (Belgrade) 101, Nr. 115 (2017): 47–63. http://dx.doi.org/10.2298/pim1715047k.

Der volle Inhalt der Quelle

Annotation:

It is shown that every automaton acceptable for rectangular labyrinths can be reduced to an automaton that behaves according to either the left-hand rule or the right-hand rule, or does not move at all, in every plane rectangular labyrinth without leaves. This enables us to approach certain fundamental problems of the theory of automata in labyrinths in a quite different way.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Sargolzaei, A., K. K. Yen, K. Zeng, S. M. A. Motahari und S. Noei. „Impulse Image Noise Reduction Using Fuzzy-Cellular Automata Method“. International Journal of Computer and Electrical Engineering 6, Nr. 2 (2014): 191–95. http://dx.doi.org/10.7763/ijcee.2014.v6.820.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

JURDZIŃSKI, TOMASZ, und FRIEDRICH OTTO. „SHRINKING RESTARTING AUTOMATA“. International Journal of Foundations of Computer Science 18, Nr. 02 (April 2007): 361–85. http://dx.doi.org/10.1142/s0129054107004723.

Der volle Inhalt der Quelle

Annotation:

Restarting automata were introduced by Jančar et al. to model the so-called analysis by reduction. A computation of a restarting automaton consists of a sequence of cycles such that in each cycle the automaton performs exactly one rewrite step, which replaces a small part of the tape content by another, even shorter word. Here we consider a natural generalization of this model, called shrinking restarting automaton, where we only require that there exists a weight function such that each rewrite step decreases the weight of the tape content with respect to that function. While it is still unknown whether the two most general types of one-way restarting automata, the RWW-automaton and the RRWW-automaton, differ in their expressive power, we will see that the classes of languages accepted by the shrinking RWW-automaton and the shrinking RRWW-automaton coincide. As a consequence of our proof, it turns out that there exists a reduction by morphisms from the language class [Formula: see text] to the class [Formula: see text]. Further, we will see that the shrinking restarting automaton is a rather robust model of computation. Finally, we will relate shrinking RRWW-automata to finite-change automata. This will lead to some new insights into the relationships between the classes of languages characterized by (shrinking) restarting automata and some well-known time and space complexity classes.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

FIGUEIRA, DIEGO, PIOTR HOFMAN und SŁAWOMIR LASOTA. „Relating timed and register automata“. Mathematical Structures in Computer Science 26, Nr. 6 (05.12.2014): 993–1021. http://dx.doi.org/10.1017/s0960129514000322.

Der volle Inhalt der Quelle

Annotation:

Timed and register automata are well-known models of computation over timed and data words, respectively. The former has clocks that allow to test the lapse of time between two events, whilst the latter includes registers that can store data values for later comparison. Although these two models behave differently in appearance, several decision problems have the same (un)decidability and complexity results for both models. As a prominent example, emptiness is decidable for alternating automata with one clock or register, both with non-primitive recursive complexity. This is not by chance.This work confirms that there is indeed a tight relationship between the two models. We show that a run of a timed automaton can be simulated by a register automaton over ordered data domain, and conversely that a run of a register automaton can be simulated by a timed automaton. These are exponential time reductions hold both in the finite and infinite words settings. Our results allow to transfer decidability results back and forth between these two kinds of models, as well complexity results modulo an exponential time reduction. We justify the usefulness of these reductions by obtaining new results on register automata.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Mutyalamma, G., K. Komali und G. Pushpa. „A Novel Algorithm for Reduction of Non-Deterministic Finite Automata“. International Journal of Trend in Scientific Research and Development Volume-2, Issue-1 (31.12.2017): 1341–46. http://dx.doi.org/10.31142/ijtsrd8233.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Timmer, Mark, Joost-Pieter Katoen, Jaco van de Pol und Mariëlle Stoelinga. „Confluence reduction for Markov automata“. Theoretical Computer Science 655 (Dezember 2016): 193–219. http://dx.doi.org/10.1016/j.tcs.2016.01.017.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Dauchet, Max, Anne-Cécile Caron und Jean-Luc Coquidé. „Automata for Reduction Properties Solving“. Journal of Symbolic Computation 20, Nr. 2 (August 1995): 215–33. http://dx.doi.org/10.1006/jsco.1995.1048.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Kleinert, Tobias, Frederik Zahn und Veit Hagenmeyer. „On complexity reduction of the discrete-event subsystem of Flat Hybrid Automata for control design“. at - Automatisierungstechnik 68, Nr. 7 (26.07.2020): 529–40. http://dx.doi.org/10.1515/auto-2020-0061.

Der volle Inhalt der Quelle

Annotation:

AbstractThe class of hybrid systems describes most technical systems in great detail. However, the respective models and their behavior tend to be very complex. Recently, a new subclass of hybrid automata has been introduced, the Flat Hybrid Automata (FHA) that relies on the concepts of differential flatness for the continuous parts, and strongly connected automaton graphs for the discrete event part, in order to deal with the complexity from a design perspective. Therefore, we introduce in the present paper an approach to reduce the automaton graph of an FHA in a systematic way by removing edges from the adjacency matrix. The main contribution of the paper is twofold: Firstly, based on practical considerations we develop a heuristic algorithm to reduce the automaton graph. Secondly, we present possible ways to include knowledge about the system in the reduction.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Tamm, Hellis, Matti Nykänen und Esko Ukkonen. „On size reduction techniques for multitape automata“. Theoretical Computer Science 363, Nr. 2 (Oktober 2006): 234–46. http://dx.doi.org/10.1016/j.tcs.2006.07.027.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Peeva, Ketty G. „Behaviour, reduction and minimization of finite -automata“. Fuzzy Sets and Systems 28, Nr. 2 (November 1988): 171–81. http://dx.doi.org/10.1016/0165-0114(88)90198-4.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Mehr Quellen

Dissertationen zum Thema "Reduction of automata"

Turcel, Matej. „Minimalizace automatů s jednoduchými čítači“. Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2021. http://www.nusl.cz/ntk/nusl-445565.

Der volle Inhalt der Quelle

Annotation:

Táto práca sa zaoberá redukciou veľkosti tzv. čítačových automatov. Čítačové automaty rozširujú klasické konečné automaty o čítače s obmedzeným rozsahom hodnôt. Umožňujú tým efektívne spracovať napr. regulárne výrazy s opakovaním: a{5,10}. V tejto práci sa zaoberáme reláciou simulácie v čítačových automatoch, pomocou ktorej sme schopní zredukovať ich veľkosť. Opierame sa pritom o klasickú simuláciu v konečných automatoch, ktorú netriviálnym spôsobom rozširujeme na čítačové automaty. Kľúčovým rozdielom je nutnosť simulovať okrem stavov taktiež čítače. Za týmto účelom zavádzame nový koncept parametrizovanej relácie simulácie, a navrhujeme metódy výpočtu tejto relácie a redukcie veľkosti čítačových automatov pomocou nej. Navrhnuté metódy sú tiež implementované a je vyhodnotená ich efektivita.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Kaati, Lisa. „Reduction Techniques for Finite (Tree) Automata“. Doctoral thesis, Uppsala universitet, Avdelningen för datorteknik, 2008. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-9330.

Der volle Inhalt der Quelle

Annotation:

Finite automata appear in almost every branch of computer science, for example in model checking, in natural language processing and in database theory. In many applications where finite automata occur, it is highly desirable to deal with automata that are as small as possible, in order to save memory as well as excecution time. Deterministic finite automata (DFAs) can be minimized efficiently, i.e., a DFA can be converted to an equivalent DFA that has a minimal number of states. This is not the case for non-deterministic finite automata (NFAs). To minimize an NFA we need to compute the corresponding DFA using subset construction and minimize the resulting automaton. However, subset construction may lead to an exponential blow-up in the size of the automaton and therefore even if the minimal DFA may be small, it might not be feasible to compute it in practice since we need to perform the expensive subset construction. To aviod subset construction we can reduce the size of an NFA using heuristic methods. This can be done by identifying and collapsing states that are equal with respect to some suitable equivalence relation that preserves the language of the automaton. The choice of an equivalence relation is a trade-off between the desired amount of reduction and the computation time since the coarser a relation is, the more expensive it is to compute. This way we obtain a reduction method for NFAs that is useful in practice. In this thesis we address the problem of reducing the size of non-deterministic automata. We consider two different computation models: finite tree automata and finite automata. Finite automata can be seen as a special case of finite tree automata and all of the previously mentioned results concerning finite automata are applicable to tree automata as well. For non-deterministic bottom-up tree automata, we present a broad spectrum of different relations that can be used to reduce their size. The relations differ in their computational complexity and reduction capabilities. We also provide efficient algorithms to compute the relations where we translate the problem of computing a given relation on a tree automaton to the problem of computing the relation on a finite automaton. For finite automata, we have extended and re-formulated two algorithms for computing bisimulation and simulation on transition systems to operate on finite automata with alphabets. In particular, we consider a model of automata where the labels are encoded symbolically and we provide an algorithm for computing bisimulation on this partial symbolic encoding.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Almeida, Ricardo Manuel de Oliveira. „Efficient algorithms for hard problems in nondeterministic tree automata“. Thesis, University of Edinburgh, 2017. http://hdl.handle.net/1842/28794.

Der volle Inhalt der Quelle

Annotation:

We present PTIME language-preserving techniques for the reduction of non-deterministic tree automata, both for the case of finite trees and for infinite trees. Our techniques are based on new transition removing and state merging results, which rely on binary relations that compare the downward and upward behaviours of states in the automaton. We use downward/upward simulation preorders and the more general but EXPTIME-complete trace inclusion relations, for which we introduce good under-approximations computable in polynomial time. We provide a complete picture of combinations of downward and upward simulation/trace inclusions which can be used in our reduction techniques. We define an algorithm that puts together all the reduction results found for finite trees, and implemented it under the name minotaut, a tool built on top of the well-known tree automata library libvata. We tested minotaut on large collections of automata from program verification provenience, as well as on different classes of randomly generated automata. Our algorithm yields substantially smaller and sparser automata than all previously known reduction techniques, and it is still fast enough to handle large instances. Taking reduction of automata on finite trees one step further, we then introduce saturation, a technique that consists of adding new transitions to an automaton while preserving its language. We implemented this technique on minotaut and we show how it can make subsequent state-merge and transition-removal operations more effective. Thus we obtain a PTIME algorithm that reduces the number of states of tree automata even more than before. Additionally, we explore how minotaut alone can play an important role when performing hard operations like complementation, allowing to obtain smaller complement automata and at lower computation times overall. We then show how saturation can extend this contribution even further. An overview of the tool, highlighting some of its implementation features, is presented as well.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Charvát, Lucie. „Deep Pushdown Automata and Their Restricted Versions“. Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2017. http://www.nusl.cz/ntk/nusl-363840.

Der volle Inhalt der Quelle

Annotation:

Pro přirozené číslo n, n-expandovatelné hluboké zasobníkové automaty vždy obsahují maximálně n výskytů nevstupních symbolů v jejich zásobníku v průběhu jakékoli kompilace. Jako hlavní výsledek, tato práce demonstruje, že tyto automaty mají stejnou vyjadřovací sílu jako automaty s #, nacházející pouze na dně zásobníku, a jediným dalším nevstupním symbolem. Z tohoto závěru vyplývá nekonečná hierarchie jazyků přijímaných těmito automaty.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Carpi, Arturo. „Reduction et synchronisation d'automates non ambigus“. Paris 7, 1988. http://www.theses.fr/1988PA077025.

Der volle Inhalt der Quelle

Annotation:

La notion de reduction non ambigue d'automates non ambigus est introduite. Il est montre que, sous des hypotheses tres generales, pour toute reduction booleenne d'automates non ambigus il y a une reduction non ambigue entre les automates consideres. Il est aussi demontre qu'il y a une reduction entre des convenables automates non ambigus finis reconnaissants deux sous monoides libre si et seulement s'ils sont engendres par deux codes rationnels x et z tels que x est compose d'un code complet par z. Dans la derniere partie, le probleme de la synchronisation pour les automates non ambigus est etudie

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Havlena, Vojtěch. „Porovnávání jazyků a redukce automatů používaných při filtraci síťového provozu“. Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2017. http://www.nusl.cz/ntk/nusl-363849.

Der volle Inhalt der Quelle

Annotation:

The focus of this thesis is the comparison of languages and the reduction of automata used in network traffic monitoring. In this work, several approaches for approximate (language non-preserving) reduction of automata and comparison of their languages are proposed. The reductions are based on either under-approximating the languages of automata by pruning their states, or over-approximating the language by introducing new self-loops (and pruning redundant states later). The proposed approximate reduction methods and the proposed probabilistic distance utilize information from a network traffic. Formal guarantees with respect to a model of network traffic, represented using a probabilistic automaton are provided. The methods were implemented and evaluated on automata used in network traffic filtering.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Luukkainen, Matti. „A process algebraic reduction strategy for automata theoretic verification of untimed and timed concurrent systems“. Helsinki : University of Helsinki, 2003. http://ethesis.helsinki.fi/julkaisut/mat/tieto/vk/luukkainen/.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Malinowski, Janusz. „Algorithmes pour la synthèse et le model checking“. Thesis, Aix-Marseille, 2012. http://www.theses.fr/2012AIXM4780/document.

Der volle Inhalt der Quelle

Annotation:

Nous avons étudié dans cette thèse une approche discrète de la synthèse de contrôleurs pour les systèmes hybrides permettant la manipulation de dynamiques non-linéaires : les états sont regroupés dans une partition finie au prix d'une sur-approximation non déterministe de la relation de transition. Nous avons développé des algorithmes permettant de réduire l'explosion du nombre d'états due à la discrétisation en exploitant des propriétés des systèmes ODE. Ces algorithmes sont basés sur une approche hiérarchique du problème de la synthèse en le résolvant pour des sous problèmes et en utilisant ces résultats pour réduire l'espace d'états global. Nous avons aussi combiné des objectifs de vivacité et de sécurité pour s'approcher d'une stabilisation. Des résultats implémentés sur un prototype viennent montrer l'intérêt de cette approche.Pour la vérification, nous avons étudié le problème du model checking d'automates temporisés basé sur la résolution SAT. Nous avons exploré des solutions alternatives pour le codage des réductions SAT basées sur des exécutions parallèles de transitions indépendantes. Alors qu'une telle optimisation a déjà été étudiée pour les systèmes discrets, une approche intuitive pour les automates temporisés serait de considérer que des transitions en parallèle ont lieu au même instant (synchrones). Toutefois il est possible de relâcher cette condition et nous avons montré trois sémantiques différentes pour les séquences temporisées avec des transitions parallèles. Nous montrons la correction des sémantiques et décrivons des résultats expérimentaux réalisés avec notre prototype
We consider a discretization based approach to controller synthesis of hybrid systems that allows to handle non-linear dynamics. In such an approach, states are grouped together in a finite index partition at the price of a non-deterministic over approximation of the transition relation. The main contribution of this work is a technique to reduce the state explosion generated by the discretization: exploiting structural properties of ODE systems, we propose a hierarchical approach to the synthesis problem by solving it first for sub problems and using the results for state space reduction in the full problem. A secondary contribution concerns combined safety and liveness control objectives that approximate stabilization. Results implemented on a prototype show the benefit of this approach. For the verification, we study the model checking problem of timed automata based on SAT solving. Our work investigates alternative possibilities for coding the SAT reductions that are based on parallel executions of independent transitions. While such an optimization has been studied for discrete systems, its transposition to timed automata poses the question of what it means for timed transitions to be executed “in parallel”. The most obvious interpretation is that the transitions in parallel take place at the same time (synchronously). However, it is possible to relax this condition. On the whole, we define and analyse three different semantics of timed sequences with parallel transitions. We prove the correctness of the proposed semantics and report experimental results with a prototype implementation

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Schwartzmann, Benjamin. „Automatic X-Ray Parameter Analysis and Reduction“. Thesis, KTH, Ljud- och bildbehandling, 2011. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-55378.

Der volle Inhalt der Quelle

Annotation:

This thesis describes research in the area of parameter analysis for X-ray imaging. This work was performed at Philips Healthcare in Best (the Netherlands) as a nal project for the Master study at the Sound and Image Processing Laboratory at Kungliga Tekniska Hogskolan (KTH), Stockholm. The objective of this project is to provide methods for automatic parameter analysis and reduction for X-ray tuning. These methods can be used to reduce the amount of parameters involving in X-ray tuning. X-ray processing is performed via a black-box process and parameter analysis consists in looking at the impact on the resulting X-ray image. The visual quality of this image depends on parameter tuning. With a large number of parameters, analysing their visual impact directly is not feasible, which is why objective image quality (OIQ) assessment is used to get numerical results. Several image quality assessment models are reviewed leading to further research in the full-reference and no-reference model approaches. Both assessments are explored with investigation of four dierent full-reference metrics, namely the Peak-Signalto-Noise Ratio (PSNR), the Structural Similarity (SSIM), the Visual Information Fidelity (VIF) and one using wavelet properties that we have called Wavelet Method (WM), and three no-reference metrics: noise, contrast and sharpness. Search algorithms are used to get a set of parameters which give the same image quality (using OIQ) such that dimensionality reduction can be performed. Several search algorithms are reviewed from the simplest (looking at the function evaluations of all points) to the most sophisticated algorithms for global optimization (e.g. genetic algorithm). Depending on the function to optimize, dierent algorithms are used. Finding corrolated parameters, or parameters that have no impact on the image quality is the way to reduce the amount of parameters. Principal Composent Analysis (PCA) which is one of the most common method for dimensionality reduction is performed on the results of combination of OIQ and search algorithms. For each step of the project, we test the assessments or the algorithms on some examples to validate the used procedure. We will nally test all our methods with one IP function which acts like a real X-ray process. The results will enable us to see if parameter analysis and reduction is feasible.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Rioual, Jean-Luc. „The automatic control of boundary layer transition“. Thesis, University of Southampton, 1994. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.259625.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Mehr Quellen

Bücher zum Thema "Reduction of automata"

Langerhorst, Christina Theresia. Automated perimetry in glaucoma: Fluctuation behavior and general and local reduction of sensitivity. Amsterdam: Kugler Publications/Ghedini Editore, 1988.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

NATO Advanced Research Workshop on Modelling, Robustness, and Sensitivity Reduction in Control Systems (1986 Groningen, Netherlands). Modelling, robustness, and sensitivity reduction in control systems. Berlin: Springer-Verlag, 1987.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Ng, Kia, Atta Badii und Pierfrancesco Bellini, Hrsg. Axmedis 2006. Proceedings of the 2nd International Conference on Automated Production of Cross Media Content for Multi-channel Distribution. Volume for Workshops, Tutorials, Applications and Industrial (Leeds, UK, 13-15 December 2006). Florence: Firenze University Press, 2006. http://dx.doi.org/10.36253/88-8453-525-5.

Der volle Inhalt der Quelle

Annotation:

The AxMEDIS 2006 International Conference seeks to promote discussion and exchange of ideas amongst researchers, practitioners, developers and users of tools, technology transfer experts, and project managers. This conference series brings together a variety of participants from the academic, business and industrial worlds, to address the emergent research and technological issues as well as the engineering and commercial challenges of large-scale collaborative production and distribution of media as experienced by the associated industrial sectors in the emergent media markets. The conference focuses on the outstanding problems to be resolved in the new age of media computing including cross-domain production, protection, representation, formatting, aggregation, workflow, distribution and business and transaction models i.e. all lifecycle aspects of the new media value chain management. Additionally it explores the integration of new forms of content, content management systems and distribution chains, with particular emphasis on cost structures re-engineering to support the reduction of costs and the integration of innovative solutions to facilitate complex creative collaboration in cross-domain media production with benefit realisation to all stakeholders through optimised rights-protective multichannel distribution.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Automated reduction of data from images and holograms. Moffett Field, Calif: National Aeronautics and Space Administration, Ames Research Center, 1987.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Anderson, Brian D. O. Model Reduction for Control System Design. Springer, 2012.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Automated problem scheduling and reduction of synchronization delay effects. Hampton, Va: National Aeronautics and Space Administration, Langley Research Center, 1987.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Curtain, Ruth F. Modelling Robustness, Sensitivity Reduction in Control Systems. Springer, 1987.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Facility, Dryden Flight Research, Hrsg. Model reduction for control system design. Edwards, Calif: National Aeronautics and Space Administration, Ames Research Center, Dryden Flight Research Facility, 1985.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Jia, Zuxin. Critical evaluation of Ouyang's model reduction method. 1989.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Curtain, Ruth F. Modelling, Robustness and Sensitivity Reduction in Control Systems. Springer, 2012.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Mehr Quellen

Buchteile zum Thema "Reduction of automata"

Kozen, Dexter C. „Reduction“. In Automata and Computability, 239–44. New York, NY: Springer New York, 1997. http://dx.doi.org/10.1007/978-1-4612-1844-9_41.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Harrow, Aram W., Ashley Montanaro und Anthony J. Short. „Limitations on Quantum Dimensionality Reduction“. In Automata, Languages and Programming, 86–97. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-22006-7_8.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Tamm, Hellis, Matti Nykänen und Esko Ukkonen. „Size Reduction of Multitape Automata“. In Implementation and Application of Automata, 307–18. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11605157_26.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Tamm, Hellis, Matti Nykänen und Esko Ukkonen. „Size Reduction of Multitape Automata“. In Implementation and Application of Automata, 329–30. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/978-3-540-30500-2_39.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Simon, Klaus. „On minimum flow and transitive reduction“. In Automata, Languages and Programming, 535–46. Berlin, Heidelberg: Springer Berlin Heidelberg, 1988. http://dx.doi.org/10.1007/3-540-19488-6_140.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Khasidashvili, Zurab, und John Glauert. „The geometry of orthogonal reduction spaces“. In Automata, Languages and Programming, 649–59. Berlin, Heidelberg: Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/3-540-63165-8_219.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Almeida, Ricardo, Lukáš Holík und Richard Mayr. „Reduction of Nondeterministic Tree Automata“. In Tools and Algorithms for the Construction and Analysis of Systems, 717–35. Berlin, Heidelberg: Springer Berlin Heidelberg, 2016. http://dx.doi.org/10.1007/978-3-662-49674-9_46.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Timmer, Mark, Jaco van de Pol und Mariëlle I. A. Stoelinga. „Confluence Reduction for Markov Automata“. In Lecture Notes in Computer Science, 243–57. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-40229-6_17.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Schnorr, C. P. „A more efficient algorithm for lattice basis reduction“. In Automata, Languages and Programming, 359–69. Berlin, Heidelberg: Springer Berlin Heidelberg, 1986. http://dx.doi.org/10.1007/3-540-16761-7_85.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Chekuri, Chandra, und Nitish Korula. „A Graph Reduction Step Preserving Element-Connectivity and Applications“. In Automata, Languages and Programming, 254–65. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-02927-1_22.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Konferenzberichte zum Thema "Reduction of automata"

Sharma, Arpit, und Joost-Pieter Katoen. „Layered Reduction for Abstract Probabilistic Automata“. In 2014 14th International Conference on Application of Concurrency to System Design. IEEE, 2014. http://dx.doi.org/10.1109/acsd.2014.10.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Bishnoi, Bhupesh, Diwakar Agrawal, Vikas Nandal, Akshay Salimath und Bahniman Ghosh. „Frequency reduction in Quantum dot cellular automata“. In 2012 10th IEEE International Conference on Semiconductor Electronics (ICSE). IEEE, 2012. http://dx.doi.org/10.1109/smelec.2012.6417192.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Badhiye, Sagarkumar S., und P. N. Chatur. „Range Automata for Alphabetic Time Series Dimensionality Reduction“. In 2018 First International Conference on Secure Cyber Computing and Communication (ICSCCC). IEEE, 2018. http://dx.doi.org/10.1109/icsccc.2018.8703206.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Labbe, Sebastien, Jean-Pierre Gallois und Marc Pouzet. „Slicing Communicating Automata Specifications for Efficient Model Reduction“. In 2007 Australian Software Engineering Conference (ASWEC'07). IEEE, 2007. http://dx.doi.org/10.1109/aswec.2007.43.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Yalcinkaya, Beyazit, und Ebru Aydin Gol. „Clock Reduction in Timed Automata While Preserving Design Parameters“. In 2019 IEEE/ACM 7th International Conference on Formal Methods in Software Engineering (FormaliSE). IEEE, 2019. http://dx.doi.org/10.1109/formalise.2019.00010.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Peldek, Serkan, und Yasar Becerikli. „Use of multiple attractor cellular automata for dimension reduction“. In 2017 International Conference on Computer Science and Engineering (UBMK). IEEE, 2017. http://dx.doi.org/10.1109/ubmk.2017.8093528.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Tripathi, Alka, und Ranjeet Kaur. „A review of state minimization and state reduction techniques in fuzzy automata“. In EMERGING TRENDS IN MATHEMATICAL SCIENCES AND ITS APPLICATIONS: Proceedings of the 3rd International Conference on Recent Advances in Mathematical Sciences and its Applications (RAMSA-2019). Author(s), 2019. http://dx.doi.org/10.1063/1.5086655.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Tomar, A. S., A. K. Garg und G. S. Tomar. „Reduction in Cells of Quantum-Dot Cellular Automata in Perspective of NOT Gate“. In 2010 International Conference on Computational Intelligence and Communication Networks (CICN 2010). IEEE, 2010. http://dx.doi.org/10.1109/cicn.2010.112.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Zhou, Xiaoyu, Qian Li und Jianhua Zhao. „A New Approach of Partial Order Reduction Technique for Parallel Timed Automata Model Checking“. In 2012 International Conference on Software Security and Reliability Companion. IEEE, 2012. http://dx.doi.org/10.1109/sere-c.2012.45.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Wujie Chao, Yongmei Gan, Zhaoan Wang und W. M. Wonham. „Representation of supervisory controls using state tree structures, binary decision diagrams, automata, and supervisor reduction“. In 2012 24th Chinese Control and Decision Conference (CCDC). IEEE, 2012. http://dx.doi.org/10.1109/ccdc.2012.6242921.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Berichte der Organisationen zum Thema "Reduction of automata"

White, D., M. Stowell und K. Lange. Automatic Complexity Reduction. Office of Scientific and Technical Information (OSTI), November 2014. http://dx.doi.org/10.2172/1179112.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Fowler, Bruce W., und William C. McCorkle. Automated Target Recognition and Fratricide Reduction. Fort Belvoir, VA: Defense Technical Information Center, März 2006. http://dx.doi.org/10.21236/ada444496.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Mosher, Scott W., Aaron M. Bevill, Seth R. Johnson, Ahmad M. Ibrahim, Charles R. Daily, Thomas M. Evans, John C. Wagner und Jeffrey O. Johnson. ADVANTG An Automated Variance Reduction Parameter Generator. Office of Scientific and Technical Information (OSTI), November 2013. http://dx.doi.org/10.2172/1105937.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Anastasiou, C. Automatic Integral Reduction for Higher Order Perturbative Calculations. Office of Scientific and Technical Information (OSTI), Juni 2004. http://dx.doi.org/10.2172/826953.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Mosher, Scott W., Seth R. Johnson, Aaron M. Bevill, Ahmad M. Ibrahim, Charles R. Daily, Thomas M. Evans, John C. Wagner, Jeffrey O. Johnson und Robert E. Grove. ADVANTG An Automated Variance Reduction Parameter Generator, Rev. 1. Office of Scientific and Technical Information (OSTI), August 2015. http://dx.doi.org/10.2172/1210162.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Bratvold, T. E. Validation and verification of radiological control automated data reduction program. Office of Scientific and Technical Information (OSTI), August 1997. http://dx.doi.org/10.2172/313173.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Author, Not Given. Automated Boiler Combustion Controls for Emission Reduction and Efficiency Improvement. Office of Scientific and Technical Information (OSTI), Dezember 1998. http://dx.doi.org/10.2172/2022.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Turner, S. A. Automatic variance reduction for Monte Carlo simulations via the local importance function transform. Office of Scientific and Technical Information (OSTI), Februar 1996. http://dx.doi.org/10.2172/212579.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

West, J. Automated boiler combustion controls for emission reduction and efficiency improvement. Quarterly report, February 1--May 15, 1995. Office of Scientific and Technical Information (OSTI), Dezember 1995. http://dx.doi.org/10.2172/656649.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Northrup, Jearldine I., Joyce C. Baird, Nona Y. Chan, James H. Johnson und Hannon Maase. Pollution Reduction and Emission Prevention Automated Rule-based Expert (PREPARE) System for Operation and Maintenance of Pollution Control Equipment. Fort Belvoir, VA: Defense Technical Information Center, November 1999. http://dx.doi.org/10.21236/ada371877.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Wir bieten Rabatte auf alle Premium-Pläne für Autoren, deren Werke in thematische Literatursammlungen aufgenommen wurden. Kontaktieren Sie uns, um einen einzigartigen Promo-Code zu erhalten!