Playing Safe, Ten Years Later by Thomas Colcombet, Nathanaël Fijalkow, Florian Horn

Subjects: “…computer science - formal languages and automata theory…”
Get full text

The minimal probabilistic and quantum finite automata recognizing uncountably many languages with fixed cutpoints by Aleksejs Naumovs, Maksims Dimitrijevs, Abuzer Yakaryılmaz

Subjects: “…computer science - formal languages and automata theory…”
Get full text

Sampled Semantics of Timed Automata by Pavel Krcal, Parosh Aziz Abdulla, Wang Yi

Subjects: “…computer science - formal languages and automata theory…”
Get full text

The Theory of Universal Graphs for Infinite Duration Games by Thomas Colcombet, Nathanaël Fijalkow, Paweł Gawrychowski, Pierre Ohlmann

Subjects: “…computer science - formal languages and automata theory…”
Get full text

Pseudoperiodic Words and a Question of Shevelev by Joseph Meleshko, Pascal Ochem, Jeffrey Shallit, Sonja Linghui Shan

Subjects: “…computer science - formal languages and automata theory…”
Get full text

On universal partial words by Herman Z. Q. Chen, Sergey Kitaev, Torsten Mütze, Brian Y. Sun

Subjects: “…computer science - formal languages and automata theory…”
Get full text

How Much Lookahead is Needed to Win Infinite Games? by Felix Klein, Martin Zimmermann

Subjects: “…computer science - formal languages and automata theory…”
Get full text

Piecewise testable tree languages by Mikołaj Bojańczyk, Luc Segoufin, Howard Straubing

Subjects: “…computer science - formal languages and automata theory…”
Get full text

A Characterization for Decidable Separability by Piecewise Testable Languages by Wojciech Czerwiński, Wim Martens, Lorijn van Rooijen, Marc Zeitoun, Georg Zetzsche

Subjects: “…computer science - formal languages and automata theory…”
Get full text

Polishness of some topologies related to word or tree automata by Olivier Finkel, Olivier Carton, Dominique Lecomte

Subjects: “…computer science - formal languages and automata theory…”
Get full text

Monadic Second Order Logic with Measure and Category Quantifiers by Matteo Mio, Michał Skrzypczak, Henryk Michalewski

Subjects: “…computer science - formal languages and automata theory…”
Get full text

On subtrees of the representation tree in rational base numeration systems by Shigeki Akiyama, Victor Marsault, Jacques Sakarovitch

Subjects: “…computer science - formal languages and automata theory…”
Get full text

Model Checking Vector Addition Systems with one zero-test by Rémi Bonnet, Alain FInkel, Jérôme Leroux, Marc Zeitoun

Subjects: “…computer science - formal languages and automata theory…”
Get full text

Tree Languages Defined in First-Order Logic with One Quantifier Alternation by Mikolaj Bojanczyk, Luc Segoufin

Subjects: “…computer science - formal languages and automata theory…”
Get full text

Dissecting power of intersection of two context-free languages by Josef Rukavicka

Subjects: “…computer science - formal languages and automata theory…”
Get full text

Positive First-order Logic on Words and Graphs by Denis Kuperberg

Subjects: “…computer science - formal languages and automata theory…”
Get full text

General Decidability Results for Asynchronous Shared-Memory Programs: Higher-Order and Beyond by Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche

Subjects: “…computer science - formal languages and automata theory…”
Get full text

Higher-dimensional automata modeling shared-variable systems by Thomas Kahl

Subjects: “…computer science - formal languages and automata theory…”
Get full text

Wreath Products of Forest Algebras, with Applications to Tree Logics by Mikolaj Bojanczyk, Igor Walukiewicz, Howard Straubing

Subjects: “…computer science - formal languages and automata theory…”
Get full text

Weight Annotation in Information Extraction by Johannes Doleschal, Benny Kimelfeld, Wim Martens, Liat Peterfreund

Subjects: “…computer science - formal languages and automata theory…”
Get full text