Výsledky vyhledávání - acm: f.: theory of computation/f.1: computation by abstracts devices/f.1.1: models of computation

Subshifts as models for MSO logic

Autoři: Jeandel, Emmanuel Theyssier, Guillaume Theoretical adverse computations, and safety (CARTE) a další

Přispěvatelé: Jeandel, Emmanuel Theyssier, Guillaume Theoretical adverse computations, and safety (CARTE) a další

Zdroj: Information and Computation. 225:1-15

Témata: 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

Pří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

Verification of Flat FIFO Systems

Autoři: Finkel, Alain Praveen, M. Laboratoire Spécification et Vérification Cachan (LSV) a další

Přispěvatelé: Finkel, Alain Praveen, M. Laboratoire Spécification et Vérification Cachan (LSV) a další

Zdroj: CONCUR 2019 ; https://hal.science/hal-02267453 ; CONCUR 2019, Aug 2019, AMSTERDAM, Netherlands

Témata: 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

Dostupnost: https://hal.science/hal-02267453
https://hal.science/hal-02267453v1/document
https://hal.science/hal-02267453v1/file/flat.pdf

On the query complexity of real functionals

Autoři: Férée, Hugo Hoyrup, Mathieu Gomaa, Walid a další

Přispěvatelé: Férée, Hugo Hoyrup, Mathieu Gomaa, Walid a další

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

Témata: 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

Dostupnost: https://inria.hal.science/hal-00773653
https://inria.hal.science/hal-00773653v1/document
https://inria.hal.science/hal-00773653v1/file/preprint.pdf
https://doi.org/10.1109/LICS.2013.15

Randomness with Cellular Automata

Autoři: Martin, Bruno Laboratoire d'Informatique, Signaux, et Systèmes de Sophia-Antipolis (I3S) / Equipe MC3 Modèles Discrets pour les Systèmes Complexes (Laboratoire I3S - MDSC) a další

Přispěvatelé: Martin, Bruno Laboratoire d'Informatique, Signaux, et Systèmes de Sophia-Antipolis (I3S) / Equipe MC3 Modèles Discrets pour les Systèmes Complexes (Laboratoire I3S - MDSC) a další

Zdroj: Discrete Models of Complex Systems ; https://univ-cotedazur.hal.science/hal-01741411 ; Discrete Models of Complex Systems, Mar 2018, Orléans, France

Témata: 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]

Geografické téma: Orléans, France

Dostupnost: https://univ-cotedazur.hal.science/hal-01741411

Smart Contracts that are Smart and can function as Legal Contracts ; Smart Contracts that are Smart and can function as Legal Contracts : A Review of Semantic Blockchain and Distributed Ledger Technologies

Autoři: von Wendland, Marcelle Bancstreet Capital Partners Ltd (BST)

Přispěvatelé: von Wendland, Marcelle Bancstreet Capital Partners Ltd (BST)

Témata: 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

Dostupnost: https://hal.inria.fr/hal-01777510/file/SemBlockChain_OpenAccess_April2018.pdf
https://hal.inria.fr/hal-01777510

On Radius 1 Nontrivial Reversible and Number-Conserving Cellular Automata

Autoři: Martin, Bruno Imai, Katsunobu Saito, Ryohei a další

Přispěvatelé: Martin, Bruno Imai, Katsunobu Saito, Ryohei a další

Zdroj: Reversibility and Universality ; https://univ-cotedazur.hal.science/hal-01741396 ; Reversibility and Universality, 2018

Témata: 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]

Dostupnost: https://univ-cotedazur.hal.science/hal-01741396

An aperiodic set of 11 Wang tiles

Autoři: Jeandel, Emmanuel Rao, Michael Designing the Future of Computational Models (MOCQUA) a další

Přispěvatelé: Jeandel, Emmanuel Rao, Michael Designing the Future of Computational Models (MOCQUA) a další

Zdroj: ISSN: 2517-5599.

Témata: 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

Dostupnost: https://inria.hal.science/hal-01166053
https://inria.hal.science/hal-01166053v4/document
https://inria.hal.science/hal-01166053v4/file/1506.06492.pdf
https://doi.org/10.19086/aic.18614

An aperiodic set of 11 Wang tiles

Autoři: Jeandel, Emmanuel Rao, Michael Designing the Future of Computational Models (MOCQUA) a další

Přispěvatelé: Jeandel, Emmanuel Rao, Michael Designing the Future of Computational Models (MOCQUA) a další

Zdroj: https://hal.inria.fr/hal-01166053 ; 2020.

Témata: 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

Dostupnost: https://hal.inria.fr/hal-01166053
https://hal.inria.fr/hal-01166053v3/document
https://hal.inria.fr/hal-01166053v3/file/1506.06492.pdf

On the Expressive Power of Restriction and Priorities in CCS with replication

Autoři: Aranda, Jesus Valencia, Frank Versari, Cristian a další

Přispěvatelé: Aranda, Jesus Valencia, Frank Versari, Cristian a další

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⟩

Témata: 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

Dostupnost: https://inria.hal.science/inria-00430531
https://inria.hal.science/inria-00430531v1/document
https://inria.hal.science/inria-00430531v1/file/fossacs09.pdf
https://doi.org/10.1007/978-3-642-00596-1_18

