Questions related to Automata
Most of the hybrid automata papers target formal verification of the systems. I am looking for papers that are solving optimal response problems that propose optimal control in power systems under the cyber compromise.
I am working on formal specifications expressed as classical finite-state automata with atomic events. I want to test my work on multiple specifications. Do you know of any archive or repository that contains many (preferably real-world) finite-state automata I could use as examples? I don't care about the format they are expressed in, as long as it is machine-readable.
The multi-analysis modeling of a complex system is the act of building a family of models which allows to cover a large spectrum of analysis methods (such as simulation, formal methods, enactment…) that can be performed to derive various properties of this system. The High-Level Language for Systems Specification (HiLLS) has recently been introduced as a graphical language for discrete event simulation, with potential for other types of analysis, like enactment for rapid system prototyping. HiLLS defines an automata language that also opens the way to formal verification.
NOTE This topic/question is purely mathematical, but potentially with some interesting relevance to multi-agent systems in the AI sense.
Suppose, for example, I want a network that once started will run indefinitely, always visiting all of its states before repetition. What is (1) a sufficient condition and (2) a necessary condition for this property?
NOTE For the precise definition of a Finite State Automaton (aka Finite State Machine) see any relevant textbook or the Wikipedia article.
There is a way to model computer networks (in terms of latency, bandwidth, packet size, etc.) through (stochastic?temporized?) automata? If I look for networked automata, I only find automata about "local" network of interacting components (e.g., cells)
In simple self-replicating machines (exclusive of developmental automata), the structure of the description (machine genome) is very simple. For the von Neumann model, the description is organised in a row major/column minor (or the reverse) order, and is clearly a blueprint. Biological genomes are seen as being strictly not of a blueprint nature but, it is clearly the case that whatever the architecture of the biological genome, it must be manipulable by the cell; the genome is, after all, totally inert.
So, the question pertains to all characters of biological genome architecture, and their delineation. Also, this question has strong potential for elucidating semiotic features of genome architecture.
The kind assistance of other researchers will certainly find value in the theory of developmental automata.
Learning automata are elements designed to beincorporated in a plausible and indefinite
environment. This machine performs some finite operations. Each learning automata has a vector of
probabilities and the vector illustrates the probability with which an operation is done and the total sum of
the entries equal one.
I am working on a project where a routing protocol is developed to choose the best route to deliver emergency alerts using Learning Automata(LA). LA should be implemented in NODES. Am working using NS2 Simulator.
I am interested in work on robots that can interact with children but are not telemedicine. I'm especially interested in social robots that can talk or understand human languae
I read the following example in one of my professors notes.
1) we have a SLR(1) Grammar G as following. we use SLR(1) parser generator and generate a parse table S for G. we use LALR(1) parser generator and generate a parse table L for G.
A-> lambda (lambda is a string with length=0)
Solution: the number of elements with R (reduce) in S is more than L.
but in one site I read:
2) Suppose T1, T2 is created with SLR(1) and LALR(1) for Grammar G. if G be a SLR(1) Grammar which of the following is TRUE?
a) T1 and T2 has not any difference.
b) total Number of non-error entries in T1 is lower than T2
c) total Number of error entries in T1 is lower than T2
The LALR(1) algorithm generates exactly the same states as the SLR(1) algorithm, but it can generate different actions; it is capable of resolving more conflicts than the SLR(1) algorithm. However, if the grammar is SLR(1), both algorithms will produce exactly the same machine (a is right).
any one could describe for me which of them is true?
EDIT: infact my question is why for a given SLR(1) Grammar, the parse table of LALAR(1) and SLR(1) is exactly the same, (error and non-error entries are equal and number of reduce is equal) but for the above grammar, the number of Reduced in S is more than L.
I am working on modelling the interaction between land-use changes and transport. I am using Metronamica which is a cellular automata based modelling package. One of the things I have come across from my reading, is that CA is not able to handle socio-economic variables. The problem is, in my case socioeconomic factors are very important drivers of urban change. Any suggestions on how I can overcome this?
The Chomsky hierarchy is a guideline on language's expressive power. The linear feedback shift register is a very interesting "element" to the structure of a language and there is a large base of theoretical literature on the subject.