显示样式： 排序： IF:  GO 导出

PropertyDirected Verification of Recurrent Neural Networks arXiv.cs.FL Pub Date : 20200922
Igor Khmelnitsky; Daniel Neider; Rajarshi Roy; Benoît Barbot; Benedikt Bollig; Alain Finkel; Serge Haddad; Martin Leucker; Lina YeThis paper presents a propertydirected approach to verifying recurrent neural networks (RNNs). To this end, we learn a deterministic finite automaton as a surrogate model from a given RNN using active automata learning. This model may then be analyzed using model checking as verification technique. The term propertydirected reflects the idea that our procedure is guided and controlled by the given

Less Manual Work for Safety Engineers: Towards an Automated Safety Reasoning with Safety Patterns arXiv.cs.FL Pub Date : 20200922
Yuri Gil Dantasfortiss GmbH; Antoaneta Kondevafortiss GmbH; Vivek Nigamfortiss GmbHThe development of safetycritical systems requires the control of hazards that can potentially cause harm. To this end, safety engineers rely during the development phase on architectural solutions, called safety patterns, such as safety monitors, voters, and watchdogs. The goal of these patterns is to control (identified) faults that can trigger hazards. Safety patterns can control such faults by

GreyBox Learning of Register Automata arXiv.cs.FL Pub Date : 20200921
Bharat Garhewal; Frits Vaandrager; Falk Howar; Timo Schrijvers; Toon Lenaerts; Rob SmitsModel learning (a.k.a. active automata learning) is a highly effective technique for obtaining blackbox finite state models of software components. Thus far, generalisation to infinite state systems with inputs/outputs that carry data parameters has been challenging. Existing model learning tools for infinite state systems face scalability problems and can only be applied to restricted classes of

Random Expansion Method for the Generation of Complex Cellular Automata arXiv.cs.FL Pub Date : 20200920
Juan Carlos SeckTuohMora; Norberto HernandezRomero; Joselito MedinaMarin; Genaro J. Martinez; Irving BarraganViteThe emergence of complex behaviors in cellular automata is an area that has been widely developed in recent years with the intention to generate and analyze automata that produce spacemoving patterns or gliders that interact in a periodic background. Frequently, this type of automata has been found through either an exhaustive search or a meticulous construction of the evolution rule. In this study

Proceedings 11th International Symposium on Games, Automata, Logics, and Formal Verification arXiv.cs.FL Pub Date : 20200920
JeanFrancois RaskinUniversité Libre de Bruxelles; Davide BresolinUniversità di PadovaThis volume contains the proceedings of the 11th International Symposium on Games, Automata, Logic and Formal Verification (GandALF 2020). The symposium took place as a fully online event on September 2122, 2020. The GandALF symposium was established by a group of Italian computer scientists interested in mathematical logic, automata theory, game theory, and their applications to the specification

On complex dynamics from reversible cellular automata arXiv.cs.FL Pub Date : 20200918
Juan Carlos SeckTuohMora; Genaro J. Martinez; Norberto HernandezRomero; Joselito MedinaMarin; Irving BarraganViteComplexity has been a recurrent research topic in cellular automata because they represent systems where complex behaviors emerge from simple local interactions. A significant amount of previous research has been conducted proposing instances of complex cellular automata; however, most of the proposed methods are based on a careful search or a meticulous construction of evolution rules. This paper

Bounded Model Checking for Hyperproperties arXiv.cs.FL Pub Date : 20200918
TzuHan Hsu; Cesar Sanchez; Borzoo BonakdarpourThis paper introduces the first bounded model checking (BMC) algorithm for hyperproperties expressed in HyperLTL. Just as the classic BMC technique for LTL primarily aiming at finding bugs, our approach also targets identifying counterexamples. LTL describes the property of individual traces and BMC for LTL is reduced to SAT solving. HyperLTL allows explicit and simultaneous quantification over traces

ACSSq: Algorithmic complexity for short strings via quantum accelerated approach arXiv.cs.FL Pub Date : 20200918
Aritra Sarkar; Koen BertelsIn this research we present a quantum circuit for estimating algorithmic complexity using the coding theorem method. This accelerates inferring algorithmic structure in data for discovering causal generative models. The computation model is restricted in time and space resources to make it computable in approximating the target metrics. The quantum circuit design based on our earlier work that allows

