default search action
12th DCFS 2010: Saskatoon, Canada
- Ian McQuillan, Giovanni Pighizzini:
Proceedings Twelfth Annual Workshop on Descriptional Complexity of Formal Systems, DCFS 2010, Saskatoon, Canada, 8-10th August 2010. EPTCS 31, 2010 - Przemyslaw Prusinkiewicz, Mitra Shirmohammadi, Faramarz Samavati:
L-systems in Geometric Modeling. 3-14 - Martin Kappes, Andreas Malcher, Detlef Wotschke:
Remembering Chandra Kintala. 15-26 - Janusz A. Brzozowski, Baiyu Li, Yuli Ye:
On the Complexity of the Evaluation of Transient Extensions of Boolean Functions. 27-37 - Cristian Calude, Kai Salomaa, Tania Roblot:
Finite-State Complexity and the Size of Transducers. 38-47 - Emilie Charlier, Narad Rampersad, Michel Rigo, Laurent Waxweiler:
State Complexity of Testing Divisibility. 48-57 - Bo Cui, Yuan Gao, Lila Kari, Sheng Yu:
State Complexity of Catenation Combined with Star and Reversal. 58-67 - Jürgen Dassow, Florin Manea:
Accepting Hybrid Networks of Evolutionary Processors with Special Topologies and Small Communication. 68-77 - Zoltán Ésik:
Representing Small Ordinals by Finite Automata. 78-87 - Rudolf Freund, Marian Kogler, Yurii Rogozhin, Sergey Verlan:
Graph-Controlled Insertion-Deletion Systems. 88-98 - Yuan Gao, Kai Salomaa, Sheng Yu:
Transition Complexity of Incomplete DFAs. 99-109 - Markus Holzer, Sebastian Jakobi, Martin Kutrib:
The Magic Number Problem for Subregular Language Families. 110-119 - Lila Kari, Afroza Rahman:
Ciliate Gene Unscrambling with Fewer Templates. 120-129 - Ondrej Klíma, Libor Polák:
Descriptional Complexity of the Languages KaL: Automata, Monoids and Varieties. 130-138 - Nelma Moreira, Davide Nabais, Rogério Reis:
State Elimination Ordering Strategies: Some Experimental Results. 139-148 - Xiaoxue Piao, Kai Salomaa:
Operational State Complexity of Deterministic Unranked Tree Automata. 149-158 - Xiaoxue Piao, Kai Salomaa:
Transformations Between Different Types of Unranked Bottom-Up Tree Automata. 159-168 - Ronny Polley, Ludwig Staiger:
The Maximal Subword Complexity of Quasiperiodic Infinite Words. 169-176 - Bianca Truthe:
On the Descriptional Complexity of Limited Propagating Lindenmayer Systems. 177-188 - Yo-Sub Han, Kai Salomaa:
Nondeterministic State Complexity for Suffix-Free Regular Languages. 189-196 - Galina Jirásková, Monika Krausová:
Complexity in Prefix-Free Regular Languages. 197-204 - Anna Kasprzik:
Learning Residual Finite-State Automata Using Observation Tables. 205-212
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.