default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID19. DCFS 2017: Milano, Italy
- Giovanni Pighizzini, Cezar Câmpeanu:
Descriptional Complexity of Formal Systems - 19th IFIP WG 1.02 International Conference, DCFS 2017, Milano, Italy, July 3-5, 2017, Proceedings. Lecture Notes in Computer Science 10316, Springer 2017, ISBN 978-3-319-60251-6
Invited Papers
- Shaull Almagor
, Denis Kuperberg, Orna Kupferman:
Sensing as a Complexity Measure. 3-15 - Marcella Anselmo, Dora Giammarresi, Maria Madonia:
Avoiding Overlaps in Pictures. 16-32 - Jürgen Dassow:
Descriptional Complexity and Operations - Two Non-classical Cases. 33-44 - Stavros Konstantinidis:
Applications of Transducers in Independent Languages, Word Distances, Codes. 45-62
Contributed Papers
- Suna Bensch, Maia Hoeberechts:
On the Degree of Nondeterminism of Tree Adjoining Languages and Head Grammar Languages. 65-76 - Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis:
On the Average Complexity of Strong Star Normal Form. 77-88 - Janusz A. Brzozowski, Sylvie Davies:
Most Complex Non-returning Regular Languages. 89-101 - Maksims Dimitrijevs, Abuzer Yakaryilmaz:
Uncountable Realtime Probabilistic Classes. 102-113 - Rachel Faran, Orna Kupferman:
A Parametrized Analysis of Algorithms on Hierarchical Graphs. 114-127 - Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman:
Graph-Controlled Insertion-Deletion Systems Generating Language Classes Beyond Linearity. 128-139 - Rudolf Freund, Vladimir Rogojin, Sergey Verlan:
Computational Completeness of Networks of Evolutionary Processors with Elementary Polarizations and a Small Number of Processors. 140-151 - Kitti Gelle, Szabolcs Iván:
Recognizing Union-Find Trees Built Up Using Union-By-Rank Strategy is NP-Complete. 152-163 - Yo-Sub Han, Hwee Kim, Trent A. Rogers, Shinnosuke Seki:
Self-attraction Removal from Oritatami Systems. 164-176 - Markus Holzer, Martin Kutrib:
One-Time Nondeterministic Computations. 177-188 - Jozef Jirásek Jr., Matús Palmovský, Juraj Sebej:
Kuratowski Algebras Generated by Factor-, Subword-, and Suffix-Free Languages. 189-201 - Chris Keeler, Kai Salomaa:
Branching Measures and Nearly Acyclic NFAs. 202-213 - Ivana Krajnáková, Galina Jirásková:
Square on Deterministic, Alternating, and Boolean Finite Automata. 214-225 - Kent Kwee, Friedrich Otto:
A Pumping Lemma for Ordered Restarting Automata. 226-237 - Giovanna J. Lavado, Luca Prigioniero:
Concise Representations of Reversible Automata. 238-249 - Laurette Marais, Lynette van Zijl:
State Complexity of Unary SV-XNFA with Different Acceptance Conditions. 250-261 - Marina I. Maslennikova:
Reset Complexity of Ideal Languages Over a Binary Alphabet. 262-273 - Turlough Neary:
2-State 2-Symbol Turing Machines with Periodic Support Produce Regular Sets. 274-286 - Timothy Ng, David Rappaport, Kai Salomaa:
State Complexity of Suffix Distance. 287-298 - Alexander Okhotin, Kai Salomaa:
The Quotient Operation on Input-Driven Pushdown Automata. 299-310
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-27 01:10 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:
