# Formal Languages and Automata Theory

## Authors and titles for recent submissions

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

### Fri, 23 Aug 2019

[1]
Title: Tensor Product Representations of Subregular Formal Languages
Authors: Jonathan Rawski
Comments: to appear in Proceedings of IJCAI 2019 workshop on Neural-Symbolic Learning and Reasoning
Subjects: Formal Languages and Automata Theory (cs.FL); Logic in Computer Science (cs.LO)

### Tue, 20 Aug 2019

[2]
Title: On the expressive power of invariants in parametric timed automata
Comments: This is the author version of the manuscript of the same name published in the proceedings of the 24th International Conference on Engineering of Complex Computer Systems (ICECCS 2019). This work is partially supported by the ANR national research program PACS (ANR-14-CE28-0002) and by ERATO HASUO Metamathematics for Systems Design Project (No. JPMJER1603), JST
Subjects: Formal Languages and Automata Theory (cs.FL); Logic in Computer Science (cs.LO)
[3]  arXiv:1908.06601 (cross-list from cs.PL) [pdf]
Title: Implicit Recursive Characteristics of STOP
Authors: Mike H. Ji
Comments: 5 pages. A proof that STOP itself is a recursive process. STOP$_{\alpha X} = \mu$ X. nil $\rightarrow$ X
Subjects: Programming Languages (cs.PL); Computation and Language (cs.CL); Formal Languages and Automata Theory (cs.FL); Logic in Computer Science (cs.LO)

### Wed, 14 Aug 2019

[4]
Title: LTL to Smaller Self-Loop Alternating Automata and Back
Comments: This is a full version of the paper accepted to ICTAC 2019
Subjects: Formal Languages and Automata Theory (cs.FL)
[5]
Title: Non-deterministic weighted automata evaluated over Markov chains
Comments: This paper is an extended and corrected version of the paper "Non-deterministic Weighted Automata on Random Words" by the same authors presented at CONCUR 2018
Subjects: Formal Languages and Automata Theory (cs.FL)

### Tue, 13 Aug 2019

[6]
Title: Regular Separability and Intersection Emptiness are Independent Problems
Subjects: Formal Languages and Automata Theory (cs.FL); Logic in Computer Science (cs.LO)
[7]
Title: A Robust Class of Linear Recurrence Sequences
Subjects: Formal Languages and Automata Theory (cs.FL)
[8]
Title: Solving of Regular Equations Revisited (extended version)
Subjects: Formal Languages and Automata Theory (cs.FL)
[9]  arXiv:1908.03837 (cross-list from cs.SI) [pdf, ps, other]
Title: Modeling Graphs with Vertex Replacement Grammars
Comments: Accepted as a regular paper at IEEE ICDM 2019. 15 pages, 9 figures
Subjects: Social and Information Networks (cs.SI); Formal Languages and Automata Theory (cs.FL)

### Mon, 12 Aug 2019

[10]
Title: Reordering Derivatives of Trace Closures of Regular Languages (Full Version)
Comments: Extended version of paper appearing in Proc. of CONCUR 2019 (LIPIcs, v. 140, article no. 40)
Subjects: Formal Languages and Automata Theory (cs.FL)
[11]  arXiv:1908.03489 (cross-list from cs.LO) [pdf, other]
Title: Topological Run-time Monitoring for Complex Systems
Subjects: Logic in Computer Science (cs.LO); Formal Languages and Automata Theory (cs.FL); Tissues and Organs (q-bio.TO)
[ total of 11 entries: 1-11 ]
[ showing up to 25 entries per page: fewer | more ]

Disable MathJax (What is MathJax?)

Links to: arXiv, form interface, find, cs, new, 1908, contact, help  (Access key information)