Downloads & Free Reading Options - Results

Predicate intuitionistic logic is a well established fragment of dependent types. According to the Curry-Howard isomorphism proof construction in the logic corresponds well to synthesis of a program the type of which is a given formula. We present a model of automata that can handle proof construction in full intuitionistic first-order logic. The automata are constructed in such a way that any successful run corresponds directly to a normal proof in the logic. This makes it possible to discuss formal languages of proofs or programs, the closure properties of the automata and their connections with the traditional logical connectives.

Predicate intuitionistic logic is a well established fragment of dependent types. According to the Curry-Howard isomorphism proof construction in the logic corresponds well to synthesis of a program the type of which is a given formula. We present a model of automata that can handle proof construction in full intuitionistic first-order logic. The automata are constructed in such a way that any successful run corresponds directly to a normal proof in the logic. This makes it possible to discuss formal languages of proofs or programs, the closure properties of the automata and their connections with the traditional logical connectives.

Bell System Technical Journal, 46: 8. October 1967 pp 1793-1829. An Approach to a Unified Theory of Automata. (Hopcroft, J.E.; Ullman, J.D.)

Bell System Technical Journal, 46: 8. October 1967 pp 1793-1829. An Approach to a Unified Theory of Automata. (Hopcroft, J.E.; Ullman, J.D.)

Bell System Technical Journal, 46: 8. October 1967 pp 1793-1829. An Approach to a Unified Theory of Automata. (Hopcroft, J.E.; Ullman, J.D.)

This booklet contains a variety or comments regarding J. Glenn Brookshear's text "Theory of Computation: Formal Languages, Automata, and Complexity" (ISBN 0-8053-0143-7) along with some ideas and transparency masters that a teacher or a course based on that text may want to use. The booklet contains a chapter corresponding to each chapter in the parent text and concludes with a section of transparency masters. Within each chapter are sections entitled General Comments, Comments Regarding Chapter Review Problems, and Additional Problems. ISBN 0-8053-0144-5

This booklet contains a variety or comments regarding J. Glenn Brookshear's text "Theory of Computation: Formal Languages, Automata, and Complexity" (ISBN 0-8053-0143-7) along with some ideas and transparency masters that a teacher or a course based on that text may want to use. The booklet contains a chapter corresponding to each chapter in the parent text and concludes with a section of transparency masters. Within each chapter are sections entitled General Comments, Comments Regarding Chapter Review Problems, and Additional Problems. ISBN 0-8053-0144-5

trent_0116301269779 "This classic book on formal languages, automata theory, and computational complexity has been updated to present theoretical concepts in a concise and straightforward manner with increased coverage of practical applications. This third edition offers students a less formal writing style while providing the most accessible coverage of automata theory available, solid treatment on constructing proofs, many figures and diagrams to help convey ideas, and sidebars to highlight related material. A new feature of this edition is Gradiance, a Web-based homework and assessment tool. Each chapter offers an abundance of exercises, including selected Gradiance problems, for a true hands-on learning experience for students."--BOOK JACKET.

In a series of recent work, we have introduced a general framework for quantitative reasoning in specification theories. The contribution of this paper is to show how this framework can be applied to yield a robust specification theory for timed specifications.

After leading to a new axiomatic derivation of quantum theory, the new informational paradigm is entering the domain of quantum field theory, suggesting a quantum automata framework that can be regarded as an extension of quantum field theory to including an hypothetical Planck scale, and with the usual quantum field theory recovered in the relativistic limit of small wave-vectors. Being derived from simple principles (linearity, unitarity, locality, homogeneity, isotropy, and minimality of dimension), the automata theory is quantum ab-initio, and does not assume Lorentz covariance and mechanical notions. Being discrete it can describe localized states and measurements (unmanageable by quantum field theory), solving all the issues plaguing field theory originated from the continuum. These features make the theory an ideal framework for quantum gravity, with relativistic covariance and space-time emergent solely from the interactions, and not assumed a priori. The paper presents a synthetic derivation of the automata theory, showing how from the principles lead to a description in terms of a quantum automaton over a Cayley graph of a group. Restricting to Abelian groups we show how the automata recover the Weyl, Dirac and Maxwell dynamics in the relativistic limit. We conclude with some new routes about the more general scenario of non-Abelian Cayley graphs.

