Abstract is missing.
- Back to the Future: A Fresh Look at Linear Temporal LogicJavier Esparza. 3-13 [doi]
- Say No to Case Analysis: Automating the Drudgery of Case-Based ProofsJeffrey O. Shallit. 14-24 [doi]
- Regularity Conditions for Iterated Shuffle on Commutative Regular LanguagesStefan Hoffmann. 27-38 [doi]
- Memoized Regular ExpressionsBrink van der Merwe, Jacobie Mouton, Steyn van Litsenborgh, Martin Berglund. 39-52 [doi]
- The Commutative Closure of Shuffle Languages over Group Languages is RegularStefan Hoffmann. 53-64 [doi]
- Efficient Enumeration of Regular Expressions for Faster Regular Expression SynthesisSu-Hyeon Kim, Hyeonseung Im, Sang-Ki Ko. 65-76 [doi]
- Degrees of Restriction for Two-Dimensional AutomataTaylor J. Smith, Kai Salomaa. 77-89 [doi]
- The Range of State Complexities of Languages Resulting from the Cascade Product - The Unary Case (Extended Abstract)Markus Holzer 0001, Christian Rauch. 90-101 [doi]
- Guessing the Buffer Bound for k-SynchronizabilityCinzia Di Giusto, Laetitia Laversa, Étienne Lozes. 102-114 [doi]
- State Complexity of Permutation and Related Decision Problems on Alphabetical Pattern ConstraintsStefan Hoffmann. 115-126 [doi]
- Algorithms for Probabilistic and Stochastic Subsequential Failure TransducersDiana Geneva, Georgi Shopov, Stoyan Mihov. 127-139 [doi]
- Ambiguity Hierarchies for Weighted Tree AutomataAndreas Maletti, Teodora Nasz, Kevin Stier, Markus Ulbricht 0001. 140-151 [doi]
- Boolean Kernels of Context-Free LanguagesMartin Kutrib, Luca Prigioniero. 152-164 [doi]
- Efficient String Matching Based on a Two-Step Simulation of the Suffix AutomatonSimone Faro, Stefano Scafiti. 165-177 [doi]
- Approximate Hashing for BioinformaticsGuy Arbitman, Shmuel T. Klein, Pierre Peterlongo, Dana Shapira. 178-189 [doi]