Log in
Sign up
Topic
▼
Journal/Conference
▼
Search
▼
|
Browse
|
Your feeds
|
Submit a paper
|
About
All of CS
·
AI
·
Data Mgmt.
·
Graphics
·
HCI
·
Networks & Comm.
·
OS
·
Parallel & Dist. Comp.
·
Prog. Languages
·
Security
·
Soft. Eng.
·
Theory & Algs.
Journal:
ArXiv: Formal Languages and Automata Theory
Sort:
New & recommended ·
Active
·
Top Recommended
·
New
Semilinearity and Context-Freeness of Languages Accepted by Valence Automata. (arXiv:1306.3260v1 [cs.FL])
By P. Buckheister,Georg Zetzsche
1
·
0
· from
ArXiv:cs.FL
· published 06/2013
Syntactic Complexity of Circular Semi-Flower Automata. (arXiv:1306.3492v1 [cs.FL])
By Shubh Narayan Singh,K. V. Krishna
1
·
0
· from
ArXiv:cs.FL
· published 06/2013
Modal Interface Automata. (arXiv:1306.3050v1 [cs.LO])
By Gerald Lüttgen,Walter Vogler
1
·
0
· from
ArXiv:cs.FL
· published 06/2013
Words with unbounded periodicity complexity. (arXiv:1306.3123v1 [cs.FL])
By Štěpán Holub
1
·
0
· from
ArXiv:cs.FL
· published 06/2013
Modal Specifications for Probabilistic Timed Systems. (arXiv:1306.2695v1 [cs.LO])
By Tingting Han,Christian Krause,Marta Kwiatkowska,Holger Giese
1
·
0
· from
ArXiv:cs.FL
· published 06/2013
Solving Stochastic B\"uchi Games on Infinite Arenas with a Finite Attractor. (arXiv:1207.4577v4 [cs.LO] UPDATED)
By Nathalie Bertrand,Philippe Schnoebelen,
1
·
0
· from
ArXiv:cs.FL
· published 06/2013
The Holonomy Decomposition of Circular Semi-Flower Automata. (arXiv:1306.2548v1 [cs.FL])
By Shubh Narayan Singh,K. V. Krishna
1
·
0
· from
ArXiv:cs.FL
· published 06/2013
Detecting Useless Transitions in Pushdown Automata. (arXiv:1306.1947v1 [cs.FL])
By Wan Fokkink,Dick Grune,Brinio Hond,Peter Rutgers
1
·
0
· from
ArXiv:cs.FL
· published 06/2013
Open and Closed Prefixes of Sturmian Words. (arXiv:1306.2254v1 [math.CO])
By Alessandro De Luca,Gabriele Fici
1
·
0
· from
ArXiv:cs.FL
· published 06/2013
Ultimate periodicity of b-recognisable sets : a quasilinear procedure. (arXiv:1301.2691v2 [cs.FL] UPDATED)
By Victor Marsault,Jacques Sakarovitch
1
·
0
· from
ArXiv:cs.FL
· published 06/2013
On the State Complexity of the Reverse of R- and J-trivial Regular Languages. (arXiv:1304.0733v2 [cs.FL] UPDATED)
By Galina Jirásková,Tomáš Masopust
1
·
0
· from
ArXiv:cs.FL
· published 06/2013
Topological dynamics and recognition of languages. (arXiv:1306.1468v1 [cs.FL])
By Benjamin Steinberg
1
·
0
· from
ArXiv:cs.FL
· published 06/2013
Reachability in Higher-Order-Counters. (arXiv:1306.1069v1 [cs.FL])
By Alexander Heußner,Alexander Kartzow
1
·
0
· from
ArXiv:cs.FL
· published 06/2013
Compact Notation for Finite Transformations. (arXiv:1306.1138v1 [math.GR])
By Attila Egri-Nagy,Chrystopher L. Nehaniv
1
·
0
· from
ArXiv:cs.FL
· published 06/2013
Predictability of Event Occurrences in Timed Systems. (arXiv:1306.0662v1 [cs.SY])
By Franck Cassez,Alban Grastien
1
·
0
· from
ArXiv:cs.FL
· published 06/2013
Interaction and observation: categorical semantics of reactive systems trough dialgebras. (arXiv:1209.5903v3 [cs.LO] UPDATED)
By Vincenzo Ciancia
1
·
0
· from
ArXiv:cs.FL
· published 06/2013
The RAM equivalent of P vs. RP. (arXiv:1306.0400v1 [cs.CC])
By Michael Brand
1
·
0
· from
ArXiv:cs.FL
· published 06/2013
Regular Cost Functions, Part I: Logic and Algebra over Words. (arXiv:1212.6937v2 [cs.FL] UPDATED)
By Thomas Colcombet
1
·
0
· from
ArXiv:cs.FL
· published 06/2013
Sofic-Dyck shifts. (arXiv:1305.7413v1 [cs.FL])
By Marie-Pierre Béal,Michel Blockelet,Cătălin Dima
1
·
0
· from
ArXiv:cs.FL
· published 06/2013
Deciding Word Problems of Semigroups using Finite State Automata. (arXiv:1206.1714v3 [cs.FL] UPDATED)
By Max Neunhöffer,Markus Pfeiffer,Nik Ruskuc
1
·
0
· from
ArXiv:cs.FL
· published 05/2013
Auto-similarity in rational base number systems. (arXiv:1305.6757v1 [cs.FL])
By Shigeki Akiyama,Victor Marsault,Jacques Sakarovitch
1
·
0
· from
ArXiv:cs.FL
· published 05/2013
A representation of context-free grammars with the help of finite digraphs. (arXiv:1305.6803v1 [cs.FL])
By Krasimir Yordzhev
1
·
0
· from
ArXiv:cs.FL
· published 05/2013
A Note on Words With the Smallest Number of Closed Factors. (arXiv:1305.6395v1 [cs.FL])
By Golnaz Badkobeh,Gabriele Fici,Zsuzsanna Lipták
1
·
0
· from
ArXiv:cs.FL
· published 05/2013
On the Structure and Complexity of Rational Sets of Regular Languages. (arXiv:1305.6074v1 [cs.FL])
By Andreas Holzer,Christian Schallhart,Michael Tautschnig,Helmut Veith
1
·
0
· from
ArXiv:cs.FL
· published 05/2013
Maximal Syntactic Complexity of Regular Languages Implies Maximal Quotient Complexities of Atoms. (arXiv:1302.3906v2 [cs.FL] UPDATED)
By Janusz Brzozowski,Gareth Davies
1
·
0
· from
ArXiv:cs.FL
· published 05/2013
Two Variable vs. Linear Temporal Logic in Model Checking and Games. (arXiv:1303.4533v2 [cs.LO] UPDATED)
By Michael Benedikt,Rastislav Lenhardt,James Worrell
1
·
0
· from
ArXiv:cs.FL
· published 05/2013
From determinacy to Nash equilibrium. (arXiv:1203.1866v3 [math.LO] UPDATED)
By Stéphane Le Roux
1
·
0
· from
ArXiv:cs.FL
· published 05/2013
On the probability to be synchronizable. (arXiv:1304.5774v5 [cs.FL] UPDATED)
By Mikhail V. Berlinkov
1
·
0
· from
ArXiv:cs.FL
· published 05/2013
Decidability of minimization of fuzzy automata. (arXiv:1305.4255v1 [cs.FL])
By Lvzhou Li,Daowen Qiu
1
·
0
· from
ArXiv:cs.FL
· published 05/2013
On the probability to be synchronizable. (arXiv:1304.5774v4 [cs.FL] UPDATED)
By Mikhail V. Berlinkov
1
·
0
· from
ArXiv:cs.FL
· published 05/2013
more ->
Features coming soon:
Author profiles -- Claim your papers.
Groups -- Create a group for your department.
Paper revisions and version control.
Comments, suggestions, errors?
Author profiles -- Claim your papers. Groups -- Create a group for your department. Paper revisions and version control.
Log in