In this paper it is argued that certain stimulus-response learning models which are adequate to represent finite automata (acceptors) are not adequate to represent noninitial state input-output automata (transducers). This circumstance suggests the question whether or not the behavior of animals if satisfactorily modelled by automata is predictive. It is argued in partial answer that there are automata which can be explained in the sense that their transition and output functions can be described (roughly, Hempel-type covering law (...) explanation) while their behaviors are in principle not predictable short of possession of their complete histories or of information concerning present internal states by indirect observation. (shrink)

In this paper, we discuss some formal properties of the model ofbidirectional Optimality Theory that was developed inBlutner (2000). We investigate the conditions under whichbidirectional optimization is a well-defined notion, and we give aconceptually simpler reformulation of Blutner's definition. In thesecond part of the paper, we show that bidirectional optimization can bemodeled by means of finite state techniques. There we rely heavily onthe related work of Frank and Satta (1998) about unidirectionaloptimization.

We explore a network architecture introduced by Elman (1988) for predicting successive elements of a sequence. The network uses the pattern of activation over a set of hidden units from time-step 25-1, together with element t, to predict element t + 1. When the network is trained with strings from a particular finite-state grammar, it can learn to be a perfect finite-state recognizer for the grammar. When the network has a minimal number of hidden units, patterns (...) on the hidden units come to correspond to the nodes of the grammar, although this correspondence is not necessary for the network to act as a perfect finite-state recognizer. We explore the conditions under which the network can carry information about distant sequential contingencies across intervening elements. Such information is maintained with relative ease if it is.. (shrink)

Finite-state methods are applied to determine the consequences of events, represented as strings of sets of fluents. Developed to flesh out events used in natural language semantics, the approach supports reasoning about action in AI, including the frame problem and inertia. Representational and inferential aspects of the approach are explored, centering on conciseness of language, context update and constraint application with bias.

Finite-state methods are applied to the Russell-Wiener notion of time (based on events) and developed into an account of interval relations and temporal propositions. Strings are formed and collected in regular languages and regular relations that are argued to embody temporal relations in their various underspecified guises. The regular relations include retractions that reduce computations by projecting strings down to an appropriate level of granularity, and non-deterministic relations defining notions of partiality within and across such levels.

Finite-state descriptions for temporal semantics are outlined through which to distinguish soft inferences reflecting manners of conceptualization from more robust semantic entailments defined over models. Just what descriptions are built (before being interpreted model-theoretically) and how they are grounded in models of reality explain (upon examination) why some inferences are soft.

Finite-state methods are applied to the Russell-Wiener-Kamp notion of time (based on events) and developed into an account of interval relations and semi-intervals. Strings are formed and collected in regular languages and regular relations that are argued to embody temporal relations in their various underspecified guises. The regular relations include retractions that reduce computations by projecting strings down to an appropriate level of granularity, and notions of containment for partiality within and across such levels.

We define a class of finite state automata acting on transfinite sequences, and use these automata to prove that no singular cardinal can be defined by a monadic second order formula over the ordinals.

Events employed in natural language semantics are characterized in terms of regular languages, each string in which can be regarded as a motion picture. The relevant finite automata then amount to movie cameras/projectors, or more formally, to finite Kripke structures with par- tial valuations. The usual regular constructs (concatena- tion, choice, etc) are supplemented with superposition of strings/automata/languages, realized model-theoretically as conjunction.

Hilary Putnam has argued that computational functionalism cannot serve as a foundation for the study of the mind, as every ordinary open physical system implements every finite-state automaton. I argue that Putnam's argument fails, but that it points out the need for a better understanding of the bridge between the theory of computation and the theory of physical systems: the relation of implementation. It also raises questions about the class of automata that can serve as a basis for (...) understanding the mind. I develop an account of implementation, linked to an appropriate class of automata, such that the requirement that a system implement a given automaton places a very strong constraint on the system. This clears the way for computation to play a central role in the analysis of mind. (shrink)

We present a theory that copes with the dynamics of inconsistent information. A method is set forth to represent possibly inconsistent information by a finite state. Next, finite operations for expansion and contraction of finite states are given. No extra-logical element — a choice function or an ordering over (sets of) sentences — is presupposed in the definition of contraction. Moreover, expansion and contraction are each other's duals. AGM-style characterizations of these operations follow.

