cicyt UNIZAR

Formal Languages and Automata Theory

Authors and titles for recent submissions

[ total of 10 entries: 1-10 ]
[ showing up to 25 entries per page: fewer | more ]

Fri, 23 Feb 2018

[1]  arXiv:1802.08068 (cross-list from cs.SI) [pdf, other]
Title: Learning Hyperedge Replacement Grammars for Graph Generation
Comments: 27 pages, accepted at IEEE Transactions on Pattern Analysis and Machine Intelligence (PAMI). arXiv admin note: substantial text overlap with arXiv:1608.03192
Subjects: Social and Information Networks (cs.SI); Formal Languages and Automata Theory (cs.FL)

Thu, 22 Feb 2018

[2]  arXiv:1802.07644 [pdf, ps, other]
Title: A gauge-invariant reversible cellular automaton
Comments: 12 pages, 5 figures
Subjects: Formal Languages and Automata Theory (cs.FL); Cellular Automata and Lattice Gases (nlin.CG); Quantum Physics (quant-ph)
[3]  arXiv:1802.07600 [pdf, ps, other]
Title: Randomized sliding window algorithms for regular languages
Subjects: Formal Languages and Automata Theory (cs.FL); Data Structures and Algorithms (cs.DS)
[4]  arXiv:1802.07397 [pdf, ps, other]
Title: PTL-separability and closures for WQOs on words
Authors: Georg Zetzsche
Subjects: Formal Languages and Automata Theory (cs.FL)

Wed, 21 Feb 2018

[5]  arXiv:1802.07085 (cross-list from math.GR) [pdf, ps, other]
Title: The isomorphism problem for finite extensions of free groups is in PSPACE
Subjects: Group Theory (math.GR); Computational Complexity (cs.CC); Formal Languages and Automata Theory (cs.FL)

Tue, 20 Feb 2018

[6]  arXiv:1802.06683 [pdf, other]
Title: Unboundedness problems for languages of vector addition systems
Subjects: Formal Languages and Automata Theory (cs.FL)
[7]  arXiv:1802.06529 [pdf, ps, other]
Title: Automatic supermartingales acting on sequences
Subjects: Formal Languages and Automata Theory (cs.FL)
[8]  arXiv:1802.06207 [pdf, ps, other]
Title: Randomness of formal languages via automatic martingales
Subjects: Formal Languages and Automata Theory (cs.FL)
[9]  arXiv:1802.06141 [pdf, ps, other]
Title: A generic characterization of Pol(C)
Subjects: Formal Languages and Automata Theory (cs.FL)

Fri, 16 Feb 2018

[10]  arXiv:1802.05490 (cross-list from cs.DS) [pdf, ps, other]
Title: Grammar-based Compression of Unranked Trees
Comments: Extended version of a paper at CSR 2018
Subjects: Data Structures and Algorithms (cs.DS); Formal Languages and Automata Theory (cs.FL)
[ total of 10 entries: 1-10 ]
[ showing up to 25 entries per page: fewer | more ]

Disable MathJax (What is MathJax?)