Výsledky vyhľadávania - ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.1: Models of Computation
-
1
Autori: a ďalší
Prispievatelia: a ďalší
Zdroj: ISSN: 1942-3454.
Predmety: Branching programs, Binary formulas, Limited nondeterminism, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.1: Models of Computation/F.1.1.5: Unbounded-action devices (e.g., cellular automata, circuits, networks of machines), [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC]
Relation: info:eu-repo/semantics/altIdentifier/arxiv/1608.01932; ARXIV: 1608.01932
-
2
Autori: a ďalší
Prispievatelia: a ďalší
Zdroj: Information and Computation. 225:1-15
Predmety: FOS: Computer and information sciences, Computer Science - Logic in Computer Science, Discrete Mathematics (cs.DM), cellular automata, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.1: Models of Computation/F.1.1.5: Unbounded-action devices (e.g, Symbolic dynamics, 0102 computer and information sciences, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], 16. Peace & justice, 01 natural sciences, Theoretical Computer Science, Computer Science Applications, Logic in Computer Science (cs.LO), networks of machines), [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], Tilings, Computational Theory and Mathematics, circuits, Model theory, 0101 mathematics, Information Systems, Computer Science - Discrete Mathematics
Prístupová URL adresa: http://arxiv.org/abs/0912.1272
https://www.sciencedirect.com/science/article/abs/pii/S0890540113000047
https://ui.adsabs.harvard.edu/abs/2009arXiv0912.1272J/abstract
https://dblp.uni-trier.de/db/journals/iandc/iandc225.html#JeandelT13
https://hal.inria.fr/hal-00783099
https://hal.archives-ouvertes.fr/hal-00439407
https://www.sciencedirect.com/science/article/pii/S0890540113000047 -
3
Autori: a ďalší
Prispievatelia: a ďalší
Zdroj: CONCUR 2019 ; https://hal.science/hal-02267453 ; CONCUR 2019, Aug 2019, AMSTERDAM, Netherlands
Predmety: reachability, FIFO, termination, Infinite state systems, complexity, flat systems, counters, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.1: Models of Computation, ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.1: Specifying and Verifying and Reasoning about Programs, [SCCO.COMP]Cognitive science/Computer science, [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO]
Geografické téma: AMSTERDAM, Netherlands
Relation: info:eu-repo/semantics/altIdentifier/arxiv/1908.07282; ARXIV: 1908.07282
-
4
Autori: a ďalší
Prispievatelia: a ďalší
Zdroj: LICS - 28th ACM/IEEE Symposium on Logic in Computer Science ; https://inria.hal.science/hal-00773653 ; LICS - 28th ACM/IEEE Symposium on Logic in Computer Science, Jun 2013, New Orleans, United States. pp.103-112, ⟨10.1109/LICS.2013.15⟩ ; http://www.computer.org/csdl/proceedings/lics/2013/5020/00/5020a103-abs.html
Predmety: ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.1: Models of Computation/F.1.1.1: Bounded-action devices (e.g., Turing machines, random access machines), ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.3: Complexity Measures and Classes, [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC]
Geografické téma: New Orleans, United States
-
5
Autori: a ďalší
Prispievatelia: a ďalší
Zdroj: Discrete Models of Complex Systems ; https://univ-cotedazur.hal.science/hal-01741411 ; Discrete Models of Complex Systems, Mar 2018, Orléans, France
Predmety: ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.1: Models of Computation/F.1.1.5: Unbounded-action devices (e.g., cellular automata, circuits, networks of machines), ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.2: Modes of Computation/F.1.2.3: Parallelism and concurrency, [INFO.INFO-FL]Computer Science [cs]/Formal Languages and Automata Theory [cs.FL], [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
Dostupnosť: https://univ-cotedazur.hal.science/hal-01741411
-
6
Autori:
Prispievatelia:
Predmety: Blockchain Technology, Smart Contracts, Distributed Ledger Technology, Semantic technology, ACM: D.: Software/D.3: PROGRAMMING LANGUAGES/D.3.3: Language Constructs and Features, ACM: K.: Computing Milieux/K.5: LEGAL ASPECTS OF COMPUTING, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.1: Models of Computation, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.1: Models of Computation/F.1.1.0: Automata (e.g, finite, push-down, resource-bounded), [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], [INFO.INFO-OH]Computer Science [cs]/Other [cs.OH], [INFO.INFO-PL]Computer Science [cs]/Programming Languages [cs.PL], [INFO.INFO-ET]Computer Science [cs]/Emerging Technologies [cs.ET], droit
Relation: https://hal.inria.fr/hal-01777510/file/SemBlockChain_OpenAccess_April2018.pdf; https://hal.inria.fr/hal-01777510
-
7
Autori: a ďalší
Prispievatelia: a ďalší
Zdroj: Reversibility and Universality ; https://univ-cotedazur.hal.science/hal-01741396 ; Reversibility and Universality, 2018
Predmety: ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.2: Modes of Computation, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.3: Formal Languages/F.4.3.2: Classes defined by resource-bounded automata, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.1: Models of Computation/F.1.1.5: Unbounded-action devices (e.g., cellular automata, circuits, networks of machines), [INFO.INFO-OH]Computer Science [cs]/Other [cs.OH], [INFO.INFO-FL]Computer Science [cs]/Formal Languages and Automata Theory [cs.FL]
Dostupnosť: https://univ-cotedazur.hal.science/hal-01741396
-
8
Autori: a ďalší
Prispievatelia: a ďalší
Zdroj: ISSN: 2517-5599.
Predmety: ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.1: Combinatorics, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.1: Models of Computation/F.1.1.5: Unbounded-action devices (e.g., cellular automata, circuits, networks of machines), ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.3: Formal Languages, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [INFO.INFO-FL]Computer Science [cs]/Formal Languages and Automata Theory [cs.FL]
Relation: info:eu-repo/semantics/altIdentifier/arxiv/1506.06492; ARXIV: 1506.06492
-
9
Autori: a ďalší
Prispievatelia: a ďalší
Zdroj: https://hal.inria.fr/hal-01166053 ; 2020.
Predmety: ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.1: Combinatorics, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.1: Models of Computation/F.1.1.5: Unbounded-action devices (e.g., cellular automata, circuits, networks of machines), ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.3: Formal Languages, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [INFO.INFO-FL]Computer Science [cs]/Formal Languages and Automata Theory [cs.FL]
Relation: info:eu-repo/semantics/altIdentifier/arxiv/1506.06492; hal-01166053; https://hal.inria.fr/hal-01166053; https://hal.inria.fr/hal-01166053v3/document; https://hal.inria.fr/hal-01166053v3/file/1506.06492.pdf; ARXIV: 1506.06492
-
10
Autori: a ďalší
Prispievatelia: a ďalší
Zdroj: Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009 ; https://inria.hal.science/inria-00430531 ; Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009, Mar 2009, York, UK, United Kingdom. ⟨10.1007/978-3-642-00596-1_18⟩
Predmety: Process calculi, Expressiveness, Computability, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.1: Models of Computation/F.1.1.1: Bounded-action devices (e.g., Turing machines, random access machines), [INFO.INFO-MC]Computer Science [cs]/Mobile Computing
Geografické téma: York, UK, United Kingdom
-
11
Autori: a ďalší
Prispievatelia: a ďalší
Zdroj: ISSN: 0169-2968 ; Fundamenta Informaticae ; https://hal-lirmm.ccsd.cnrs.fr/lirmm-01476788 ; Fundamenta Informaticae, Polskie Towarzystwo Matematyczne, 2013, Cellular Automata and Models of Computation, 126 (2-3), pp.247-261. ⟨10.3233/FI-2013-880⟩.
Predmety: Pavage de Penrose, Universalité, Automates cellulaires, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.1: Models of Computation/F.1.1.5: Unbounded-action devices (e.g., cellular automata, circuits, networks of machines), [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC]
Relation: lirmm-01476788; https://hal-lirmm.ccsd.cnrs.fr/lirmm-01476788; https://hal-lirmm.ccsd.cnrs.fr/lirmm-01476788/document; https://hal-lirmm.ccsd.cnrs.fr/lirmm-01476788/file/automata2012.pdf
-
12
Autori: a ďalší
Prispievatelia: a ďalší
Zdroj: ISSN: 1548-7199.
Predmety: Turing machine, discrete-time dynamical system, aperiodicity, formal language, minimality, Symbolic Systems, Topological Dynamics, Turing machines, Subshifts, Substitution, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.1: Models of Computation/F.1.1.1: Bounded-action devices (e.g, random access machines), [MATH.MATH-DS]Mathematics [math]/Dynamical Systems [math.DS], [INFO.INFO-CL]Computer Science [cs]/Computation and Language [cs.CL], stat, lang
-
13
Autori: a ďalší
Prispievatelia: a ďalší
Zdroj: https://hal.science/hal-01474722 ; 2018.
Predmety: choreographies, asynchronous communications, distributed system, verification, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.1: Models of Computation/F.1.1.5: Unbounded-action devices (e.g., cellular automata, circuits, networks of machines), [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], [INFO.INFO-FL]Computer Science [cs]/Formal Languages and Automata Theory [cs.FL]
Relation: info:eu-repo/semantics/altIdentifier/arxiv/1702.07213; ARXIV: 1702.07213
-
14
Autori: a ďalší
Prispievatelia: a ďalší
Zdroj: STACS - Symposium on Theoretical Aspects of Computer Science ; https://inria.hal.science/hal-00785232 ; STACS - Symposium on Theoretical Aspects of Computer Science, Mar 2014, Lyon, France. pp.421-432, ⟨10.4230/LIPIcs.STACS.2014.421⟩
Predmety: Turing machines, entropy, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.1: Models of Computation/F.1.1.1: Bounded-action devices (e.g., random access machines), [INFO.INFO-FL]Computer Science [cs]/Formal Languages and Automata Theory [cs.FL], [INFO.INFO-IT]Computer Science [cs]/Information Theory [cs.IT], [MATH.MATH-IT]Mathematics [math]/Information Theory [math.IT], [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], [MATH.MATH-DS]Mathematics [math]/Dynamical Systems [math.DS], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
Relation: info:eu-repo/semantics/altIdentifier/arxiv/1302.1170; ARXIV: 1302.1170
-
15
Autori: a ďalší
Prispievatelia: a ďalší
Zdroj: ISSN: 1567-7818.
Predmety: Chaos, Dynamical systems, Undecidability, Reversibility, Energy, Conservation laws, Cellular automata, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.1: Models of Computation/F.1.1.5: Unbounded-action devices (e.g., circuits, networks of machines), [INFO]Computer Science [cs], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [MATH.MATH-DS]Mathematics [math]/Dynamical Systems [math.DS], [NLIN.NLIN-CG]Nonlinear Sciences [physics]/Cellular Automata and Lattice Gases [nlin.CG]
-
16
Autori: a ďalší
Prispievatelia: a ďalší
Zdroj: ISSN: 0143-3857.
Predmety: symbolic dynamics, harmonic analysis, limit measure, cellular automata, randomization, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.1: Models of Computation/F.1.1.1: Bounded-action devices (e.g., Turing machines, random access machines), [MATH.MATH-DS]Mathematics [math]/Dynamical Systems [math.DS], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
Relation: info:eu-repo/semantics/altIdentifier/arxiv/1703.07289; ARXIV: 1703.07289
-
17
Autori: a ďalší
Prispievatelia: a ďalší
Zdroj: ISSN: 1557-5969.
Predmety: asynchronous cellular automata, stochastic process, discrete dynamical systems, directed percolation, phase transitions, universality class, Monte Carlo simulations, power laws, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.1: Models of Computation/F.1.1.5: Unbounded-action devices (e.g., cellular automata, circuits, networks of machines), [NLIN.NLIN-CG]Nonlinear Sciences [physics]/Cellular Automata and Lattice Gases [nlin.CG]
Relation: info:eu-repo/semantics/altIdentifier/arxiv/nlin/0703044; ARXIV: nlin/0703044
-
18
Autori: a ďalší
Prispievatelia: a ďalší
Zdroj: https://inria.hal.science/inria-00001031 ; [Research Report] PI 1767, 2005, pp.25.
Predmety: Communicating Finite State Machines, Reachability Analysis, FIFO channels systems, Abstract Interpretation \\ Automates communicants, Analyse d'atteignabilité, Systèmes FIFO, Interprétation Abstraite, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES, [INFO.INFO-OH]Computer Science [cs]/Other [cs.OH]
Relation: Report N°: PI 1767
-
19
Autori: a ďalší
Prispievatelia: a ďalší
Zdroj: https://theses.hal.science/tel-03188307 ; Informatique [cs]. Aix-Marseile Université, 2021. Français. ⟨NNT : ⟩.
Predmety: Automata network, natural computation, simulation, Réseaux d'automates, calcul naturel, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.1: Models of Computation/F.1.1.3: Relations between models, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.1: Models of Computation/F.1.1.0: Automata (e.g., finite, push-down, resource-bounded), [INFO]Computer Science [cs]
-
20
Autori: a ďalší
Prispievatelia: a ďalší
Zdroj: ISSN: 0960-0779.
Predmety: ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.1: Models of Computation/F.1.1.2: Computability theory, [INFO.INFO-MO]Computer Science [cs]/Modeling and Simulation, [MATH.MATH-DS]Mathematics [math]/Dynamical Systems [math.DS], [NLIN.NLIN-CD]Nonlinear Sciences [physics]/Chaotic Dynamics [nlin.CD]
Nájsť tento článok vo Web of Science 
Full Text Finder