Event clock automata (ECA) are a model for timed languages that has been introduced by Alur, Fix and Henzinger as an alternative to timed automata, with better theoretical properties (for instance, ECA are determinizable while timed automata are not). In this paper, we revisit and extend the theory of ECA. We first prove that no finite time abstract language equivalence exists for ECA, thereby disproving a claim in the original work on ECA. This means in particular that regions do not form a time abstract bisimulation. Nevertheless, we show that regions can still be used to build a finite automaton recognizing the untimed language of an ECA. Then, we extend the classical notions of zones and DBMs to let them handle event clocks instead of plain clocks (as in timed automata) by introducing event zones and Event DBMs (EDBMs). We discuss algorithms to handle event zones represented as EDBMs, as well as (semi-) algorithms based on EDBMs to decide language emptiness of ECA.

We prove that some fairly basic questions on automata reading infinite words depend on the models of the axiomatic system ZFC. It is known that there are only three possibilities for the cardinality of the complement of an omega-language $L(A)$ accepted by a B\"uchi 1-counter automaton $A$. We prove the following surprising result: there exists a 1-counter B\"uchi automaton $A$ such that the cardinality of the complement $L(A)^-$ of the omega-language $L(A)$ is not determined by ZFC: (1). There is a model $V_1$ of ZFC in which $L(A)^-$ is countable. (2). There is a model $V_2$ of ZFC in which $L(A)^-$ has cardinal $2^{\aleph_0}$. (3). There is a model $V_3$ of ZFC in which $L(A)^-$ has cardinal $\aleph_1$ with $\aleph_0

We describe L-FLAT, a Logtalk Toolkit for teaching Formal Languages and Automata Theory. L-FLAT supports the definition of \textsl{alphabets}, the definition of \textsl{orders} over alphabet symbols, the partial definition of \textsl{languages} using unit tests, and the definition of \textsl{mechanisms}, which implement language generators or language recognizers. Supported mechanisms include \textsl{predicates}, \textsl{regular expressions}, \textsl{finite automata}, \textsl{context-free grammars}, \textsl{Turing machines}, and \textsl{push-down automata}. L-FLAT entities are implemented using the object-oriented features of Logtalk, providing a highly portable and easily extendable framework. The use of L-FLAT in educational environments is enhanced by supporting Mooshak, a web application that features automatic grading of submitted programs.

In this chapter, we deal with some specific domains of applications to game theory. This is one of the major class of models in the new approaches of modelling in the economic domain. For that, we use genetic automata which allow to build adaptive strategies for the players. We explain how the automata-based formalism proposed - matrix representation of automata with multiplicities - allows to define semi-distance between the strategy behaviors. With that tools, we are able to generate an automatic processus to compute emergent systems of entities whose behaviors are represented by these genetic automata.

Lattice gas automata with collision rules that violate the conditions of semi-detailed-balance exhibit algebraic decay of equal time spatial correlations between fluctuations of conserved densities. This is shown on the basis of a systematic microscopic theory. Analytical expressions for the dominant long range behavior of correlation functions are derived using kinetic theory. We discuss a model of interacting random walkers with x-y anisotropy whose pair correlation function decays as 1/r^2, and an isotropic fluid-type model with momentum correlations decaying as 1/r^2. The pair correlation function for an interacting random walker model with interactions satisfying all symmetries of the square lattice is shown to have 1/r^4 density correlations. Theoretical predictions for the amplitude of the algebraic tails are compared with the results of computer simulations.

robot marian ferrari

automata

We consider temporal logic verification of (possibly nonlinear) dynamical systems evolving over continuous state spaces. Our approach combines automata-based verification and the use of so-called barrier certificates. Automata-based verification allows the decomposition the verification task into a finite collection of simpler constraints over the continuous state space. The satisfaction of these constraints in turn can be (potentially conservatively) proved by appropriately constructed barrier certificates. As a result, our approach, together with optimization-based search for barrier certificates, allows computational verification of dynamical systems against temporal logic properties while avoiding explicit abstractions of the dynamics as commonly done in literature.

kantor chomsky turing poland

kantor chomsky turing poland

Methods for development of logic design together with algorithms for failure testing, a method for design of logic for ultra-large-scale integration, extension of quantum calculus to describe the functional behavior of a mechanism component-by-component and to computer tests for failures in the mechanism using the diagnosis algorithm, and the development of an algorithm for the multi-output 2-level minimization problem are discussed.

