Borrow it
Coverart for item
The Resource Mathematical foundations of computer science 2014 : 39th International Symposium, MFCS 2014, Budapest, Hungary, August 25-29, 2014. Proceedings, Part I, Erzsébet Csuhaj-Varjú, Martin Dietzfelbinger, Zoltán Ésik (eds.)

Mathematical foundations of computer science 2014 : 39th International Symposium, MFCS 2014, Budapest, Hungary, August 25-29, 2014. Proceedings, Part I, Erzsébet Csuhaj-Varjú, Martin Dietzfelbinger, Zoltán Ésik (eds.)

Creator
Editor
Contributor
Summary
This two volume set LNCS 8634 and LNCS 8635 constitutes the refereed conference proceedings of the 39th International Symposium on Mathematical Foundations of Computer Science, MFCS 2014, held in Budapest, Hungary, in August 2014. The 95 revised full papers presented together with 6 invited talks were carefully selected from 270 submissions. The focus of the conference was on following topics: Logic, Semantics, Automata, Theory of Programming, Algorithms, Complexity, Parallel and Distributed Computing, Quantum Computing, Automata, Grammars and Formal Languages, Combinatorics on Words, Trees and Games
Language
eng
Work
Publication
Extent
1 online resource (xxvi, 561 pages)
Note
  • International conference proceedings
  • Includes author index
Contents
  • Table of Contents
  • Volume I.-Invited contributions
  • Partial-Observation Stochastic Reachability and Parity Games
  • Every graph is easy or hard: dichotomy theorems for graph problems
  • Computer Poker and Computational Game Theory
  • Random Deterministic Automata
  • Communication Complexity Theory: Thirty-Five Years of Set Disjointness
  • What does the local structure of a planar graph tell us about its global structure?
  • Logic, Semantics, Automata and Theory of Programming
  • Choiceless Polynomial Time on structures with small Abelian colour Classes
  • Sofic-Dyck shifts
  • A Logical Characterization of Timed (non- )Regular Languages
  • Asymptotic Monadic Second-Order Logic
  • Towards Efficient Reasoning Under Guarded-based Disjunctive Existential Rules
  • Alternating Parity Krivine Automata
  • Advances in Parametric Real-Time Reasoning
  • Universal Lyndon Words
  • Subword complexity and decomposition of the set of factors
  • Cyclic Complexity of Words
  • Classifying Recognizable Infinitary Trace Languages Using Word Automata
  • Bounded variable logic, parameterized logarithmic space, and Savitch's Theorem
  • An algebraic characterization of unary two-way transducers
  • Size-Change Abstraction and Max-Plus Automata
  • Alternating Vector Addition Systems with States
  • Information Rate of Some Classes of Non-regular Languages: An Automata-theoretic Approach
  • Relating Nominal and Higher-Order Rewriting
  • Expressivity and Succinctness of Order-Invariant Logics on Depth-Bounded Structures
  • Two Recursively Inseparable Problems for Probabilistic Automata
  • Monadic Second-Order Logic with Arbitrary Monadic Predicates
  • Transforming two-way alternating finite automata to one-way nondeterministic automata
  • Measure Properties of Game Tree Languages
  • On Upper and Lower Bounds on the Length of Alternating Towers
  • LaxF: Side Conditions and External Evidence as Monads
  • The monoid of queue actions
  • Undecidable properties of self-affine sets and multi-tape automata
  • Complexity and Expressivity of Uniform One-Dimensional Fragment with Equality
  • A Unifying Approach for Multistack Pushdown Automata
  • Definability and Transformations for Cost Logics and Automatic Structures
  • Generalised Lyndon-Schützenberger Equations
  • Complexity of Equivalence and Learning for Multiplicity Tree Automata
  • Monadic datalog and regular tree pattern queries
  • Model Checking Concurrent Recursive Programs using Temporal Logics
  • Decidability of the interval temporal logic AABB over the rationals
  • Reachability in Pushdown Register Automata
  • A Generalization of the Łos-Tarski Preservation Theorem over Classes of Finite Structures
  • Determinising Parity Automata
  • Tight Bounds for Complementing Parity Automata
  • On Infinite Words Determined by Indexed Languages
  • A Pumping Lemma for Two-Way Finite Transducers
  • Tractability Frontier for Dually-Closed Ord-Horn Quantified Constraint Satisfaction Problems
  • The Dynamic Descriptive Complexity of k-Clique