Typestates to Automata and back: a tool arXiv.cs.FL Pub Date : 20200917
André TrindadeNOVA School of Science and Technology; João MotaNOVA School of Science and Technology; António RavaraNOVA School of Science and TechnologyDevelopment of software is an iterative process. Graphical tools to represent the relevant entities and processes can be helpful. In particular, automata capture well the intended execution flow of applications, and are thus behind many formal approaches, namely behavioral types. Typestateoriented programming allow us to model and validate the intended protocol of applications, not only providing

HigherOrder Nonemptiness Step by Step arXiv.cs.FL Pub Date : 20200917
Paweł ParysWe show a new simple algorithm that checks whether a given higherorder grammar generates a nonempty language of trees. The algorithm amounts to a procedure that transforms a grammar of order n to a grammar of order n1, preserving nonemptiness, and increasing the size only exponentially. After repeating the procedure n times, we obtain a grammar of order 0, whose nonemptiness can be easily checked

An Abstract Framework for Choreographic Testing arXiv.cs.FL Pub Date : 20200917
Alex CotoGSSI; Roberto GuancialeKTH; Emilio TuostoGSSIWe initiate the development of a modeldriven testing framework for messagepassing systems. The notion of test for communicating systems cannot simply be borrowed from existing proposals. Therefore, we formalize a notion of suitable distributed tests for a given choreography and devise an algorithm that generates tests as projections of global views. Our algorithm abstracts away from the actual projection

A categorical duality for algebras of partial functions arXiv.cs.FL Pub Date : 20200916
Brett McLeanWe prove a categorical duality between a class of abstract algebras of partial functions and a class of (small) topological categories. The algebras are the isomorphs of collections of partial functions closed under the operations of composition, antidomain, range, and preferential union (or 'override'). The topological categories are those whose space of objects is a Stone space, source map is a local

Automatic Trajectory Synthesis for RealTime Temporal Logic arXiv.cs.FL Pub Date : 20200914
Rafael Rodrigues da Silva; Vince Kurtz; Hai LinMany safetycritical systems must achieve highlevel task specifications with guaranteed safety and correctness. Much recent progress towards this goal has been made through controller synthesis from temporal logic specifications. Existing approaches, however, have been limited to relatively short and simple specifications. Furthermore, existing methods either consider some prior discretization of

On Computability, Learnability and Extractability of Finite State Machines from Recurrent Neural Networks arXiv.cs.FL Pub Date : 20200910
Reda MarzoukThis work aims at shedding some light on connections between finite state machines (FSMs), and recurrent neural networks (RNNs). Examined connections in this master's thesis is threefold: the extractability of finite state machines from recurrent neural networks, learnability aspects and computationnal links. With respect to the former, the longstanding clustering hypothesis of RNN hidden state space

Pushdown and LempelZiv Depth arXiv.cs.FL Pub Date : 20200910
Liam Jordon; Philippe MoserThis paper expands upon existing and introduces new formulations of Bennett's logical depth. In previously published work by Jordon and Moser, notions of finitestatedepth and pushdowndepth were examined and compared. These were based on finitestate transducers and information lossless pushdown compressors respectively. Unfortunately a full separation between the two notions was not established

Equations in virtually abelian groups: languages and growth arXiv.cs.FL Pub Date : 20200908
Alex Evetts; Alex LevineThis paper explores the nature of the solution sets of systems of equations in virtually abelian groups. We view this question from two angles. From a formal language perspective, we prove that the set of solutions to a system of equations forms an EDT0L language, with respect to a natural normal form. Looking at growth, we show that the growth series of the language of solutions is rational. Furthermore

On prefix palindromic length of automatic words arXiv.cs.FL Pub Date : 20200907
Anna E. Frid; Enzo Laborde; Jarkko PeltomäkiThe prefix palindromic length $\mathrm{PPL}_{\mathbf{u}}(n)$ of an infinite word $\mathbf{u}$ is the minimal number of concatenated palindromes needed to express the prefix of length $n$ of $\mathbf{u}$. Since 2013, it is still unknown if $\mathrm{PPL}_{\mathbf{u}}(n)$ is unbounded for every aperiodic infinite word $\mathbf{u}$, even though this has been proven for almost all aperiodic words. At the