Methods for development of logic design together with algorithms for failure testing, a method for design of logic for ultra-large-scale integration, extension of quantum calculus to describe the functional behavior of a mechanism component-by-component and to computer tests for failures in the mechanism using the diagnosis algorithm, and the development of an algorithm for the multi-output 2-level minimization problem are discussed.

The major societal interests among the urban community at the moment represent a wide array of sustainable energy, climatic regulation, proper water use and sustainable production and consumption of renewable resources. As people migrate to urban areas, and more than half of the world population now live in cities, more pressure is put on the Water-Energy-Food-Waste (WEFW) systems. Devoid of plans for sustainable provision of WEFW services, cities may suffer water stress, starvation, load shedding and choked with waste. In this regard, among the dilemmas faced by urban managers is which methodologies would appropriately fix these problems and why. They can either (i) treat each of these problems individually or (ii) address them as one complex problem. This paper adopts the Automata Theory (AT) to explain how these options are affected by the nature of WEFW nexus, in what way the effects are transferred in the states and the opportunities and cautions from this nexus that affect the management of urban dynamics. A total of 16 articles analysing WEFW nexus and 20 articles covering interactions between WEFW elements were reviewed. Results show that the management of the interconnections between the WEFW elements contributes to either the realization or the breakdown of the urban systems. Empirical studies to establish resultant interactions between nexus sub-systems and developing integrated planning tools for inclusive policy processes that consider the vast array of this nexus in the current complex systems is fundamental

"A guide to the literature": p. 473-490

"A guide to the literature": p. 473-490

ISBN: 0 8053 0143 7

Although models are built on the basis of some observations of reality, the concepts that derive theoretically from their definitions as well as from their characteristics and properties are not necessarily direct consequences of these initial observations. Indeed, many of them rather follow from chains of theoretical inferences that are only based on the precise model definitions and rely strongly, in addition, on some consequential working hypotheses. Thus, it is important to address the question of which features of a model effectively carry some modelling meaning and which only result from the task of formalising observations of reality into a mathematical language. In this article, we address this question with a theoretical point view that sets our discussion strictly between the two stages of the modelling process that require knowledge of real systems, that is, between the initial stage that chooses a global theoretical framework to build the model and the final stage that exploits its formal predictions by comparing them to the reality that the model was designed to simulate. Taking Boolean automata networks as instances of models of systems observed in reality, we analyse in this setting the remaining stages of the modelling process and we show how the meaning of theoretical concepts can subtly rely on formal choices such as definitions and hypotheses.

Although models are built on the basis of some observations of reality, the concepts that derive theoretically from their definitions as well as from their characteristics and properties are not necessarily direct consequences of these initial observations. Indeed, many of them rather follow from chains of theoretical inferences that are only based on the precise model definitions and rely strongly, in addition, on some consequential working hypotheses. Thus, it is important to address the question of which features of a model effectively carry some modelling meaning and which only result from the task of formalising observations of reality into a mathematical language. In this article, we address this question with a theoretical point view that sets our discussion strictly between the two stages of the modelling process that require knowledge of real systems, that is, between the initial stage that chooses a global theoretical framework to build the model and the final stage that exploits its formal predictions by comparing them to the reality that the model was designed to simulate. Taking Boolean automata networks as instances of models of systems observed in reality, we analyse in this setting the remaining stages of the modelling process and we show how the meaning of theoretical concepts can subtly rely on formal choices such as definitions and hypotheses.

Although models are built on the basis of some observations of reality, the concepts that derive theoretically from their definitions as well as from their characteristics and properties are not necessarily direct consequences of these initial observations. Indeed, many of them rather follow from chains of theoretical inferences that are only based on the precise model definitions and rely strongly, in addition, on some consequential working hypotheses. Thus, it is important to address the question of which features of a model effectively carry some modelling meaning and which only result from the task of formalising observations of reality into a mathematical language. In this article, we address this question with a theoretical point view that sets our discussion strictly between the two stages of the modelling process that require knowledge of real systems, that is, between the initial stage that chooses a global theoretical framework to build the model and the final stage that exploits its formal predictions by comparing them to the reality that the model was designed to simulate. Taking Boolean automata networks as instances of models of systems observed in reality, we analyse in this setting the remaining stages of the modelling process and we show how the meaning of theoretical concepts can subtly rely on formal choices such as definitions and hypotheses.

