rdf-syntax-grammar
mods:
  schema location: http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
  title info:
    title: Developments in Language Theory
    sub title: 13th International Conference, DLT 2009, Stuttgart, Germany, June 30-July 3, 2009. Proceedings
  name:
    name part: Diekert, Volker.
    role:
      role term: editor.
  name:
    name part: Nowotka, Dirk.
    role:
      role term: editor.
  name:
    name part: SpringerLink (Online service)
  type of resource: text
  origin info:
    place:
      place term: gw
    date issued: 2009
    issuance: monographic
  language:
    language term: eng
  physical description:
    form: electronic
    form: electronic resource
    reformatting quality: access
    form: remote
    extent: XIII, 503 p. online resource.
  table of contents: Invited Talks -- Factorization Forests -- Weighted versus Probabilistic Logics -- Post Correspondence Problem and Small Dimensional Matrices -- Size Complexity of Two-Way Finite Automata -- Matrix Mortality and the ?erný-Pin Conjecture -- Regular Papers -- A Quadratic Upper Bound on the Size of a Synchronizing Word in One-Cluster Automata -- Regular Languages Definable by Majority Quantifiers with Two Variables -- The Inclusion Problem of Context-Free Languages: Some Tractable Cases -- On the Complexity of Deciding Avoidability of Sets of Partial Words -- Closures in Formal Languages and Kuratowski’s Theorem -- Rich and Periodic-Like Words -- Traces of Control-Flow Graphs -- Left and Right Synchronous Relations -- An Extension of the Lyndon Schützenberger Result to Pseudoperiodic Words -- Asymptotic Cellular Complexity -- Strongly Regular Grammars and Regular Approximation of Context-Free Languages -- Powers of Regular Languages -- Existence and Nonexistence of Descriptive Patterns -- On Stateless Multihead Finite Automata and Multihead Pushdown Automata -- On Negative Bases -- Crucial Words for Abelian Powers -- Tight Bounds on the Descriptional Complexity of Regular Expressions -- Subshifts, Languages and Logic -- Magic Numbers and Ternary Alphabet -- The Pumping Lemma for Well-Nested Multiple Context-Free Languages -- The Support of a Recognizable Series over a Zero-Sum Free, Commutative Semiring Is Recognizable -- A Game-Theoretic Characterization of Boolean Grammars -- Word Equations with One Unknown -- On Equations over Sets of Numbers and Their Limitations -- Some Remarks on Superposition Based on Watson-Crick-Like Complementarity -- A Weighted ?-Calculus on Words -- Branching-Time Temporal Logics with Minimal Model Quantifiers -- Simulations by Time-Bounded Counter Machines -- Weighted Timed MSO Logics -- Balanced Words Having Simple Burrows-Wheeler Transform -- On the Complexity of Hmelevskii’s Theorem and Satisfiability of Three Unknown Equations -- Defina…
  note: edited by Volker Diekert, Dirk Nowotka.
  subject:
    topic: Computer science
  subject:
    topic: Computers
  subject:
    topic: Algorithms
  subject:
    topic: Mathematical logic
  subject:
    topic: Computer science
    topic: Mathematics
  subject:
    topic: Computer Science
  subject:
    topic: Mathematical Logic and Formal Languages
  subject:
    topic: Computation by Abstract Devices
  subject:
    topic: Algorithm Analysis and Problem Complexity
  subject:
    topic: Mathematics of Computing
  subject:
    topic: Symbolic and Algebraic Manipulation
  subject:
    topic: Discrete Mathematics in Computer Science
  classification: QA8.9-QA10.3
  classification: 005.131
  related item:
    title info:
      title: Springer eBooks
  related item:
    title info:
      title: Lecture Notes in Computer Science, 5583
  identifier: 9783642027376
  identifier: http://dx.doi.org/10.1007/978-3-642-02737-6
  record info:
    record creation date: 100301
    record change date: 20170118230348.0
    record identifier: 978-3-642-02737-6