Works matching DE "SEQUENTIAL machine theory"

Results: 413

Algoritmo basado en autómatas finitos para la obtención de óptimos globales en problemas combinatorios.

Published in:

Ingeniería y Desarrollo, 2009, n. 25, p. 99

By:

Niño, Elías D.;
Ardila, Carlos J.

Publication type:

Article

Towards intrinsically universal asynchronous CA.

Published in:

Natural Computing, 2013, v. 12, n. 4, p. 539, doi. 10.1007/s11047-013-9388-3

By:

Worsch, Thomas

Publication type:

Article

<i>m</i>-Asynchronous cellular automata: from fairness to quasi-fairness.

Published in:

Natural Computing, 2013, v. 12, n. 4, p. 561, doi. 10.1007/s11047-013-9386-5

By:

Dennunzio, Alberto;
Formenti, Enrico;
Manzoni, Luca;
Mauri, Giancarlo

Publication type:

Article

Computing maximal Kleene closures that are embeddable in a given subword-closed language.

Published in:

Natural Computing, 2013, v. 12, n. 2, p. 211, doi. 10.1007/s11047-013-9364-y

By:

Konstantinidis, Stavros;
Santean, Nicolae

Publication type:

Article

Networks of evolutionary processors: computationally complete normal forms.

Published in:

Natural Computing, 2012, v. 11, n. 4, p. 595, doi. 10.1007/s11047-012-9331-z

By:

Dassow, Jürgen;
Manea, Florin;
Truthe, Bianca

Publication type:

Article

Cellular automata-based systems with fault-tolerance.

Published in:

Natural Computing, 2012, v. 11, n. 4, p. 673, doi. 10.1007/s11047-012-9333-x

By:

Žaloudek, Luděk;
Sekanina, Lukáš

Publication type:

Article

Conserved quantities in discrete dynamics: what can be recovered from Noether's theorem, how, and why?

Published in:

Natural Computing, 2012, v. 11, n. 4, p. 565, doi. 10.1007/s11047-012-9336-7

By:

Capobianco, Silvio;
Toffoli, Tommaso

Publication type:

Article

Probing robustness of cellular automata through variations of asynchronous updating.

Published in:

Natural Computing, 2012, v. 11, n. 4, p. 553, doi. 10.1007/s11047-012-9340-y

By:

Bouré, Olivier;
Fatès, Nazim;
Chevrier, Vincent

Publication type:

Article

Grids and universal computations on one-dimensional cellular automata.

Published in:

Natural Computing, 2012, v. 11, n. 2, p. 303, doi. 10.1007/s11047-012-9312-2

By:

Yunès, Jean-Baptiste

Publication type:

Article

A study on learning robustness using asynchronous 1D cellular automata rules.

Published in:

Natural Computing, 2012, v. 11, n. 2, p. 289, doi. 10.1007/s11047-012-9311-3

By:

Vanneschi, Leonardo;
Mauri, Giancarlo

Publication type:

Article

Asynchronous cellular automata and dynamical properties.

Published in:

Natural Computing, 2012, v. 11, n. 2, p. 269, doi. 10.1007/s11047-012-9308-y

By:

Manzoni, Luca

Publication type:

Article

An analysis of different types and effects of asynchronicity in cellular automata update schemes.

Published in:

Natural Computing, 2012, v. 11, n. 2, p. 277, doi. 10.1007/s11047-012-9310-4

By:

Bandini, Stefania;
Bonomi, Andrea;
Vizzari, Giuseppe

Publication type:

Article

Quantum computation with write-only memory.

Published in:

Natural Computing, 2012, v. 11, n. 1, p. 81, doi. 10.1007/s11047-011-9270-0

By:

Yakaryılmaz, Abuzer;
Freivalds, Rūsiņš;
Say, A.;
Agadzanyan, Ruben

Publication type:

Article

Partitioned quantum cellular automata are intrinsically universal.

Published in:

Natural Computing, 2012, v. 11, n. 1, p. 13, doi. 10.1007/s11047-011-9277-6

By:

Arrighi, Pablo;
Grattage, Jonathan

Publication type:

Article

Automata and processes on multisets of communicating objects.

Published in:

Natural Computing, 2010, v. 9, n. 4, p. 865, doi. 10.1007/s11047-010-9206-0

By:

Yang, Linmin;
Wang, Yong;
Dang, Zhe

Publication type:

Article

Decreasing Computational Time of Urban Cellular Automata Through Model Portability.

Published in:

GeoInformatica, 2006, v. 10, n. 2, p. 197, doi. 10.1007/s10707-006-7579-0

By:

Dietzel, Charles;
Clarke, Keith

Publication type:

Article

Abstract regular (tree) model checking.

Published in:

International Journal on Software Tools for Technology Transfer, 2012, v. 14, n. 2, p. 167, doi. 10.1007/s10009-011-0205-y