The “surge in use of finite-state methods” ([10]) in computational linguistics has largely, if not completely, left semantics untouched. The present paper is directed towards correcting this situation. Techniques explained in [1] are applied to a fragment of temporal semantics through an approach we call finite-state temporality. This proceeds from the intuition of an event as “a series of snapshots” ([15]; see also [12]), equating snapshots with symbols that collectively form our alphabet. A sequence of snapshots (...) then becomes a string over that alphabet, evoking comic/film strips. Jackendoff has, among others, objected to conceptualizing events in terms of snapshots ([8]). To counter these objections, we step up from events-as-strings to event-typesas-regular languages ([5, 6]), recognizing the need for variable granularity. Beyond the introduction of disjunction implicit in the step from a single string up to a set of strings, we obtain a useful logic from the regular operations and a careful choice of the snapshots (constituting our alphabet). (shrink)

This paper considers the existence of finite equational axiomatisations of behavioural equivalences over a calculus of finite state processes. To express even simple properties such as μxE = μxE[E/x] some notation for substitutions is required. Accordingly, the calculus is embedded in a simply typed lambda calculus, allowing such schemas to be expressed as equations between terms containing first order variables. A notion of first order trace congruence over such terms is introduced and used to show that no (...) finite set of such equations is sound and complete for any reasonable equivalence finer than trace equivalence. The intermediate results are then applied to give two nonaxiomatisability results over calculi of regular expressions. (shrink)

Evans & Levinson's (E&L's) major point is that human languages are intriguingly diverse rather than (like animal communication systems) uniform within the species. This does not establish a about language universals, or advance the ill-framed pseudo-debate over universal grammar. The target article does, however, repeat a troublesome myth about Fitch and Hauser's (2004) work on pattern learning in cotton-top tamarins.

In the first part of this paper, two arguments, one by Chomsky, and one by Bar-Hillel and Shamir, are examined in detail and rejected. Both arguments purport to show that the structure of English precludes its having a finite state grammar which correctly enumerates just the well formed sentences of English. In the latter part of the paper I consider the problem of supporting claims about the structure and properties of a natural language when no grammar for the (...) language has yet been accepted. (shrink)

Reichenbach's event, reference and speech times are interpreted semantically by stringing and superposing sets of temporal formulae, structured within regular languages. Notions of continuation branches and of inertia, bound (in a precise sense) by reference time, are developed and applied to the progressive and the perfect.

The problem of finite-time tracking control is discussed for a class of uncertain nonstrict-feedback time-varying state delay nonlinear systems with full-state constraints and unmodeled dynamics. Different from traditional finite-control methods, a C 1 smooth finite-time adaptive control framework is introduced by employing a smooth switch between the fractional and cubic form state feedback, so that the desired fast finite-time control performance can be guaranteed. By constructing appropriate Lyapunov-Krasovskii functionals, the uncertain terms produced by (...) time-varying state delays are compensated for and unmodeled dynamics is coped with by introducing a dynamical signal. In order to avoid the inherent problem of “complexity of explosion” in the backstepping-design process, the DSC technology with a novel nonlinear filter is introduced to simplify the structure of the controller. Furthermore, the results show that all the internal error signals are driven to converge into small regions in a finite time, and the full-state constraints are not violated. Simulation results verify the effectiveness of the proposed method. (shrink)

For any unit vector in an inner product space S, we define a mapping on the system of all ⊥-closed subspaces of S, F(S), whose restriction on the system of all splitting subspaces of S, E(S), is always a finitely additive state. We show that S is complete iff at least one such mapping is a finitely additive state on F(S). Moreover, we give a completeness criterion via the existence of a regular finitely additive state on appropriate (...) systems of subspaces. Finally, the result will be generalized to general inner product spaces. (shrink)

European Journal of Philosophy, EarlyView.

European Journal of Philosophy, Volume 30, Issue 3, Page 943-960, September 2022.

