Language and Automata Theory and Applications

Hankel matrices (aka connection matrices) of word functions and graph parameters have wide applications in automata theory, graph theory, and machine learning. We give a characterization of real-valued functions on nested words recognized by weighted visibly pushdown automata in terms of Hankel matrices on nested words. This complements C. Mathissen’s characterization in terms of weighted monadic second order logic.

[1]  Shunsuke Inenaga,et al.  Efficiently Finding All Maximal $α$-gapped Repeats , 2015, ArXiv.

[2]  Kenneth L. McMillan,et al.  Symbolic model checking , 1992 .

[3]  Véronique Bruyère,et al.  Weak Subgame Perfect Equilibria and their Application to Quantitative Reachability , 2015, CSL.

[4]  Dana Fisman,et al.  Rational Synthesis , 2009, TACAS.

[5]  Michael G. Main,et al.  An O(n log n) Algorithm for Finding All Repetitions in a String , 1984, J. Algorithms.

[6]  Krishnendu Chatterjee,et al.  Strategy logic , 2007, Inf. Comput..

[7]  R. Alur,et al.  Adding nesting structure to words , 2006, JACM.

[8]  Joachim Niehren,et al.  Streamable Fragments of Forward XPath , 2011, CIAA.

[9]  Wojciech Rytter,et al.  Extracting Powers and Periods in a String from Its Runs Structure , 2010, SPIRE.

[10]  Joël Ouaknine,et al.  On the Complexity of Equivalence and Minimisation for Q-weighted Automata , 2013, Log. Methods Comput. Sci..

[11]  Tero Harju,et al.  Combinatorics on Words , 2004 .

[12]  José Oncina,et al.  Learning Multiplicity Tree Automata , 2006, ICGI.

[13]  Bruno Courcelle,et al.  Linear Time Solvable Optimization Problems on Graphs of Bounded Clique Width , 1998, WG.

[14]  Krishnendu Chatterjee,et al.  Trading Performance for Stability in Markov Decision Processes , 2013, 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science.

[15]  Jens Stoye,et al.  Finding Maximal Pairs with Bounded Gap , 1999, CPM.

[16]  André Arnold,et al.  Finite transition systems - semantics of communicating systems , 1994, Prentice Hall international series in computer science.

[17]  Christian Mathissen.  Weighted Logics for Nested Words and Algebraic Formal Power Series , 2008, ICALP.

[18]  Alex Heller.  Probabilistic automata and stochastic transformations , 2005, Mathematical systems theory.

[19]  James E. Gentle.  Computational Statistics , 2009 .

[20]  Orna Kupferman,et al.  Reasoning about online algorithms with weighted automata , 2009, TALG.

[21]  William R. Harris,et al.  Secure Programming via Visibly Pushdown Safety Games , 2012, CAV.

[22]  Gregory Kucherov,et al.  On Maximal Repetitions in Words , 1999, FCT.

[23]  Alan Cobham.  Representation of a word function as the sum of two functions , 2005, Mathematical systems theory.

[24]  Jack W. Carlyle,et al.  Realizations by Stochastic Finite Automata , 1971, J. Comput. Syst. Sci..

[25]  Sham M. Kakade,et al.  A spectral algorithm for learning Hidden Markov Models , 2008, J. Comput. Syst. Sci..

[26]  Roman Kolpakov.  On primary and secondary repetitions in words , 2012, Theor. Comput. Sci..

[27]  Florin Manea,et al.  Longest Gapped Repeats and Palindromes , 2017, Discret. Math. Theor. Comput. Sci..

[28]  Dana Angluin,et al.  Learning Regular Sets from Queries and Counterexamples , 1987, Inf. Comput..

[29]  Krishnendu Chatterjee,et al.  Quantitative languages , 2008, TOCL.

[30]  Nader H. Bshouty,et al.  On Optimal Learning Algorithms for Multiplicity Automata , 2006, COLT.

[31]  Lucian Ilie,et al.  Towards a Solution to the "Runs" Conjecture , 2008, CPM.

[32]  Jean-François Raskin,et al.  Iterated Regret Minimization in Game Graphs , 2010, MFCS.

[33]  L. Lovasz,et al.  Reflection positivity, rank connectivity, and homomorphism of graphs , 2004, math/0404468.

[34]  Gregory Kucherov,et al.  On maximal repetitions of arbitrary exponent , 2010, Inf. Process. Lett..