By:

Bouajjani, Ahmed;
Habermehl, Peter;
Rogalewicz, Adam;
Vojnar, Tomáš

Publication type:

Article

On the expressiveness of MTL in the pointwise and continuous semantics.

Published in:

International Journal on Software Tools for Technology Transfer, 2007, v. 9, n. 1, p. 1, doi. 10.1007/s10009-005-0214-9

By:

D’Souza, Deepak;
Prabhakar, Pavithra

Publication type:

Article

Stationary ensembles in threshold networks.

Published in:

Automation & Remote Control, 2017, v. 78, n. 3, p. 475, doi. 10.1134/S0005117917030080

By:

Kuznetsov, O.

Publication type:

Article

A neural network algorithm for servicing jobs with sequential and parallel machines.

Published in:

Automation & Remote Control, 2014, v. 75, n. 7, p. 1203, doi. 10.1134/S0005117914070030

By:

Gholami, O.;
Sotskov, Yu.

Publication type:

Article

Methods of constructing universal tests for finite-state automata.

Published in:

Automation & Remote Control, 2005, v. 66, n. 1, p. 139, doi. 10.1007/s10513-005-0014-4

By:

Tverdokhlebov, V.

Publication type:

Article

Potentialities of Physical Realization of Cellular Automata with Remote Connections and Group Operations.

Published in:

Automation & Remote Control, 2004, v. 65, n. 8, p. 1328, doi. 10.1023/B:AURC.0000038733.75157.da

By:

Stetsyura, G. G.

Publication type:

Article

A correspondence between a class of monoids and self-similar group actions I.

Published in:

Semigroup Forum, 2008, v. 76, n. 3, p. 489, doi. 10.1007/s00233-008-9052-x

By:

Lawson, Mark V.

Publication type:

Article

Some Key Problems on Finite Semigroups.

Published in:

Semigroup Forum, 2002, v. 64, n. 2, p. 159, doi. 10.1007/s002330010098

By:

Almeida, Jorge

Publication type:

Article

Maximal Temporal Period of a Periodic Solution Generated by a One-Dimensional Cellular Automaton.

Published in:

Complex Systems, 2021, v. 30, n. 3, p. 239, doi. 10.25088/ComplexSystems.30.3.239

By:

Gravner, Janko;
Xiaochen Liu

Publication type:

Article

On Modal μ-Calculus and Non-Well-Founded Set Theory.

Published in:

Journal of Philosophical Logic, 2004, v. 33, n. 4, p. 343, doi. 10.1023/B:LOGI.0000036771.59434.71

By:

Alberucci, Luca;
Salipante, Vincenzo

Publication type:

Article

A topological classification of D-dimensional cellular automata.

Published in:

Dynamical Systems: An International Journal, 2009, v. 24, n. 1, p. 45, doi. 10.1080/14689360802436961

By:

Gamber Burkhead, Emily

Publication type:

Article

Dynamic Reconfiguration Technology for CNS System of Civil Aircratf.

Published in:

Telecommunication Engineering, 2014, v. 54, n. 6, p. 700, doi. 10.3969/j.issn.1001-893x.2014.06.002

By:

TANG Fa-rong;
LIU Yu

Publication type:

Article

On α − ν-products of automata.

Published in:

Acta Informatica, 2011, v. 48, n. 7/8, p. 397, doi. 10.1007/s00236-011-0143-x

By:

Dömösi, Pál;
Maróti, György

Publication type:

Article

Multi-letter quantum finite automata: decidability of the equivalence and minimization of states.

Published in:

Acta Informatica, 2011, v. 48, n. 5/6, p. 271, doi. 10.1007/s00236-011-0139-6

By:

Qiu, Daowen;
Li, Lvzhou;
Zou, Xiangfu;
Mateus, Paulo;
Gruska, Jozef

Publication type:

Article

String Assembling Systems.

Published in:

RAIRO - Theoretical Informatics & Applications, 2012, v. 46, n. 4, p. 593, doi. 10.1051/ita/2012020

By:

Kutrib, Martin;
Wendlandt, Matthias

Publication type:

Article

ON CONTEXT-FREE REWRITING WITH A SIMPLE RESTRICTION AND ITS COMPUTATIONAL COMPLETENESS.

Published in:

RAIRO - Theoretical Informatics & Applications, 2009, v. 43, n. 2, p. 365, doi. 10.1051/ita/2009002

By:

Masopust, Tomáš;
Meduna, Alexander

Publication type:

Article

HIGHLY UNDECIDABLE PROBLEMS FOR INFINITE COMPUTATIONS.

Published in:

RAIRO - Theoretical Informatics & Applications, 2009, v. 43, n. 2, p. 339, doi. 10.1051/ita/2009001

By:

Finkel, Olivier

Publication type:

Article

TREE AUTOMATA AND AUTOMATA ON LINEAR ORDERINGS.