A smallstep approach to multitrace checking against interactions arXiv.cs.FL Pub Date : 20200903
Erwan Mahe; Boutheina Bannour; Christophe Gaston; Arnault Lapitre; Pascale Le GallInteraction models describe the exchange of messages between the different components of distributed systems. We have previously defined a smallstep operational semantics for interaction models. The paper extends this work by presenting an approach for checking the validity of multitraces against interaction models. A multitrace is a collection of traces (sequences of emissions and receptions),

Notes on Equivalence and Minimization of Weighted Automata arXiv.cs.FL Pub Date : 20200902
Stefan KieferThis set of notes reproves known results on weighted automata (over a field, also known as multiplicity automata). The text offers a unified view on theorems and proofs that have appeared in the literature over decades and were written in different styles and contexts. None of the results reported here are claimed to be new. The content centres around fundamentals of equivalence and minimization,

Tree Automata for Extracting Consensus from Partial Replicas of a Structured Document arXiv.cs.FL Pub Date : 20200902
Maurice Tchoupé Tchendji; Milliam Maxime Zekeng NdadjiIn an asynchronous cooperative editing workflow of a structured document, each of the coauthors receives in the different phases of the editing process, a copy of the document to insert its contribution. For confidentiality reasons, this copy may be only a partial replica containing only parts of the (global) document which are of demonstrated interest for the considered coauthor. Note that some

Closure under Coupling of CellularDEVS for the Optimization of Memory Resource: Wildfire Spread Case Study arXiv.cs.FL Pub Date : 20200901
Youcef Dahmani; Maamar El Amine Hamri; Nesrine DrioucheThe present work aims to show one of the advantages of using the property of closure under coupling in the DEVS specification. The advantage concerned in this paper attempts to address the need for memory resources during the simulation of systems by cellularDEVS. This improvement of performance is based on the usage of the property closure under coupling in the DEVS formalism. With this property

Recognition and Complexity Results for Projection Languages of TwoDimensional Automata arXiv.cs.FL Pub Date : 20200901
Taylor J. Smith; Kai SalomaaThe row projection (resp., column projection) of a twodimensional language $L$ is the onedimensional language consisting of all first rows (resp., first columns) of each twodimensional word in $L$. The operation of row projection has previously been studied under the name "frontier language", and previous work has focused on one and twodimensional language classes. In this paper, we study projections

Computability by Monadic SecondOrder Logic arXiv.cs.FL Pub Date : 20200827
Joost EngelfrietA binary relation on graphs is recursively enumerable if and only if it can be computed by a formula in monadic secondorder logic. The latter means that the formula defines a set of graphs, in the usual way, such that each "computation graph" in that set determines a pair consisting of an input graph and an output graph.

Languages recognised by finite semigroups, and their generalisations to objects such as trees and graphs, with an emphasis on definability in monadic secondorder logic arXiv.cs.FL Pub Date : 20200826
Mikołaj BojańczykThese are lecture notes on the algebraic approach to regular languages. The classical algebraic approach is for finite words; it uses semigroups instead of automata. However, the algebraic approach can be extended to structures beyond words, e.g.~infinite words, or trees or graphs. The purpose of this book is to describe the algebraic approach in a way that covers these extensions.

Optimal Strategies in Weighted Limit Games (full version) arXiv.cs.FL Pub Date : 20200826
Aniello Murano; Sasha Rubin; Martin ZimmermannWe prove the existence and computability of optimal strategies in weighted limit games, zerosum infiniteduration games with a B\"uchistyle winning condition requiring to produce infinitely many play prefixes that satisfy a given regular specification. Quality of plays is measured in the maximal weight of infixes between successive play prefixes that satisfy the specification.

Concatenation Operations and Restricted Variants of TwoDimensional Automata arXiv.cs.FL Pub Date : 20200825
Taylor J. Smith; Kai SalomaaA twodimensional automaton operates on arrays of symbols. While a standard (fourway) twodimensional automaton can move its input head in four directions, restricted twodimensional automata are only permitted to move their input heads in three or two directions; these models are called threeway and twoway twodimensional automata, respectively. In two dimensions, we may extend the notion of concatenation

