Descriptional complexity of formal systems : 14th international workshop, DCFS 2012, Braga, Portugal, July 23-25, 2012, proceedings / Martin Kutrib, Nelma Moreira, Rogério Reis (eds.).

Annotation

Saved in:
Bibliographic Details
Main Authors: Kutrib, Martin (Author), Moreira, Nelma (Author), Reis, Rogério (Author)
Corporate Author: DCFS (Workshop) Braga, Portugal)
Format: Ebook
Language:English
Published: Berlin ; New York : Springer, [2012]
Series:Lecture notes in computer science ; 7386.
LNCS sublibrary. Theoretical computer science and general issues
Subjects:
Online Access:Springer eBooks
Table of Contents:
  • Computing with Capsules / Jean-Baptiste Jeannin and Dexter Kozen
  • Minicomplexity / Christos A. Kapoutsis
  • Logical Analysis of Hybrid Systems: A Complete Answer to a Complexity Challenge / André Platzer
  • Groups and Automata: A Perfect Match / Pedro V. Silva
  • Uniform Distributed Pushdown Automata Systems / Fernando Arroyo, Juan Castellanos and Victor Mitrana
  • Removing Nondeterminism in Constant Height Pushdown Automata / Zuzana Bednárová, Viliam Geffert, Carlo Mereghetti and Beatrice Palano
  • On Inverse Operations and Their Descriptional Complexity / Maria Paola Bianchi, Markus Holzer, Sebastian Jakobi and Giovanni Pighizzini
  • Deciding Representability of Sets of Words of Equal Length / Francine Blanchet-Sadri and Sean Simmons
  • Syntactic Complexities of Some Classes of Star-Free Languages / Janusz Brzozowski and Baiyu Li
  • Randomness Behaviour in Blum Universal Static Complexity Spaces / Cezar Câmpeanu
  • Production Complexity of Some Operations on Context-Free Languages / Jürgen Dassow and Ronny Harbich
  • State Complexity of Star and Square of Union of k Regular Languages / Yuan Gao and Lila Kari
  • State Complexity of Chop Operations on Unary and Finite Languages / Markus Holzer and Sebastian Jakobi
  • On the Number of Nonterminal Symbols in Unambiguous Conjunctive Grammars / Artur Jeż and Alexander Okhotin
  • Descriptional Complexity of Biautomata / Galina Jirásková and Ondřej Klíma
  • Descriptional Complexity of Pushdown Store Languages / Andreas Malcher, Katja Meckel, Carlo Mereghetti and Beatrice Palano
  • On Internal Contextual Grammars with Subregular Selection Languages / Florin Manea and Bianca Truthe
  • An Infinite Hierarchy of Language Families Resulting from Stateless Pushdown Automata with Limited Pushdown Alphabets / Alexander Meduna, Lukáš Vrábel and Petr Zemek
  • Centralized PC Systems of Pushdown Automata versus Multi-head Pushdown Automata / Friedrich Otto
  • State Complexity and Limited Nondeterminism / Alexandros Palioudakis, Kai Salomaa and Selim G. Akl
  • Bounded Counter Languages / Holger Petersen
  • State Complexity of Projection and Quotient on Unranked Trees / Xiaoxue Piao and Kai Salomaa
  • Iterating Invertible Binary Transducers / Klaus Sutner and Kevin Lewi
  • Minimal DFA for Symmetric Difference NFA / Brink van der Merwe, Hellis Tamm and Lynette van Zijl.
Availability
Requests
Request this item Request this AUT item so you can pick it up when you're at the library.
Interlibrary Loan With Interlibrary Loan you can request the item from another library. It's a free service.