Isbn
9783662445211
Instance
Label
Mathematical foundations of computer science 2014 : 39th International Symposium, MFCS 2014, Budapest, Hungary, August 25-29, 2014. Proceedings, Part I
Title
Mathematical foundations of computer science 2014
Title remainder
39th International Symposium, MFCS 2014, Budapest, Hungary, August 25-29, 2014. Proceedings
Title number
Part I
Statement of responsibility
Erzsébet Csuhaj-Varjú, Martin Dietzfelbinger, Zoltán Ésik (eds.)
Title variation
MFCS 2014
Creator
Contributor
Editor
Subject
Genre
Language
eng
Summary
This two volume set LNCS 8634 and LNCS 8635 constitutes the refereed conference proceedings of the 39th International Symposium on Mathematical Foundations of Computer Science, MFCS 2014, held in Budapest, Hungary, in August 2014. The 95 revised full papers presented together with 6 invited talks were carefully selected from 270 submissions. The focus of the conference was on following topics: Logic, Semantics, Automata, Theory of Programming, Algorithms, Complexity, Parallel and Distributed Computing, Quantum Computing, Automata, Grammars and Formal Languages, Combinatorics on Words, Trees and Games
Member of
Cataloging source
GW5XE
Dewey number
004.01/51
Illustrations
illustrations
Index
index present
LC call number
QA76.9.M35
Literary form
non fiction
http://bibfra.me/vocab/lite/meetingDate
2014
http://bibfra.me/vocab/lite/meetingName
Symposium on Mathematical Foundations of Computer Science (1972- )
Nature of contents
dictionaries
http://library.link/vocab/relatedWorkOrContributorDate
1951-
http://library.link/vocab/relatedWorkOrContributorName
  • Csuhaj-Varjú, E.
  • Dietzfelbinger, Martin
  • Ésik, Zoltán
Series statement
  • Lecture Notes in Computer Science,
  • LNCS sublibrary. SL 1, Theoretical computer science and general issues
Series volume
8634
http://library.link/vocab/subjectName
  • Computer science
  • Computer programming
  • Computer algorithms
  • Computer algorithms
  • Computer programming
  • Computer science
Label
Mathematical foundations of computer science 2014 : 39th International Symposium, MFCS 2014, Budapest, Hungary, August 25-29, 2014. Proceedings, Part I, Erzsébet Csuhaj-Varjú, Martin Dietzfelbinger, Zoltán Ésik (eds.)
Instantiates
Publication
Note
  • International conference proceedings
  • Includes author index
Antecedent source
unknown
Carrier category
online resource
Carrier category code
  • cr
Carrier MARC source
rdacarrier
Color
multicolored
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent
Contents
Table of Contents -- Volume I.-Invited contributions -- Partial-Observation Stochastic Reachability and Parity Games -- Every graph is easy or hard: dichotomy theorems for graph problems -- Computer Poker and Computational Game Theory -- Random Deterministic Automata -- Communication Complexity Theory: Thirty-Five Years of Set Disjointness -- What does the local structure of a planar graph tell us about its global structure? -- Logic, Semantics, Automata and Theory of Programming -- Choiceless Polynomial Time on structures with small Abelian colour Classes -- Sofic-Dyck shifts -- A Logical Characterization of Timed (non- )Regular Languages -- Asymptotic Monadic Second-Order Logic -- Towards Efficient Reasoning Under Guarded-based Disjunctive Existential Rules -- Alternating Parity Krivine Automata -- Advances in Parametric Real-Time Reasoning -- Universal Lyndon Words -- Subword complexity and decomposition of the set of factors -- Cyclic Complexity of Words -- Classifying Recognizable Infinitary Trace Languages Using Word Automata -- Bounded variable logic, parameterized logarithmic space, and Savitch's Theorem -- An algebraic characterization of unary two-way transducers -- Size-Change Abstraction and Max-Plus Automata -- Alternating Vector Addition Systems with States -- Information Rate of Some Classes of Non-regular Languages: An Automata-theoretic Approach -- Relating Nominal and Higher-Order Rewriting -- Expressivity and Succinctness of Order-Invariant Logics on Depth-Bounded Structures -- Two Recursively Inseparable Problems for Probabilistic Automata -- Monadic Second-Order Logic with Arbitrary Monadic Predicates -- Transforming two-way alternating finite automata to one-way nondeterministic automata -- Measure Properties of Game Tree Languages -- On Upper and Lower Bounds on the Length of Alternating Towers -- LaxF: Side Conditions and External Evidence as Monads -- The monoid of queue actions -- Undecidable properties of self-affine sets and multi-tape automata -- Complexity and Expressivity of Uniform One-Dimensional Fragment with Equality -- A Unifying Approach for Multistack Pushdown Automata -- Definability and Transformations for Cost Logics and Automatic Structures -- Generalised Lyndon-Schützenberger Equations -- Complexity of Equivalence and Learning for Multiplicity Tree Automata -- Monadic datalog and regular tree pattern queries -- Model Checking Concurrent Recursive Programs using Temporal Logics -- Decidability of the interval temporal logic AABB over the rationals -- Reachability in Pushdown Register Automata -- A Generalization of the Łos-Tarski Preservation Theorem over Classes of Finite Structures -- Determinising Parity Automata -- Tight Bounds for Complementing Parity Automata -- On Infinite Words Determined by Indexed Languages -- A Pumping Lemma for Two-Way Finite Transducers -- Tractability Frontier for Dually-Closed Ord-Horn Quantified Constraint Satisfaction Problems -- The Dynamic Descriptive Complexity of k-Clique
Control code
889234537
Dimensions
unknown
Extent
1 online resource (xxvi, 561 pages)
File format
unknown
Form of item
online
Isbn
9783662445211
Level of compression
unknown
Media category
computer
Media MARC source
rdamedia
Media type code
  • c