Finite state automata are an undeservedly underestimated data structure because most people think they are complex to build. Recent additions to Lucene show that FSAs (and transducers) are very efficient and are applicable to many problems with great results. This talk will introduce FSAs, quickly glance over their construction algorithms and physical automaton representation in Lucene and proceed with practical examples of where FSAs are used with success. Source: https://vimeo.com/26517310 Uploader: newthinking

In the book we present main concepts of probabilistic automata theory.

In the book we present main concepts of probabilistic automata theory.

In the book we present main concepts of probabilistic automata theory.

In the book we present main concepts of probabilistic automata theory.

In the book we present main concepts of probabilistic automata theory.

Toruń 

Toruń 

jorg end bijan

Model-based testing (MBT) is a well-known technology, which allows for automatic test case generation, execution and evaluation. To test non-functional properties, a number of test MBT frameworks have been developed to test systems with real-time, continuous behaviour, symbolic data and quantitative system aspects. Notably, a lot of these frameworks are based on Tretmans' classical input/output conformance (ioco) framework. However, a model-based test theory handling probabilistic behaviour does not exist yet. Probability plays a role in many different systems: unreliable communication channels, randomized algorithms and communication protocols, service level agreements pinning down up-time percentages, etc. Therefore, a probabilistic test theory is of great practical importance. We present the ingredients for a probabilistic variant of ioco and define the {\pi}oco relation, show that it conservatively extends ioco and define the concepts of test case, execution and evaluation.

In this paper, we deal with some specific domains of applications to game theory. This is one of the major class of models in the new approaches of modelling in the economic domain. For that, we use genetic automata which allow to buid adaptive strategies for the players. We explain how the automata-based formalism proposed - matrix representation of automata with multiplicities - allows to define a semi-distance between the strategy behaviors. With that tools, we are able to generate an automatic processus to compute emergent systems of entities whose behaviors are represented by these genetic automata.

In a series of recent papers it has been shown how free quantum field theory can be derived without using mechanical primitives (including space-time, special relativity, quantization rules, etc.), but only considering the easiest quantum algorithm encompassing a countable set of quantum systems whose network of interactions satisfies the simple principles of unitarity, homogeneity, locality, and isotropy. This has opened the route to extending the axiomatic information-theoretic derivation of the quantum theory of abstract systems to include quantum field theory. The inherent discrete nature of the informational axiomatization leads to an extension of quantum field theory to a quantum cellular automata theory, where the usual field theory is recovered in a regime where the discrete structure of the automata cannot be probed. A simple heuristic argument sets the scale of discreteness to the Planck scale, and the customary physical regime where discreteness is not visible is the relativistic one of small wavevectors. In this paper we provide a thorough derivation from principles that in the most general case the graph of the quantum cellular automaton is the Cayley graph of a finitely presented group, and showing how for the case corresponding to Euclidean emergent space (where the group resorts to an Abelian one) the automata leads to Weyl, Dirac and Maxwell field dynamics in the relativistic limit. We conclude with some perspectives towards the more general scenario of non-linear automata for interacting quantum field theory.

In a series of recent papers it has been shown how free quantum field theory can be derived without using mechanical primitives (including space-time, special relativity, quantization rules, etc.), but only considering the easiest quantum algorithm encompassing a countable set of quantum systems whose network of interactions satisfies the simple principles of unitarity, homogeneity, locality, and isotropy. This has opened the route to extending the axiomatic information-theoretic derivation of the quantum theory of abstract systems to include quantum field theory. The inherent discrete nature of the informational axiomatization leads to an extension of quantum field theory to a quantum cellular automata theory, where the usual field theory is recovered in a regime where the discrete structure of the automata cannot be probed. A simple heuristic argument sets the scale of discreteness to the Planck scale, and the customary physical regime where discreteness is not visible is the relativistic one of small wavevectors. In this paper we provide a thorough derivation from principles that in the most general case the graph of the quantum cellular automaton is the Cayley graph of a finitely presented group, and showing how for the case corresponding to Euclidean emergent space (where the group resorts to an Abelian one) the automata leads to Weyl, Dirac and Maxwell field dynamics in the relativistic limit. We conclude with some perspectives towards the more general scenario of non-linear automata for interacting quantum field theory.