Nondeterminism and An Abstract Formulation of Nečiporuk’s Lower Bound Method

Autoři: Beame, Paul Grosshans, Nathan Mckenzie, Pierre a další

Přispěvatelé: Beame, Paul Grosshans, Nathan Mckenzie, Pierre a další

Zdroj: ISSN: 1942-3454.

Témata: 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

Dostupnost: https://inria.hal.science/hal-01426213
https://inria.hal.science/hal-01426213v1/document
https://inria.hal.science/hal-01426213v1/file/main.pdf
https://doi.org/10.1145/3013516

A 6-state Universal Semi-totalistic Cellular Automaton on Kite and Dart Penrose Tilings

Autoři: Imai, Katsunobu Hatsuda, Takahiro Poupet, Victor a další

Přispěvatelé: Imai, Katsunobu Hatsuda, Takahiro Poupet, Victor a další

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⟩.

Témata: 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

Dostupnost: 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
https://doi.org/10.3233/FI-2013-880

A Binary Complete and Aperiodic Turing machine

Autoři: Concha-Vega, Pablo Torres-Avilés, Rodrigo Departamento de Ingeniería Matemática a další

Přispěvatelé: Concha-Vega, Pablo Torres-Avilés, Rodrigo Departamento de Ingeniería Matemática a další

Zdroj: ISSN: 1548-7199.

Témata: 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

Relation: https://hal.science/hal-02545145v2/file/BinSmart.pdf; https://hal.science/hal-02545145

Dostupnost: https://hal.science/hal-02545145v2/file/BinSmart.pdf
https://hal.science/hal-02545145

Synchronizability of Communicating Finite State Machines is not Decidable

Autoři: Finkel, Alain Lozes, Etienne Laboratoire Spécification et Vérification Cachan (LSV) a další

Přispěvatelé: Finkel, Alain Lozes, Etienne Laboratoire Spécification et Vérification Cachan (LSV) a další

Zdroj: https://hal.science/hal-01474722 ; 2018.

Témata: 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

Dostupnost: https://hal.science/hal-01474722
https://hal.science/hal-01474722v5/document
https://hal.science/hal-01474722v5/file/main.pdf

Computability of the entropy of one-tape Turing Machines

Autoři: Jeandel, Emmanuel Theoretical adverse computations, and safety (CARTE) Centre Inria de l'Université de Lorraine a další

Přispěvatelé: Jeandel, Emmanuel Theoretical adverse computations, and safety (CARTE) Centre Inria de l'Université de Lorraine a další

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⟩

Témata: 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]

Geografické téma: Lyon, France

Relation: info:eu-repo/semantics/altIdentifier/arxiv/1302.1170; ARXIV: 1302.1170

Dostupnost: https://inria.hal.science/hal-00785232
https://inria.hal.science/hal-00785232v1/document
https://inria.hal.science/hal-00785232v1/file/entropy.pdf
https://doi.org/10.4230/LIPIcs.STACS.2014.421

On the hierarchy of conservation laws in a cellular automaton

Autoři: Formenti, Enrico Kari, Jarkko Taati, Siamak a další

Přispěvatelé: Formenti, Enrico Kari, Jarkko Taati, Siamak a další

Zdroj: ISSN: 1567-7818.

Témata: 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]

Dostupnost: https://hal.science/hal-01311512
https://doi.org/10.1007/s11047-010-9222-0

Characterizing Asymptotic Randomization in Abelian Cellular Automata

Autoři: Hellouin de Menibus, Benjamin Salo, Ville Theyssier, Guillaume a další

Přispěvatelé: Hellouin de Menibus, Benjamin Salo, Ville Theyssier, Guillaume a další

Zdroj: ISSN: 0143-3857.

Témata: 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

Dostupnost: https://hal.science/hal-01491485
https://hal.science/hal-01491485v2/document
https://hal.science/hal-01491485v2/file/paper_ca.pdf

Asynchronism Induces Second Order Phase Transitions in Elementary Cellular Automata

Autoři: Fatès, Nazim, A. Autonomous intelligent machine (MAIA) INRIA Lorraine a další

Přispěvatelé: Fatès, Nazim, A. Autonomous intelligent machine (MAIA) INRIA Lorraine a další

Zdroj: ISSN: 1557-5969.

Témata: 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

Dostupnost: https://inria.hal.science/inria-00138051
https://inria.hal.science/inria-00138051v3/document
https://inria.hal.science/inria-00138051v3/file/Percolation.pdf

ABSTRACTS from other ACM Publications.

Zdroj: Communications of the ACM; Oct82, Vol. 25 Issue 10, p748-753, 6p

Témata: DATA compression, CODING theory, DATABASE management, COMPUTER industry, COMPUTER programming

ABSTRACTS from other ACM Publications.

Zdroj: Communications of the ACM; Apr1982, Vol. 25 Issue 4, p286-291, 6p

Témata: AUTOMATIC theorem proving, SPANNING trees, TREE graphs, PROOF theory

ABSTRACTS from other ACM Publications.

Zdroj: Communications of the ACM; Jul1982, Vol. 25 Issue 7, p487-492, 6p

Témata: SEQUENTIAL machine theory, REDUCED instruction set computers, MICROELECTRONICS, INTEGRATED circuits

Reviews & Products: COMMUNICATIONS of the ACM (Periodical)