Other control number
10.1007/978-3-662-44522-8
Other physical details
illustrations
Quality assurance targets
not applicable
Reformatting quality
unknown
Sound
unknown sound
Specific material designation
remote
System control number
(OCoLC)889234537
Label
Mathematical foundations of computer science 2014 : 39th International Symposium, MFCS 2014, Budapest, Hungary, August 25-29, 2014. Proceedings, Part I, Erzsébet Csuhaj-Varjú, Martin Dietzfelbinger, Zoltán Ésik (eds.)
Publication
Note
  • International conference proceedings
  • Includes author index
Antecedent source
unknown
Carrier category
online resource
Carrier category code
  • cr
Carrier MARC source
rdacarrier
Color
multicolored
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent
Contents
Table of Contents -- Volume I.-Invited contributions -- Partial-Observation Stochastic Reachability and Parity Games -- Every graph is easy or hard: dichotomy theorems for graph problems -- Computer Poker and Computational Game Theory -- Random Deterministic Automata -- Communication Complexity Theory: Thirty-Five Years of Set Disjointness -- What does the local structure of a planar graph tell us about its global structure? -- Logic, Semantics, Automata and Theory of Programming -- Choiceless Polynomial Time on structures with small Abelian colour Classes -- Sofic-Dyck shifts -- A Logical Characterization of Timed (non- )Regular Languages -- Asymptotic Monadic Second-Order Logic -- Towards Efficient Reasoning Under Guarded-based Disjunctive Existential Rules -- Alternating Parity Krivine Automata -- Advances in Parametric Real-Time Reasoning -- Universal Lyndon Words -- Subword complexity and decomposition of the set of factors -- Cyclic Complexity of Words -- Classifying Recognizable Infinitary Trace Languages Using Word Automata -- Bounded variable logic, parameterized logarithmic space, and Savitch's Theorem -- An algebraic characterization of unary two-way transducers -- Size-Change Abstraction and Max-Plus Automata -- Alternating Vector Addition Systems with States -- Information Rate of Some Classes of Non-regular Languages: An Automata-theoretic Approach -- Relating Nominal and Higher-Order Rewriting -- Expressivity and Succinctness of Order-Invariant Logics on Depth-Bounded Structures -- Two Recursively Inseparable Problems for Probabilistic Automata -- Monadic Second-Order Logic with Arbitrary Monadic Predicates -- Transforming two-way alternating finite automata to one-way nondeterministic automata -- Measure Properties of Game Tree Languages -- On Upper and Lower Bounds on the Length of Alternating Towers -- LaxF: Side Conditions and External Evidence as Monads -- The monoid of queue actions -- Undecidable properties of self-affine sets and multi-tape automata -- Complexity and Expressivity of Uniform One-Dimensional Fragment with Equality -- A Unifying Approach for Multistack Pushdown Automata -- Definability and Transformations for Cost Logics and Automatic Structures -- Generalised Lyndon-Schützenberger Equations -- Complexity of Equivalence and Learning for Multiplicity Tree Automata -- Monadic datalog and regular tree pattern queries -- Model Checking Concurrent Recursive Programs using Temporal Logics -- Decidability of the interval temporal logic AABB over the rationals -- Reachability in Pushdown Register Automata -- A Generalization of the Łos-Tarski Preservation Theorem over Classes of Finite Structures -- Determinising Parity Automata -- Tight Bounds for Complementing Parity Automata -- On Infinite Words Determined by Indexed Languages -- A Pumping Lemma for Two-Way Finite Transducers -- Tractability Frontier for Dually-Closed Ord-Horn Quantified Constraint Satisfaction Problems -- The Dynamic Descriptive Complexity of k-Clique
Control code
889234537
Dimensions
unknown
Extent
1 online resource (xxvi, 561 pages)
File format
unknown
Form of item
online
Isbn
9783662445211
Level of compression
unknown
Media category
computer
Media MARC source
rdamedia
Media type code
  • c
Other control number
10.1007/978-3-662-44522-8
Other physical details
illustrations
Quality assurance targets
not applicable
Reformatting quality
unknown
Sound
unknown sound
Specific material designation
remote
System control number
(OCoLC)889234537

Subject

Genre

Member of

Library Locations

    • Thomas Jefferson LibraryBorrow it
      1 University Blvd, St. Louis, MO, 63121, US
      38.710138 -90.311107

Library Links

Structured data from the Bibframe namespace is licensed under the Creative Commons Attribution 4.0 International License by University of Missouri-St. Louis Libraries. Additional terms may apply to data associated with third party namespaces.
Processing Feedback ...