[35]  Véronique Bruyère,et al.  Meet Your Expectations With Guarantees: Beyond Worst-Case Synthesis in Quantitative Games , 2013, STACS.

[36]  Rüdiger Ehlers,et al.  How to Handle Assumptions in Synthesis , 2014, SYNT.

[37]  Johann A. Makowsky,et al.  Weighted Automata and Monadic Second Order Logic , 2013, GandALF.

[38]  A. Laub,et al.  The singular value decomposition: Its computation and some applications , 1980 .

[39]  Lorenzo Clemente,et al.  Multidimensional beyond Worst-Case and Almost-Sure Problems for Mean-Payoff Objectives , 2015, 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science.

[40]  Gregory Kucherov,et al.  Searching for gapped palindromes , 2008, Theor. Comput. Sci..

[41]  Bernd Finkbeiner,et al.  Does It Pay to Extend the Perimeter of a World Model? , 2011, FM.

[42]  Bruno Courcelle,et al.  Graph Structure and Monadic Second-Order Logic: Overview , 2012 .

[43]  John N. Tsitsiklis,et al.  Mean-Variance Optimization in Markov Decision Processes , 2011, ICML.

[44]  Kazuya Tsuruta,et al.  A new characterization of maximal repetitions by Lyndon trees , 2015, SODA.

[45]  J. Makowsky,et al.  Tropical Graph Parameters , 2014 .

[46]  Guillermo A. Pérez,et al.  Reactive synthesis without regret , 2016, Acta Informatica.

[47]  Yves Schabes,et al.  Speech Recognition by Composition of Weighted Finite Automata , 1997 .

[48]  Thomas Colcombet.  Forms of Determinism for Automata , 2012, STACS 2012.

[49]  Maxime Crochemore,et al.  Optimal searching of gapped repeats in a word , 2015, Lata 2016.

[50]  Florin Manea,et al.  Longest α-Gapped Repeat and Palindrome , 2015, FCT.

[51]  T. Reps,et al.  Checking Compatibility of a Producer and a Consumer ∗ , 2010 .

[52]  Gregory Kucherov,et al.  Finding repeats with fixed gap , 2000, Proceedings Seventh International Symposium on String Processing and Information Retrieval. SPIRE 2000.

[53]  Rajeev Alur,et al.  Symbolic Visibly Pushdown Automata , 2014, CAV.

[54]  Michael Riley,et al.  Speech Recognition by Composition of Weighted Finite Automata , 1996, ArXiv.

[55]  Dietmar Berwanger,et al.  Admissibility in Infinite Games , 2007, STACS.

[56]  Wojciech Rytter,et al.  Squares, cubes, and time-space efficient string searching , 1995, Algorithmica.

[57]  Thomas A. Henzinger,et al.  Solving Games Without Determinization , 2006, CSL.

[58]  D. Krass,et al.  Percentile performance criteria for limiting average Markov decision processes , 1995, IEEE Trans. Autom. Control..

[59]  Zvi Galil,et al.  Time-Space-Optimal String Matching , 1983, J. Comput. Syst. Sci..

[60]  Mehryar Mohri,et al.  Spectral Learning of General Weighted Automata via Constrained Matrix Completion , 2012, NIPS.

[61]  Neil Immerman,et al.  First-Order and Temporal Logics for Nested Words , 2007, 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007).

[62]  Johann A. Makowsky,et al.  Evaluations of Graph Polynomials , 2008, WG.

[63]  Marco Faella,et al.  Admissible Strategies in Infinite Games over Graphs , 2009, MFCS.

[64]  Mehryar Mohri,et al.  Learning Weighted Automata , 2015, CAI.

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

[66]  László Lovász.  Connection matrices , 2005 .

[67]  David Haussler,et al.  Predicting {0,1}-functions on randomly drawn points , 1988, COLT '88.

[68]  Carlo Zaniolo,et al.  High-performance complex event processing over XML streams , 2012, SIGMOD Conference.

[69]  Krishnendu Chatterjee,et al.  Probabilistic Weighted Automata , 2009, CONCUR.

[70]  Francesco Bergadano,et al.  Learning Behaviors of Automata from Multiplicity and Equivalence Queries , 1994, SIAM J. Comput..

[71]  J. C. Jackson.  Learning Functions Represented as Multiplicity Automata , 1997 .

[72]  Gene H. Golub,et al.  Matrix computations , 1983 .

[73]  Bart De Schutter,et al.  The QR decomposition and the singular value decomposition in the symmetrized max-plus algebra , 1997, 1997 European Control Conference (ECC).