Recent advances on quantum foundations achieved the derivation of free quantum field theory from general principles, without referring to mechanical notions and relativistic invariance. From the aforementioned principles a quantum cellular automata (QCA) theory follows, whose relativistic limit of small wave-vector provides the free dynamics of quantum field theory. The QCA theory can be regarded as an extended quantum field theory that describes in a unified way all scales ranging from an hypothetical discrete Planck scale up to the usual Fermi scale. The present paper reviews the elementary automaton theory for the Weyl field, and the composite automata for Dirac and Maxwell fields. We then give a simple analysis of the dynamics in the momentum space in terms of a dispersive differential equation for narrowband wave-packets, and some account on the position space description in terms of a discrete path-integral approach. We then review the phenomenology of the free-field automaton and consider possible visible effects arising from the discreteness of the framework. We conclude introducing the consequences of the automaton distorted dispersion relation, leading to a deformed Lorentz covariance and to possible effects on the thermodynamics of ideal gases.

We study languages over infinite alphabets equipped with some structure that can be tested by recognizing automata. We develop a framework for studying such alphabets and the ensuing automata theory, where the key role is played by an automorphism group of the alphabet. In the process, we generalize nominal sets due to Gabbay and Pitts.

We study languages over infinite alphabets equipped with some structure that can be tested by recognizing automata. We develop a framework for studying such alphabets and the ensuing automata theory, where the key role is played by an automorphism group of the alphabet. In the process, we generalize nominal sets due to Gabbay and Pitts.

We give a new simple proof of the decidability of the First Order Theory of (omega^omega^i,+) and the Monadic Second Order Theory of (omega^i,

We give a new simple proof of the decidability of the First Order Theory of (omega^omega^i,+) and the Monadic Second Order Theory of (omega^i,

We give a new simple proof of the decidability of the First Order Theory of (omega^omega^i,+) and the Monadic Second Order Theory of (omega^i,

The cellular automata (CA) approach to traffic modeling is extended to allow for spatially homogeneous steady state solutions that cover a two dimensional region in the flow-density plane. Hence these models fulfill a basic postulate of a three-phase traffic theory proposed by Kerner. This is achieved by a synchronization distance, within which a vehicle always tries to adjust its speed to the one of the vehicle in front. In the CA models presented, the modelling of the free and safe speeds, the slow-to-start rules as well as some contributions to noise are based on the ideas of the Nagel-Schreckenberg type modelling. It is shown that the proposed CA models can be very transparent and still reproduce the two main types of congested patterns (the general pattern and the synchronized flow pattern) as well as their dependence on the flows near an on-ramp, in qualitative agreement with the recently developed continuum version of the three-phase traffic theory [B. S. Kerner and S. L. Klenov. 2002. J. Phys. A: Math. Gen. 35, L31]. These features are qualitatively different than in previously considered CA traffic models. The probability of the breakdown phenomenon (i.e., of the phase transition from free flow to synchronized flow) as function of the flow rate to the on-ramp and of the flow rate on the road upstream of the on-ramp is investigated. The capacity drops at the on-ramp which occur due to the formation of different congested patterns are calculated.

The cellular automata (CA) approach to traffic modeling is extended to allow for spatially homogeneous steady state solutions that cover a two dimensional region in the flow-density plane. Hence these models fulfill a basic postulate of a three-phase traffic theory proposed by Kerner. This is achieved by a synchronization distance, within which a vehicle always tries to adjust its speed to the one of the vehicle in front. In the CA models presented, the modelling of the free and safe speeds, the slow-to-start rules as well as some contributions to noise are based on the ideas of the Nagel-Schreckenberg type modelling. It is shown that the proposed CA models can be very transparent and still reproduce the two main types of congested patterns (the general pattern and the synchronized flow pattern) as well as their dependence on the flows near an on-ramp, in qualitative agreement with the recently developed continuum version of the three-phase traffic theory [B. S. Kerner and S. L. Klenov. 2002. J. Phys. A: Math. Gen. 35, L31]. These features are qualitatively different than in previously considered CA traffic models. The probability of the breakdown phenomenon (i.e., of the phase transition from free flow to synchronized flow) as function of the flow rate to the on-ramp and of the flow rate on the road upstream of the on-ramp is investigated. The capacity drops at the on-ramp which occur due to the formation of different congested patterns are calculated.