Automated Trajectory Synthesis for UAV Swarms Based on Resilient Data Collection Objectives arXiv.cs.FL Pub Date : 20200825
A H M Jakaria; Mohammad Ashiqur Rahman; Matthew Anderson; Steven DragerThe use of Unmanned Aerial Vehicles (UAVs) for collecting data from remotely located sensor systems is emerging. The data can be timesensitive and require to be transmitted to a data processing center. However, planning the trajectory of a collaborative UAV swarm depends on multifold constraints, such as data collection requirements, UAV maneuvering capacity, and budget limitation. Since a UAV may

Entropia: A Family of EntropyBased Conformance Checking Measures for Process Mining arXiv.cs.FL Pub Date : 20200821
Artem Polyvyanyy; Hanan Alkhammash; Claudio Di Ciccio; Luciano GarcíaBañuelos; Anna Kalenkova; Sander J. J. Leemans; Jan Mendling; Alistair Moffat; Matthias WeidlichThis paper presents a commandline tool, called Entropia, that implements a family of conformance checking measures for process mining founded on the notion of entropy from information theory. The measures allow quantifying classical nondeterministic and stochastic precision and recall quality criteria for process models automatically discovered from traces executed by ITsystems and recorded in their

Visual Designing and Debugging of Deterministic FiniteState Machines in FSM arXiv.cs.FL Pub Date : 20200821
Marco T. MorazánSeton Hall University; Joshua M. SchappelSeton Hall University; Sachin MahashabdeSeton Hall UniversityThis article presents a visualization tool for designing and debugging deterministic finitestate machines in FSM  a domain specific language for the automata theory classroom. Like other automata visualization tools, users can edit machines and observe their execution, given some input. Unlike other automata visualization tools, the user is not burdened nor distracted with rendering a machine as

On the Use of Quasiorders in Formal Language Theory arXiv.cs.FL Pub Date : 20200820
Pedro ValeroIn this thesis we use quasiorders on words to offer a new perspective on two wellstudied problems from Formal Language Theory: deciding language inclusion and manipulating the finite automata representations of regular languages. First, we present a generic quasiorderbased framework that, when instantiated with different quasiorders, yields different algorithms (some of them new) for deciding language

Novel Results on the Number of Runs of the BurrowsWheelerTransform arXiv.cs.FL Pub Date : 20200819
Sara Giuliani; Shunsuke Inenaga; Zsuzsanna Lipták; Nicola Prezza; Marinella Sciortino; Anna ToffanelloThe BurrowsWheelerTransform (BWT), a reversible string transformation, is one of the fundamental components of many current data structures in string processing. It is central in data compression, as well as in efficient query algorithms for sequence data, such as webpages, genomic and other biological sequences, or indeed any textual data. The BWT lends itself well to compression because its number

Abelian Closures of Infinite Binary Words arXiv.cs.FL Pub Date : 20200818
Svetlana Puzynina; Markus A. WhitelandTwo finite words $u$ and $v$ are called Abelian equivalent if each letter occurs equally many times in both $u$ and $v$. The abelian closure $\mathcal{A}(\mathbf{x})$ of (the shift orbit closure of) an infinite word $\mathbf{x}$ is the set of infinite words $\mathbf{y}$ such that, for each factor $u$ of $\mathbf{y}$, there exists a factor $v$ of $\mathbf{x}$ which is abelian equivalent to $u$. The

On the Power of Automata Minimization in Temporal Synthesis arXiv.cs.FL Pub Date : 20200815
Shufang Zhu; Lucas M. Tabajara; Geguang Pu; Moshe Y. VardiReactive synthesis is the problem of automatically constructing a reactive system from a formal specification, with the guarantee that the executions of the system align with the specification. The specification is often described in temporal logic. Some types of specifications can be converted into deterministic finite automata (DFA) as an intermediate step in synthesis, thus benefiting from the fact

