Weighted Recognizability over Infinite Alphabets

We introduce weighted variable automata over infinite alphabets and commutative semirings. We prove that the class of their behaviors is closed under sum, and under scalar, Hadamard, Cauchy, and shuffle products, as well as star operation. Furthermore, we consider rational series over infinite alphabets and we state a Kleene-Schützenberger theorem. We introduce a weighted monadic second order logic and a weighted linear dynamic logic over infinite alphabets and investigate their relation to weighted variable automata. An application of our theory, to series over the Boolean semiring, concludes to new results for the class of languages accepted by variable automata.

[1]  Thomas Schwentick,et al.  Two-variable logic on data words , 2011, TOCL.

[2]  Marcel Paul Schützenberger,et al.  On the Definition of a Family of Automata , 1961, Inf. Control..

[3]  Paul Gastin,et al.  A unifying survey on weighted logics and weighted automata , 2018, Soft Comput..

[4]  Pavol Cerný,et al.  Synthesis from incompatible specifications , 2012, EMSOFT '12.

[5]  Fu Song,et al.  On temporal logics with data variable quantifications: Decidability and complexity , 2016, Inf. Comput..

[6]  Domagoj Vrgoc.  Using variable automata for querying data graphs , 2015, Inf. Process. Lett..

[7]  Tony Tan.  Graph Reachability and Pebble Automata over Infinite Alphabets , 2009, 2009 24th Annual IEEE Symposium on Logic In Computer Science.

[8]  Jürgen Dassow,et al.  P Finite Automata and Regular Languages over Countably Infinite Alphabets , 2006, Workshop on Membrane Computing.

[9]  Luc Segoufin.  Automata and Logics for Words and Trees over an Infinite Alphabet , 2006, CSL.

[10]  Orna Grumberg,et al.  Model Checking Systems and Specifications with Parameterized Atomic Propositions , 2012, ATVA.

[11]  Pablo Barceló,et al.  Parameterized regular expressions and their languages , 2011, Theor. Comput. Sci..

[12]  Qin Lin,et al.  Learning Deterministic Finite Automata from Infinite Alphabets , 2016, ICGI.

[13]  C. C. Elgot.  Decision problems of finite automata design and related arithmetics , 1961 .

[14]  Giuseppe De Giacomo,et al.  Linear Temporal Logic and Linear Dynamic Logic on Finite Traces , 2013, IJCAI.

[15]  Nissim Francez,et al.  Finite-Memory Automata , 1994, Theor. Comput. Sci..

[16]  J. Büchi.  Weak Second‐Order Arithmetic and Finite Automata , 1960 .

[17]  Orna Grumberg,et al.  Variable Automata over Infinite Alphabets , 2010, LATA.

[18]  Nissim Francez,et al.  Finite-State Unification Automata and Relational Languages , 1994, Inf. Comput..

[19]  Gian Luigi Ferrari,et al.  Nominal Automata for Resource Usage Control , 2012, CIAA.

[20]  Ludwig Staiger,et al.  Ω-languages , 1997 .

[21]  Yannick Chevalier,et al.  Fresh-Variable Automata: Application to Service Composition , 2013, 2013 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing.

[22]  George Rahonis,et al.  Variable Tree Automata over Infinite Ranked Alphabets , 2011, CAI.

[23]  Thomas Schwentick,et al.  Finite state machines for strings over infinite alphabets , 2004, TOCL.

[24]  M. Praveen,et al.  Nesting Depth of Operators in Graph Database Queries: Expressiveness Vs. Evaluation Complexity , 2016, ICALP.

[25]  Manfred Droste,et al.  Weighted Automata and Regular Expressions over Valuation Monoids , 2011, Int. J. Found. Comput. Sci..

[26]  Maria Pittou,et al.  Weighted Variable Automata over Infinite Alphabets , 2014, CIAA.

[27]  Thomas Schwentick,et al.  Towards Regular Languages over Infinite Alphabets , 2001, MFCS.

[28]  Jacques Sakarovitch,et al.  Elements of Automata Theory , 2009 .

[29]  Manfred Droste,et al.  Weighted Linear Dynamic Logic , 2016, GandALF.

[30]  Tony Tan,et al.  Regular Expressions for Languages over Infinite Alphabets , 2004, Fundam. Informaticae.

[31]  M. Droste,et al.  Handbook of Weighted Automata , 2009 .

[32]  Yannick Chevalier,et al.  Guarded Variable Automata over Infinite Alphabets , 2013, ArXiv.

[33]  Frédéric Peschanski,et al.  The Omniscient Garbage Collector: A Resource Analysis Framework , 2014, 2014 14th International Conference on Application of Concurrency to System Design.

[34]  Benedikt Bollig,et al.  A Robust Class of Data Languages and an Application to Learning , 2014, Log. Methods Comput. Sci..

[35]  Paul Gastin,et al.  Weighted automata and weighted logics , 2005, Theor. Comput. Sci..