Filters








39 Hits in 3.3 sec

Ultrametric Finite Automata and Their Capabilities

Maksims Dimitrijevs, Kristīne Cīpola
2016 Baltic Journal of Modern Computing  
In this paper, we present a survey on ultrametric automata and their language recognition capabilities.  ...  Previous research has shown that ultrametric automata can recognize complex languages and can have small number of states when classical automata require much more states.  ...  In this paper, we present a survey on ultrametric automata types and their language recognition capabilities.  ... 
doi:10.22364/bjmc.2016.4.4.19 fatcat:dud35ixagjhqbeosca3em33iky

State Complexity Advantages of Ultrametric Automata

Maksims Dimitrijevs
2016 Conference on Current Trends in Theory and Practice of Informatics  
In this paper, we compare ultrametric automata with deterministic, nondeterministic, probabilistic and alternating automata with various state complexities.  ...  We also show that two-way ultrametric automata can have a smaller state complexity than one-way ultrametric automata.  ...  Ultrametric integral automata have better capabilities than regulated ultrametric automata and we can expect greater state complexity advantages.  ... 
dblp:conf/sofsem/Dimitrijevs16a fatcat:yr56ntwmubfxdghxknpoanu4yq

Rūsiņš Mārtiņš Freivalds. Remarkable Scholar, Unique Teacher and Great Man

Jozef Gruska
2016 Baltic Journal of Modern Computing  
Keywords: Rūsiņš Mārtiņš Freivalds, University of Latvia, computational learning, probabilistic and quantum automata and algorithms, ultrametric automata and algorithms.  ...  The paper summarizes life, carrier, research, publications, presentations, education, teaching, and services to academic community of the remarkable scientist, teacher, and person Rūsiņš Mārtiņš Freivalds  ...  algorithms; probabilistic and quantum automata, algorithms and computations; ultrametric automata and algorithms.  ... 
doi:10.22364/bjmc.2016.4.4.03 fatcat:glpn7twrwbelxnd723ixyjmgd4

Page 3959 of Mathematical Reviews Vol. , Issue 91G [page]

1991 Mathematical Reviews  
Summary: “Finite state automata, with nondeterminism and silent transitions, can be interpreted not as subsets of the free monoid as in classical automata theory, but as congruence classes under a congruence  ...  The roots of the MT contain these processors and the memory modules, while the other O(n) nodes have merely the capabilities of packet switchers and one-bit comparators.  ... 

Grids of Finite Automata

Karlis Jerins
2016 Conference on Current Trends in Theory and Practice of Informatics  
They have been the subject of lots of research, and much is known about their capabilities.  ...  Finite automata are a well known topic in computer science. Automata read words in a given alphabet and determine if those words belong to a specific formal language.  ...  The component automata are all identical save for their position in the grid (which is constant over time) and a number to identify them, and they consist of a set of states and a state transition function  ... 
dblp:conf/sofsem/Jerins16 fatcat:vasvmdmqf5cwtddcimrrtg6xfa

The ultrametric organization of memories in a neural network

N. Parga, M.A. Virasoro
1986 Journal de Physique  
But then one has to complete the model so as to be able to store a full hierarchical tree of categories embodying subcategories and so on.  ...  We would also like to thank Professor Abdus Salam, the International Atomic Energy Agency and UNESCO for hospitality at the International Centre for Theoretical Physics, Trieste.  ...  Mezard for a very fruitful interaction and G. Toulouse for a crucial discussion at the very beginning of this work. Looking backwards we now realize how many of his ideas we have been using freely.  ... 
doi:10.1051/jphys:0198600470110185700 fatcat:4ccbkqbqprdobk36k6ib7hzgse

The ultrametric organization of memories in a neural network [chapter]

N. Parga, M. A. Virasoro
1986 World Scientific Lecture Notes in Physics  
But then one has to complete the model so as to be able to store a full hierarchical tree of categories embodying subcategories and so on.  ...  We would also like to thank Professor Abdus Salam, the International Atomic Energy Agency and UNESCO for hospitality at the International Centre for Theoretical Physics, Trieste.  ...  Mezard for a very fruitful interaction and G. Toulouse for a crucial discussion at the very beginning of this work. Looking backwards we now realize how many of his ideas we have been using freely.  ... 
doi:10.1142/9789812799371_0047 fatcat:n4hypm2q7jakfhxjpu6easfzm4

Decidability and Universality in Symbolic Dynamical Systems [article]

Jean-Charles Delvenne, Petr Kurka, Vincent Blondel
2005 arXiv   pre-print
For Turing machines, counter machines and tag systems, our definition coincides with the classical one. It yields, however, a new definition for cellular automata and subshifts.  ...  We derive necessary conditions for undecidability and universality. For instance, a universal system must have a sensitive point and a proper subsystem.  ...  Acknowledgements We warmly thank Eugene Asarin (who suggested Proposition 3), Anahi Gajardo, Olivier Bournez, Pascal Koiran and Cris Moore for fruitful discussions and comments.  ... 
arXiv:cs/0404021v4 fatcat:7dlwdhzf7ng6zlynmi4xs5eziq