Automatic Translation of tockCSP into Timed Automata arXiv.cs.FL Pub Date : 20200816
Abdulrazaq Abba; Ana Cavalcanti; Jeremy JacobThe process algebra tockCSP provides textual notations for modelling discretetime behaviours, with the support of various tools for verification. Similarly, automatic verification of Timed Automata (TA) is supported by the realtime verification toolbox UPPAAL. TA and tockCSP differ in both modelling and verification approaches. For instance, liveness requirements are difficult to specify with the

Stronger Lower Bounds for Polynomial Time Problems arXiv.cs.FL Pub Date : 20200815
András Z. Salamon; Michael WeharWe reinvestigate the classical topic of limited nondeterminism, to prove stronger conditional lower bounds for polynomial time problems. In particular, we show that CircuitSAT for circuits with m gates and log(m) inputs (denoted by logCircuitSAT) is not solvable in quasilinear time unless the exponential time hypothesis (ETH) is false. In other words, a polynomial time improvement for logCircuitSAT

An Efficient Model Inference Algorithm for Learningbased Testing of Reactive Systems arXiv.cs.FL Pub Date : 20200814
Muddassar A. SindhuLearningbased testing (LBT) is an emerging methodology to automate iterative blackbox requirements testing of software systems. The methodology involves combining model inference with model checking techniques. However, a variety of optimisations on model inference are necessary in order to achieve scalable testing for large systems. In this paper we describe the IKL learning algorithm which is an

Resilient AbstractionBased Controller Design arXiv.cs.FL Pub Date : 20200814
Stanly SamuelIndian Institute of Science; Kaushik MallikMax Planck Institute for Software Systems; AnneKathrin SchmuckMax Planck Institute for Software Systems; Daniel NeiderMax Planck Institute for Software SystemsWe consider the computation of resilient controllers for perturbed nonlinear dynamical systems w.r.t. lineartime temporal logic specifications. We address this problem through the paradigm of AbstractionBased Controller Design (ABCD) where a finite state abstraction of the perturbed system dynamics is constructed and utilized for controller synthesis. In this context, our contribution is twofold:

State Complexity Bounds for Shuffle and Iterated Shuffle Combined with the Commutative Closure on Group Languages arXiv.cs.FL Pub Date : 20200812
Stefan HoffmannWe show that the shuffle and iterated shuffle of the commutative closure of a group language is regular, and derive state bounds for resulting automata. In particular, for commutative group languages the iterated shuffle is a regularity preserving operation. For the shuffle of two commutative group languages, we give a sharp bound. For applying the shuffle operation to the commutative closure of multiple

Reactive Synthesis from Extended Bounded Response LTL Specifications arXiv.cs.FL Pub Date : 20200812
Alessandro Cimatti; Luca Geatti; Nicola Gigante; Angelo Montanari; Stefano TonettaReactive synthesis is a key technique for the design of correctbyconstruction systems and has been thoroughly investigated in the last decades. It consists in the synthesis of a controller that reacts to environment's inputs satisfying a given temporal logic specification. Common approaches are based on the explicit construction of automata and on their determinization, which limit their scalability

On the number of useful objects in P systems with active membranes arXiv.cs.FL Pub Date : 20200811
Zsolt Gazdag; Károly Hajagos; Szabolcs IvánIn this paper we investigate the number of objects actually used in the terminating computations of a certain variant of polarizationless P systems with active membranes. The P systems we consider here have no incommunication rules and have no different rules triggered by the same object to manipulate the same membrane. We show that if we consider such a P system $\Pi$ and its terminating computation

An Ansatz for undecidable computation in RNAworld automata arXiv.cs.FL Pub Date : 20200812
Adam J. Svahn; Mikhail ProkopenkoIn this Ansatz we consider theoretical constructions of RNA polymers into automata, a form of computational structure. The basis for transitions in our automata are plausible RNAworld enzymes that may perform ligation or cleavage. Limited to these operations, we construct RNA automata of increasing complexity; from the Finite Automaton (RNAFA) to the Turing Machine equivalent 2stack PDA (RNA2PDA)

