default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID15. DCFS 2013: London, ON, Canada
- Helmut Jürgensen, Rogério Reis
:
Descriptional Complexity of Formal Systems - 15th International Workshop, DCFS 2013, London, ON, Canada, July 22-25, 2013. Proceedings. Lecture Notes in Computer Science 8031, Springer 2013, ISBN 978-3-642-39309-9 - Cezar Câmpeanu:
Blum Static Complexity and Encoding Spaces. 1-13 - Frank Drewes:
Millstream Systems and Graph Transformation for Complex Linguistic Models - (Extended Abstract). 14-16 - Pierre McKenzie:
Can Chimps Go It Alone? 17 - Klaus Sutner:
Invertible Transductions and Iteration. 18-29 - Janusz A. Brzozowski, David Liu:
Universal Witnesses for State Complexity of Boolean Operations and Concatenation Combined with Star. 30-41 - Liliana Cojocaru, Erkki Mäkinen:
Searching for Traces of Communication in Szilard Languages of Parallel Communicating Grammar Systems - Complexity Views. 42-53 - Hae-Sung Eom, Yo-Sub Han, Galina Jirásková:
State Complexity of Basic Operations on Non-returning Regular Languages. 54-65 - Hae-Sung Eom, Yo-Sub Han, Sang-Ki Ko:
State Complexity of Subtree-Free Regular Tree Languages. 66-77 - Hae-Sung Eom, Yo-Sub Han, Kai Salomaa:
State Complexity of k-Union and k-Intersection for Prefix-Free Regular Languages. 78-89 - Viliam Geffert, Andreas Malcher, Katja Meckel, Carlo Mereghetti, Beatrice Palano:
A Direct Construction of Finite State Automata for Pushdown Store Languages. 90-101 - Daniel Goc, Alexandros Palioudakis, Kai Salomaa:
Nondeterministic State Complexity of Proportional Removals. 102-111 - Markus Holzer, Sebastian Jakobi:
Nondeterministic Biautomata and Their Descriptional Complexity. 112-123 - Sebastian Jakobi, Katja Meckel, Carlo Mereghetti, Beatrice Palano:
Queue Automata of Constant Length. 124-135 - Galina Jirásková, Tomás Masopust:
On the State Complexity of the Reverse of - and -Trivial Regular Languages. 136-147 - Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
Size of Unary One-Way Multi-head Finite Automata. 148-159 - Janusz A. Brzozowski, Baiyu Li:
Syntactic Complexity of - and -Trivial Regular Languages. 160-171 - Francisco Mota, Scott Aaronson, Luis Filipe Coelho Antunes, Andre Souto:
Sophistication as Randomness Deficiency. 172-181 - Hamoon Mousavi, Jeffrey O. Shallit:
Shortest Repetition-Free Words Accepted by Automata. 182-193 - Robert S. R. Myers, Henning Urbat:
A Characterisation of NL/poly via Nondeterministic Finite Automata. 194-204 - Alexander Okhotin:
Improved Normal Form for Grammars with One-Sided Contexts. 205-216 - Alexandros Palioudakis, Kai Salomaa, Selim G. Akl:
Comparisons between Measures of Nondeterminism on Finite Automata. 217-228 - Alexandros Palioudakis, Kai Salomaa, Selim G. Akl:
Finite Nondeterminism vs. DFAs with Multiple Initial States. 229-240 - Holger Petersen:
The Power of Centralized PC Systems of Pushdown Automata. 241-252 - Giovanni Pighizzini, Andrea Pisoni:
Limited Automata and Regular Languages. 253-264 - Juraj Sebej:
Reversal on Regular Languages and Descriptional Complexity. 265-276 - Kristína Cevorová:
Kleene Star on Unary Regular Languages. 277-288
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-12-04 01:25 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:
