Related papers: Pushdown automata, lambda-graph systems and C*-alg…
We present a passive automata learning algorithm that can extract automata from recurrent networks with very large or even infinite alphabets. Our method combines overapproximations from the field of Abstract Interpretation and passive…
Let $\Lambda = \mathbb{Z}^n$ with lexicographic ordering. $\Lambda$ is a totally ordered group. Let $X = \Lambda^+ * \Lambda^+$. Then $X$ is a $\Lambda$-tree. Analogous to the construction of graph $C^*$-algebras, we form a groupoid whose…
The heterogeneity between high-level vision-language understanding and low-level action control remains a fundamental challenge in robotic manipulation. Although recent methods have advanced task-specific action alignment, they often…
Let $A$ be an $N \times N $ irreducible matrix with entries in $\{0,1\}$. We define the topological Markov Dyck shift $D_A$ to be a nonsofic subshift consisting of the $2N$ brackets $(_1,...,(_N,)_1,...,)_N$ with both standard bracket rule…
We present PAPNI, a passive automata learning algorithm capable of learning deterministic context-free grammars, which are modeled with visibly deterministic pushdown automata. PAPNI is a generalization of RPNI, a passive automata learning…
We propose an automata theoretic learning algorithm for the identification of black-box switched linear systems whose switching logics are event-driven. A switched system is expressed by a deterministic finite automaton (FA) whose node…
The linear-time simulation of 2-way deterministic pushdown automata (2DPDA) by the Cook and Jones constructions is revisited. Following the semantics-based approach by Jones, an interpreter is given which, when extended with random-access…
We design a family of program analyses for JavaScript that make no approximation in matching calls with returns, exceptions with handlers, and breaks with labels. We do so by starting from an established reduction semantics for JavaScript…
Given a finitely aligned $k$-graph $\Lambda$, we let $\Lambda^i$ denote the $(k-1)$-graph formed by removing all edges of degree $e_i$ from $\Lambda$. We show that the Toeplitz-Cuntz-Krieger algebra of $\Lambda$, denoted by…
The simulation of deterministic pushdown automata defined over a one-letter alphabet by finite state automata is investigated from a descriptional complexity point of view. We show that each unary deterministic pushdown automaton of size s…
In this paper, we develop a theory of equipped graded graphs (or Bratteli diagrams) and an alternative theory of projective limits of finite-dimensional simplices. An equipment is an additional structure on the graph, namely, a system of…
An automorphism $\beta$ of a $k$-graph $\Lambda$ induces a crossed product $C^* ( \Lambda ) \rtimes_\beta \mathbb{Z}$ which is isomorphic to a $(k+1)$-graph algebra $C^* ( \Lambda \times_\beta \mathbb{Z})$. In this paper we show how this…
We define the categorical cohomology of a k-graph \Lambda\ and show that the first three terms in this cohomology are isomorphic to the corresponding terms in the cohomology defined in our previous paper. This leads to an alternative…
This paper introduces a new machine architecture for evaluating lambda expressions using the normal-order reduction, which guarantees that every lambda expression will be evaluated if the expression has its normal form and the system has…
In this paper we regard languages and their acceptors - such as deterministic or weighted automata, transducers, or monoids - as functors from input categories that specify the type of the languages and of the machines to categories that…
Engelfriet and Vereijken have shown that linear graph grammars based on hyperedge replacement generate graph languages that can be considered as interpretations of regular string languages over typed symbols. In this paper we show that…
This papers presents a general framework for the uniform random generation of deterministic real-time accessible pushdown automata. A polynomial time algorithm to randomly generate a pushdown automaton having a fixed stack operations total…
We present here the proof for an alternative procedure to convert a Push Down Automata (PDA) into a Context Free Grammar (CFG). The procedure involves intermediate conversion to a single state PDA. In view of the authors, this conversion is…
Extensive LLM applications demand efficient structured generations, particularly for LR(1) grammars, to produce outputs in specified formats (e.g., JSON). Existing methods primarily parse LR(1) grammars into a pushdown automaton (PDA),…
The strength of a dynamic language is also its weakness: run-time flexibility comes at the cost of compile-time predictability. Many of the hallmarks of dynamic languages such as closures, continuations, various forms of reflection, and a…