default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID17. DCFS 2015: Waterloo, ON, Canada
- Jeffrey O. Shallit, Alexander Okhotin:
Descriptional Complexity of Formal Systems - 17th International Workshop, DCFS 2015, Waterloo, ON, Canada, June 25-27, 2015. Proceedings. Lecture Notes in Computer Science 9118, Springer 2015, ISBN 978-3-319-19224-6
Invited Talk
- Thomas Colcombet:
Unambiguity in Automata Theory. 3-18
Contributed Papers
- Sabine Broda
, António Machiavelo, Nelma Moreira, Rogério Reis:
Partial Derivative Automaton for Regular Expressions with Shuffle. 21-32 - Janusz A. Brzozowski, Marek Szykula:
Upper Bound on Syntactic Complexity of Suffix-Free Languages. 33-45 - Cezar Câmpeanu, Kai Salomaa:
Nondeterministic Tree Width of Regular Languages. 46-57 - Juris Cernenoks, Janis Iraids, Martins Opmanis, Rihards Opmanis, Karlis Podnieks:
Integer Complexity: Experimental and Analytical Results II. 58-69 - Kristína Cevorová:
Square on Ideal, Closed and Free Languages. 70-80 - Jacques Duparc, Kevin Fournier:
A Tentative Approach for the Wadge-Wagner Hierarchy of Regular Tree Languages of Index [0, 2]. 81-92 - Sebastian Eberhard, Stefan Hetzl:
Compressibility of Finite Languages by Grammars. 93-104 - Joey Eremondi, Oscar H. Ibarra, Ian McQuillan:
On the Complexity and Decidability of Some Problems Involving Shuffle. 105-116 - Markus Holzer, Sebastian Jakobi:
On the Computational Complexity of Problems Related to Distinguishability Sets. 117-128 - Jozef Stefan Jirásek, Juraj Sebej:
Prefix-Free Subsets of Regular Languages and Descriptional Complexity. 129-140 - Lila Kari, Stavros Konstantinidis, Steffen Kopecki:
Transducer Descriptions of DNA Code Properties and Undecidability of Antimorphic Problems. 141-152 - Martin Kutrib, Matthias Wendlandt:
On Simulation Cost of Unary Limited Automata. 153-164 - Kent Kwee, Friedrich Otto:
On Some Decision Problems for Stateless Deterministic Ordered Restarting Automata. 165-176 - Taisia Mischenko-Slatenkova, Alina Vasilieva, Ilja Kucevalovs, Rusins Freivalds:
Quantum Queries on Permutations. 177-184 - Peter Mlynárcik:
Complement on Free and Ideal Languages. 185-196 - Nelma Moreira, Giovanni Pighizzini, Rogério Reis:
Universal Disjunctive Concatenation and Star. 197-208 - Timothy Ng, David Rappaport, Kai Salomaa:
Quasi-Distances and Weighted Finite Automata. 209-219 - Alexandros Palioudakis, Da-Jung Cho, Daniel Goc, Yo-Sub Han, Sang-Ki Ko, Kai Salomaa:
The State Complexity of Permutations on Finite Languages over Binary Alphabets. 220-230 - Matús Palmovský, Juraj Sebej:
Star-Complement-Star on Prefix-Free Languages. 231-242 - Gabriela Asli Rino Nesin, Richard M. Thomas:
Groups Whose Word Problem is a Petri Net Language. 243-255 - Alexander A. Rubtsov, Mikhail N. Vyalyi:
Regular Realizability Problems and Context-Free Languages. 256-267 - Hellis Tamm:
Generalization of the Double-Reversal Method of Finding a Canonical Residual Finite State Automaton. 268-279 - Marcos Villagra, Tomoyuki Yamakami:
Quantum State Complexity of Formal Languages. 280-291
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-11-13 21:54 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
