Related papers: Towards a classification of Lindenmayer systems
This paper defines a language L for specifying LFG grammars. This enables constraints on LFG's composite ontology (c-structures synchronised with f-structures) to be stated directly; no appeal to the LFG construction algorithm is needed. We…
We propose a cognitively and linguistically motivated set of sorts for lexical semantics in a compositional setting: the classifiers in languages that do have such pronouns. These sorts are needed to include lexical considerations in a…
We study two subspace systems in a separable infinite-dimensional Hilbert space up to (bounded) isomorphism. One of the main result of this paper is the following: Isomorphism classes of two subspace systems given by graphs of bounded…
Learning Spaces are certain set systems that are applied in the mathematical modeling of education. We propose a suitable compression (without loss of information) of such set systems to facilitate their logical and statistical analysis.…
Grammatical inference consists in learning a language or a grammar from data. In this paper, we consider a number of models for inferring a non-deterministic finite automaton (NFA) with 3 sorts of states, that must accept some words, and…
We investigate the problem of safety verification of infinite-state parameterized programs that are formed based on a rich class of topologies. We introduce a new proof system, called parametric proof spaces, which exploits the underlying…
The family, L(INDLIN), of languages generated by linear indexed grammars has been studied in the literature. It is known that the Parikh image of every language in L(INDLIN) is semi-linear. However, there are bounded semi linear languages…
Shape grammars compute over shapes which are defined in the universe $U^*$. Shapes in the universe $U^*$ are analogous to line drawings that can be physically realized in the plane. Any shape is embedded or contained in an arrangement of…
The Grassmannian model represents harmonic maps from Riemann surfaces by families of shift-invariant subspaces of a Hilbert space. We impose a natural symmetry condition on the shift-invariant subspaces that corresponds to considering an…
We present an algebraic view on logic programming, related to proof theory and more specifically linear logic and geometry of interaction. Within this construction, a characterization of logspace (deterministic and non-deterministic)…
We study set-valued mappings defined by solution sets of parametric systems of equalities and inequalities. We prove Lipschitz-like continuity of these mappings under relaxed constant rank constraint qualification.
Multivariate information theory provides a general and principled framework for understanding how the components of a complex system are connected. Existing analyses are coarse in nature -- built up from characterizations of discrete…
Graded Lagrangian formalism in terms of a Grassmann-graded variational bicomplex on graded manifolds is developed in a very general setting. This formalism provides the comprehensive description of reducible degenerate Lagrangian systems,…
A discussion is given of the quantisation of a physical system with finite degrees of freedom subject to a Hamiltonian constraint by treating time as a constrained classical variable interacting with an unconstrained quantum state. This…
We introduce a hierarchy of linear systems for showing that a given subspace of pure quantum states is entangled (i.e., contains no product states). This hierarchy outperforms known methods already at the first level, and it is complete in…
We give a further investigation of the range criterion and Low-to-High Rank Generating Mode (LHRGM) introduced in \cite{Chen}, which can be used for the classification of $2\times{M}\times{N}$ states under reversible local filtering…
We present an approach to type theory in which the typing judgments do not have explicit contexts. Instead of judgments of shape "Gamma |- A : B", our systems just have judgments of shape "A : B". A key feature is that we distinguish free…
Algorithms which learn environments represented by automata in the past have had complexity scaling with the number of states in the automaton, which can be exponentially large even for automata recognizing regular expressions with a small…
We give an interpretation of J-spaces in terms of symmetric spectra in symmetric sequences. As application we show how one can define graded endomorphism objects in a general situation. As example we discuss the motivic bigraded…
Under some natural hypotheses, we show that if a multilinear mapping belongs to some Banach multlinear ideal, then it can be approximated by multilinear mappings belonging to the same ideal whose Arens extensions simultaneously attain their…