[74]  Leonard Pitt,et al.  The minimum consistent DFA problem cannot be approximated within any polynomial , 1989, [1989] Proceedings. Structure in Complexity Theory Fourth Annual Conference.

[75]  László Lovász,et al.  Large Networks and Graph Limits , 2012, Colloquium Publications.

[76]  Jarkko Kari,et al.  Image Compression Using Weighted Finite Automata , 1993, MFCS.

[77]  N. Littlestone.  Learning Quickly When Irrelevant Attributes Abound: A New Linear-Threshold Algorithm , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[78]  Johann A. Makowsky,et al.  Algorithmic uses of the Feferman-Vaught Theorem , 2004, Ann. Pure Appl. Log..

[79]  Maxime Crochemore,et al.  Computing the Maximal-Exponent Repeats of an Overlap-Free String in Linear Time , 2012, SPIRE.

[80]  Krishnendu Chatterjee,et al.  Measuring and Synthesizing Systems in Probabilistic Environments , 2010, CAV.

[81]  Bruno Courcelle,et al.  On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic , 2001, Discret. Appl. Math..

[82]  Thomas W. Reps,et al.  OpenNWA: A Nested-Word Automaton Library , 2012, CAV.

[83]  Wojciech Rytter,et al.  On the maximal sum of exponents of runs in a string , 2012, J. Discrete Algorithms.

[84]  Krishnendu Chatterjee,et al.  Games with secure equilibria , 2004, Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004..

[85]  James A. Storer,et al.  Data Compression: Methods and Theory , 1987 .

[86]  Véronique Bruyère,et al.  Expectations or Guarantees? I Want It All! A crossroad between games and MDPs , 2014, SR.

[87]  A. Ehrenfeucht,et al.  Positional strategies for mean payoff games , 1979 .

[88]  Dan Gusfield,et al.  Algorithms on Strings, Trees, and Sequences - Computer Science and Computational Biology , 1997 .

[89]  Johan van Benthem,et al.  Reasoning about Strategies , 2013, Computation, Logic, Games, and Quantum Foundations.

[90]  Jean-François Raskin,et al.  Assume-admissible synthesis , 2015, Acta Informatica.

[91]  Cyril Allauzen,et al.  Statistical Modeling for Unit Selection in Speech Synthesis , 2004, ACL.

[92]  Joseph Y. Halpern,et al.  Iterated Regret Minimization: A New Solution Concept , 2009, IJCAI.

[93]  Dmitry Kosolobov.  Lempel-Ziv Factorization May Be Harder Than Computing All Runs , 2015, STACS.

[94]  Giuseppe Perelli,et al.  Synthesis with rational environments , 2016, Annals of Mathematics and Artificial Intelligence.

[95]  Bart De Schutter,et al.  The singular-value decomposition in the extended max algebra , 1997 .

[96]  DANA ANGLUIN,et al.  On the Complexity of Minimum Inference of Regular Sets , 1978, Inf. Control..

[97]  JOHANNES FISCHER,et al.  Beyond the Runs Theorem , 2015, SPIRE.

[98]  H. Keisler,et al.  ADMISSIBILITY IN GAMES , 2008 .

[99]  Maxime Crochemore,et al.  An Optimal Algorithm for Computing the Repetitions in a Word , 1981, Inf. Process. Lett..

[100]  Leslie G. Valiant,et al.  A theory of the learnable , 1984, CACM.

[101]  A. Poularikas.  The transforms and applications handbook , 2000 .

[102]  Mikhail Posypkin,et al.  Searching of gapped repeats and subrepetitions in a word , 2017, J. Discrete Algorithms.

[103]  Andrzej S. Murawski,et al.  Third-order Idealized Algol with iteration is decidable , 2008, Theor. Comput. Sci..

[104]  E. Mark Gold,et al.  Complexity of Automaton Identification from Given Data , 1978, Inf. Control..

[105]  Vladimir Gurvich,et al.  On Short Paths Interdiction Problems: Total and Node-Wise Limited Interdiction , 2008, Theory of Computing Systems.

[106]  Véronique Bruyère,et al.  Secure equilibria in weighted games , 2014, CSL-LICS.

[107]  Dany Breslauer,et al.  Efficient string algorithmics , 1992 .

[108]  Mehryar Mohri,et al.  Finite-State Transducers in Language and Speech Processing , 1997, CL.