On Folding and Twisting (and whatknot): towards a characterization of workspaces in syntax [article]

Diego Gabriel Krivochen
2018 arXiv   pre-print
This view is common to European and American structuralism (e.g., Benveniste, 1971; Hockett, 1958) and different incarnations of generative grammar, transformational and non-transformational (Chomsky,  ...  1956, 1995; and Kaplan & Bresnan, 1982; Gazdar, 1982).  ...  input, their inner workings, and their output.  ... 
arXiv:1809.07853v3 fatcat:sa3j3ur3ijhvpcufroj7mivbqu

CPO semantics of timed interactive actor networks

Xiaojun Liu, Edward A. Lee
2008 Theoretical Computer Science  
In the classical actor model of Hewitt and Agha [4, 29] , components have their own thread of control and interact via message passing.  ...  The basic approach is to define a metric (actually, typically an ultrametric) on the set of traces of signals communicated between actors.  ...  Matsikoudis, and the anonymous reviewers for many helpful suggestions.  ... 
doi:10.1016/j.tcs.2008.08.044 fatcat:to5wwyu6lzc2bmbw6rdkeb2a2u

General metrics and contracting operations

Maurice Pouzet, Ivo G. Rosenberg
1994 Discrete Mathematics  
Although feedbacks largely enhance the construction capability, already their definition is based on various assumptions concerning real time functioning.  ...  Automata 4.3.1. Let A be a fixed set called an alphabet. The elements a, b, . . . of A are letters and finite sequences of letters are words. The empty word is denoted by q .  ... 
doi:10.1016/0012-365x(92)00527-x fatcat:x63idnqhebgh5b6m3qnlfshnpy

Behavioural Pseudometrics for Nondeterministic Probabilistic Systems [chapter]

Wenjie Du, Yuxin Deng, Daniel Gebler
2016 Lecture Notes in Computer Science  
For the model of probabilistic labelled transition systems that allow for the co-existence of nondeterminism and probabilities, we present two notions of bisimulation metrics: one is state-based and the  ...  We provide a sound and complete modal characterisation for each of them, using real-valued modal logics based on Hennessy-Milner logic.  ...  Acknowledgement We thank the anonymous referees for their helpful comments. References  ... 
doi:10.1007/978-3-319-47677-3_5 fatcat:7tcqhmhlvzcuph5bp6wgidqage

Modal Characterisations of Behavioural Pseudometrics [article]

Yuxin Deng, Wenjie Du, Daniel Gebler
2015 arXiv   pre-print
For the model of probabilistic labelled transition systems that allow for the co-existence of nondeterminism and probabilities, we present two notions of bisimulation metrics: one is state-based and the  ...  We provide a sound and complete modal characterisation for each of them, using real-valued modal logics based on the Hennessy-Milner logic.  ...  A pLTS is image-finite if for any state s and action a the set der (s, a) is finite. In the current work, we focus on image-finite pLTSs.  ... 
arXiv:1509.03391v1 fatcat:vwray5n6tvadvgqv2hlpndl4p4

Regular languages and stone duality

N. Pippenger
1997 Theory of Computing Systems  
We give a new account of the relationships among varieties of regular languages, varieties of finite semigroups, and their characterization in terms of "implicit identities."  ...  Pippenger Eilenberg's main result is that varieties of regular languages are characterized by their "syntactic semigroups," and that the corresponding sets of finite semigroups are those that are closed  ...  Acknowledgments The author is indebted to Dexter Kozen and Vaughan Pratt for helpful discussions concerning this paper, and to two anonymous referees for numerous helpful suggestions.  ... 
doi:10.1007/bf02679444 fatcat:uud42errpjhqdaqowzx455d6om

Classes and inheritance in actor-oriented design

Edward A. Lee, Xiaojun Liu, Stephen Neuendorffer
2009 ACM Transactions on Embedded Computing Systems  
The policy is based formally on a generalized ultrametric space with some remarkable properties.  ...  In this space, inheritance is favored when actors are "closer" (in the generalized ultrametric), and we show that when inheritance can occur from multiple sources, one source is always unambiguously closer  ...  " in UML-RT and "Composite Structures" in UML-2. * Port-based objects [Stewart et al. 1997 ], I/O automata [Lynch 1996] and hybrid I/O automata , Moses [Esser and Janneck 2001] , Metropolis [Goessler  ... 
doi:10.1145/1550987.1550992 fatcat:ig2i4hzkl5dz5jkx7465fiwmuq
« Previous Showing results 1 — 15 out of 39 results