Solid-state processing of metal material is a very complex physical and chemical process, which is coupled by a series of variations including heat transfer, momentum transfer, mass transfer, and phase change. Applying three-dimensional finite element numerical method to the simulation of solid-state processing can perform analysis of metal material’s forging processes before production trial production, can obtain their relevant information such as material flow law, temperature field, and strain field under the minimum physical test conditions, thereby predicting (...) metal material’s forming defects and improving their forging quality. On the basis of summarizing and analyzing previous research works, this paper expounded the current status and significance of solid-state processing of metal materials, elaborated the development background, current status, and future challenges of 3D finite element numerical simulation, introduced the discrimination method and free surface solution method of numerical simulation calculation, conducted finite element model’s geometric assumptions, material selection, element division, model establishment, parameter selection, and initial and boundary condition determination, and simulated and analyzed rheological casting, remelting heating, thixoforming, and rotary piercing processes of metal materials. The results show that the 3D finite element numerical method can not only simulate various processes of flow field, temperature field, stress field, and microstructure in solid-state processing but also can provide a reliable basis for effectively obtaining a reasonable description and finding a more optimized design plan for metal material processing in a short time, which plays an important role in understanding and analyzing solid metal forming process, controlling and optimizing process parameters, guiding and mastering rheological casting, and secondary heating and rotary piercing of metal materials. (shrink)

It will be settled out for the open problem of designing an r-order finite-time state observer for reaction-diffusion genetic regulatory networks with time-varying delays. By assuming the Dirichlet boundary conditions, aiming to estimate the mRNA and protein concentrations via available network measurements. Firstly, sufficient F-T stability conditions for the filtering error system have been investigated via constructing an appropriate Lyapunov–Krasovskii functional and using several integral inequalities and convex technique simultaneously. These conditions are delay-dependent and reaction-diffusion-dependent and can be (...) checked by MATLAB toolbox. Furthermore, a method is proposed to design an r-order F-T state observer, and the explicit expressions of observer gains are given. Finally, a numerical example is presented to illustrate the effectiveness of the proposed method. (shrink)

Formal learning theory constitutes an attempt to describe and explain the phenomenon of learning, in particular of language acquisition. The considerations in this domain are also applicable in philosophy of science, where it can be interpreted as a description of the process of scientific inquiry. The theory focuses on various properties of the process of hypothesis change over time. Treating conjectures as informational states, we link the process of conjecture-change to epistemic update. We reconstruct and analyze the temporal aspect of (...) learning in the context of dynamic and temporal logics of epistemic change. We first introduce the basic formal notions of learning theory and basic epistemic logic. We provide a translation of the components of learning scenarios into the domain of epistemic logic. Then, we propose a characterization of finite identifiability in an epistemic temporal language. In the end we discuss consequences and possible extensions of our work. (shrink)

Recently Lafont [6] showed the finite model property for the multiplicative additive fragment of linear logic (MALL) and for affine logic (LLW), i.e., linear logic with weakening. In this paper, we shall prove the finite model property for intuitionistic versions of those, i.e. intuitionistic MALL (which we call IMALL), and intuitionistic LLW (which we call ILLW). In addition, we shall show the finite model property for contractive linear logic (LLC), i.e., linear logic with contraction, and for its (...) intuitionistic version (ILLC). The finite model property for related substructural logics also follow by our method. In particular, we shall show that the property holds for all of FL and GL - -systems except FL c and GL - c of Ono [11], that will settle the open problems stated in Ono [12]. (shrink)

We define a property for varieties V, the f.r.p. . If it applies to a finitely based V then V is strongly finitely based in the sense of [14], see Theorem 2. Moreover, we obtain finite axiomatizability results for certain propositional logics associated with V, in its generality comparable to well-known finite base results from equational logic. Theorem 3 states that each variety generated by a 2-element algebra has the f.r.p. Essentially this implies finite axiomatizability of a (...) 2-valued logic in any finite language. (shrink)

This work investigates the finite-time control problem for a nonlinear four-tank cross-coupled liquid level system by the port-controlled Hamiltonian model. A fixed-free methodology is exhibited which can be used to simplify the controller design procedure. To get an adjustable convergent gain of the finite-time control, a feasible technique named damping normalization is proposed. A novel parameter autotuning algorithm is given to clarify the principle of choosing parameters of the PCH method. Furthermore, a finite-time controller is designed by (...) a state-error desired Hamiltonian function, and the relationship between the settling time and a parameter is given, which can be applied in practical engineering easily to adjust the settling time according to the industrial need. Finally, simulation and experimental results verify the effectiveness of the proposed algorithm. (shrink)