Automata and finite order elements in the Nottingham group arXiv.cs.FL Pub Date : 20200811
Jakub Byszewski; Gunther Cornelissen; Djurre TijsmaThe Nottingham group at 2 is the group of (formal) power series $t+a_2 t^2+ a_3 t^3+ \cdots$ in the variable $t$ with coefficients $a_i$ from the field with two elements, where the group operation is given by composition of power series. The depth of such a series is the largest $d\geq 1$ for which $a_2=\dots=a_d=0$. Only a handful of power series of finite order are explicitly known through a formula

On the Complexity of the Universality and Inclusion Problems for Unambiguous ContextFree Grammars arXiv.cs.FL Pub Date : 20200807
Lorenzo ClementeUniversity of WarsawWe study the computational complexity of universality and inclusion problems for unambiguous finite automata and contextfree grammars. We observe that several such problems can be reduced to the universality problem for unambiguous contextfree grammars. The latter problem has long been known to be decidable and we propose a PSPACE algorithm that works by reduction to the zeroness problem of recurrence

SafetyOps arXiv.cs.FL Pub Date : 20200811
Umair SiddiqueSafety assurance is a paramount factor in the largescale deployment of various autonomous systems (e.g., selfdriving vehicles). However, the execution of safety engineering practices and processes have been challenged by an increasing complexity of modern safetycritical systems. This attribute has become more critical for autonomous systems that involve artificial intelligence (AI) and datadriven

Verifying Safety Properties of Inductively Defined Parameterized Systems arXiv.cs.FL Pub Date : 20200810
Marius Bozga; Radu IosifWe introduce a term algebra as a new formal specification language for the architectures of distributed systems consisting of a finite yet unbounded number of components. The language allows to describe infinite sets of architectures that share the same pattern, using a set of recursive definitions, similar to the ones used to describe algebraic data types. Further, we give a verification method for

Blocksequences of klocal Words arXiv.cs.FL Pub Date : 20200808
Pamela Fleischmann; Lukas Haschke; Florin Manea; Dirk Nowotka; Cedric Tsatia Tsida; Judith WiedenbeckThe locality of words is a relatively young structural complexity measure, introduced by Day et al. in 2017 in order to define classes of patterns with variables which can be matched in polynomial time. The main tool used to compute the locality of a word is called marking sequence: an ordering of the distinct letters occurring in the respective order. Once a marking sequence is defined, the letters

From QuasiDominions to Progress Measures arXiv.cs.FL Pub Date : 20200810
Massimo Benerecetti; Daniele Dell'Erba; Marco Faella; Fabio MogaveroIn this paper we revisit the approaches to the solution of parity games based on progress measures and show how the notion of quasi dominions can be integrated with those approaches. The idea is that, while progress measure based techniques typically focus on one of the two players, little information is gathered on the other player during the solution process. Adding quasi dominions provides additional

Safe and efficient collision avoidance control for autonomous vehicles arXiv.cs.FL Pub Date : 20200810
Qiang Wang; Dachuan Li; Joseph SifakisWe study a novel principle for safe and efficient collision avoidance that adopts a mathematically elegant and general framework making as much as possible abstraction of the controlled vehicle's dynamics and of its environment. Vehicle dynamics is characterized by precomputed functions for accelerating and braking to a given speed. Environment is modeled by a function of time giving the free distance

From Well Structured Transition Systems to Program Verification arXiv.cs.FL Pub Date : 20200807
Alain FinkelUniversite ParisSaclay, ENS ParisSaclay, CNRSWe describe the use of the theory of WSTS for verifying programs.

Cayley PolynomialTime Computable Groups arXiv.cs.FL Pub Date : 20200806
Dmitry Berdinsky; Murray Elder; Prohrak KruengthomyaWe propose a new generalisation of Cayley automatic groups, varying the time complexity of computing multiplication, and language complexity of the normal form representatives. We first consider groups which have normal form language in the class $\mathcal C$ and multiplication by generators computable in linear time on a certain restricted Turing machine model (positionfaithful onetape). We show

Glushkov's construction for functional subsequential transducers arXiv.cs.FL Pub Date : 20200805
Aleksander MendozaDrosikGlushkov's construction has many interesting properties, however, they become even more evident when applied to transducers. This article strives to show the unusual link between functional subsequential finite state transducers and Glushkov's construction. The methods and algorithms presented here were used to implement compiler of regular expressions.