Published in:

RAIRO - Theoretical Informatics & Applications, 2009, v. 43, n. 2, p. 321, doi. 10.1051/ita/2009009

By:

Véronique Bruyère;
Carton, Olivier;
Sénizergues, Géraud

Publication type:

Article

MINIMAL NFA AND BIRFSA LANGUAGES.

Published in:

RAIRO - Theoretical Informatics & Applications, 2009, v. 43, n. 2, p. 221, doi. 10.1051/ita:2008022

By:

Latteux, Michel;
Roos, Yves;
Terlutte, Alain

Publication type:

Article

Learning of Partial Languages.

Published in:

Engineering Letters, 2007, v. 14, n. 2, p. 72

By:

Sasikala, K.;
Dare, V. R.;
Thomas, D. G.

Publication type:

Article

A VMM-based intrusion prevention system in cloud computing environment.

Published in:

Journal of Supercomputing, 2013, v. 66, n. 3, p. 1133, doi. 10.1007/s11227-011-0608-2

By:

Jin, Hai;
Xiang, Guofu;
Zou, Deqing;
Wu, Song;
Zhao, Feng;
Li, Min;
Zheng, Weide

Publication type:

Article

The number of DFAs for a given spanning tree.

Published in:

Journal of Supercomputing, 2013, v. 65, n. 2, p. 710, doi. 10.1007/s11227-013-0957-0

By:

Babaali, P.;
Carta-Gerardino, E.;
Knaplund, C.

Publication type:

Article

Defining and Providing Coverage for Assertion-Based Dynamic Verification.

Published in:

Journal of Electronic Testing, 2010, v. 26, n. 2, p. 211, doi. 10.1007/s10836-010-5148-9

By:

Tong, Jason G.;
Boulé, Marc;
Zilic, Zeljko

Publication type:

Article

Detecting Multiple Faults in One-Dimensional Arrays of Reversible QCA Gates.

Published in:

Journal of Electronic Testing, 2009, v. 25, n. 1, p. 39, doi. 10.1007/s10836-008-5078-y

By:

Xiaojun Ma;
Jing Huang;
Cecilia Metra;
Fabrizio Lombardi

Publication type:

Article

Reversible Gates and Testability of One Dimensional Arrays of Molecular QCA.

Published in:

Journal of Electronic Testing, 2008, v. 24, n. 1-3, p. 297, doi. 10.1007/s10836-007-5042-2

By:

X. Ma;
J. Huang;
C. Metra;
F. Lombardi

Publication type:

Article

Digital redesign of analog controllers based on minimizing integral of squared errors.

Published in:

Optimal Control - Applications & Methods, 2003, v. 24, n. 1, p. 1

By:

Chyi Hwang;
Fang-Pi Chang;
Jyh-Haur Hwang

Publication type:

Article

Technique of traces in solving the equivalence problem in algebraic program models.

Published in:

Cybernetics & Systems Analysis, 2009, v. 45, n. 5, p. 692, doi. 10.1007/s10559-009-9139-8

By:

Podlovchenko, R. I.

Publication type:

Article

A method of specification of fractal sets.

Published in:

Cybernetics & Systems Analysis, 2009, v. 45, n. 3, p. 365, doi. 10.1007/s10559-009-9117-1

By:

Lisovik, L.;
Karnaukh, T.

Publication type:

Article

Theory of general linear automata.

Published in:

Cybernetics & Systems Analysis, 2009, v. 45, n. 1, p. 8, doi. 10.1007/s10559-009-9082-8

By:

Rystsov, I. K.

Publication type:

Article

ON THE COMPLEXITY OF COORDINATION.

Published in:

Mathematics of Operations Research, 2003, v. 28, n. 1, p. 127, doi. 10.1287/moor.28.1.127.14257

By:

Gossner, Olivier;
Hernández, Penélope

Publication type:

Article

A SAND approach based on cellular computation models for analysis and optimization.

Published in:

Engineering Optimization, 2007, v. 39, n. 4, p. 381, doi. 10.1080/03052150601146255

By:

Canyurt, O. E.;
Hajela, P.

Publication type:

Article

A Syntactical Proof of the Canonical Reactivity Form for Past Linear Temporal Logic.

Published in:

Journal of Logic & Computation, 2008, v. 18, n. 4, p. 615

By:

GUELEV, DIMITAR P.

Publication type:

Article

Speculative Block Reuse in GPGPU.

Published in:

International Journal of Advanced Research in Computer Science, 2015, v. 6, n. 5, p. 24

By:

Suma S.;
Gopalan, N. P.

Publication type:

Article

New heuristics for conversion of Deterministic finite automata to Regular expression.

Published in:

International Journal of Advanced Research in Computer Science, 2012, v. 3, n. 4, p. 261

By:

Chhabra, Tamanna;
Kuymar, Ajay

Publication type:

Article