The Intersection of $3$Maximal Submonids arXiv.cs.FL Pub Date : 20200804
Giuseppa Castiglione; Štěpán HolubVery little is known about the structure of the intersection of two $k$generated monoids of words, even for $k=3$. Here we investigate the case of $k$maximal monoids, that is, monoids whose basis of cardinality $k$ cannot be nontrivially decomposed into at most $k$ words. We characterize the intersection in the case of two $3$maximal monoids.

Asymptotic Approximation by Regular Languages arXiv.cs.FL Pub Date : 20200804
Ryoma Sin'yaThis paper investigates a new property of formal languages called REGmeasurability where REG is the class of regular languages. Intuitively, a language \(L\) is REGmeasurable if there exists an infinite sequence of regular languages that "converges" to \(L\). A language without REGmeasurability has a complex shape in some sense so that it can not be (asymptotically) approximated by regular languages

Verifying Pufferfish Privacy in Hidden Markov Models arXiv.cs.FL Pub Date : 20200804
Depeng Liu; Bowyaw Wang; Lijun ZhangPufferfish is a Bayesian privacy framework for designing and analyzing privacy mechanisms. It refines differential privacy, the current gold standard in data privacy, by allowing explicit prior knowledge in privacy analysis. Through these privacy frameworks, a number of privacy mechanisms have been developed in literature. In practice, privacy mechanisms often need be modified or adjusted to specific

On the Expressive Power of HigherOrder Pushdown Systems arXiv.cs.FL Pub Date : 20200803
Paweł ParysWe show that deterministic collapsible pushdown automata of second order can recognize a language that is not recognizable by any deterministic higherorder pushdown automaton (without collapse) of any order. This implies that there exists a tree generated by a second order collapsible pushdown system (equivalently, by a recursion scheme of second order) that is not generated by any deterministic higherorder

Theta palindromes in theta conjugates arXiv.cs.FL Pub Date : 20200801
Kalpana Mahalingam; Palak Pandoh; Anuran MaityA DNA string is a WatsonCrick (WK) palindrome when the complement of its reverse is equal to itself. The WatsonCrick mapping $\theta$ is an involution that is also an antimorphism. $\theta$conjugates of a word is a generalisation of conjugates of a word that incorporates the notion of WKinvolution $\theta$. In this paper, we study the distribution of palindromes and WatsonCrick palindromes, also

Implicit automata in typed $λ$calculi II: streaming transducers vs categorical semantics arXiv.cs.FL Pub Date : 20200803
Lê Thành DũngTito; Nguyên; Camille Noûs; Pierre PradicWe characterize regular string transductions as programs in a linear $\lambda$calculus with additives. One direction of this equivalence is proved by encoding copyless streaming string transducers (SSTs), which compute regular functions, into our $\lambda$calculus. For the converse, we consider a categorical framework for defining automata and transducers over words, which allows us to relate register

MDA Models and PIM/PSM Transformations Using Extended Automata arXiv.cs.FL Pub Date : 20200802
David Dayan; Rivka Kaplinsky; Aryeh Wiesen; Simon BlochThis paper proposes a model of execution platform for the OMG request of a generic PlatformIndependentModel (PIM) allowing realization of the Model Driven Architecture (MDA) standard. We propose AMDA (Automata based MDA), a method based on the use of parallel automata, which can be a common tool for building a PIM from UML diagrams (including OCL) and transforming the PIM to PSM automata and further

A note on the class of languages generated by Fsystems over regular languages arXiv.cs.FL Pub Date : 20200730
Jorge C. LuceroAn Fsystem is a computational model that performs a folding operation on strings of a given language, following directions coded on strings of another given language. This note considers the case in which both given languages are regular, and it shows that such Fsystem generates linear contextfree languages. The demonstration is based on constructing a oneturn pushdown automaton for the generated

Dimension Groups and Dynamical Systems arXiv.cs.FL Pub Date : 20200730
Fabien Durand; Dominique PerrinWe give a description of the link between topological dynamical systems and their dimension groups. The focus is on minimal systems and, in particular, on substitution shifts. We describe in detail the various classes of systems including Sturmian shifts and interval exchange shifts.