Mathematical Foundations of Computer Science 2014 - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783662445211, 9783662445228

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Decidability of the Interval Temporal Logic $\mathsf{A\bar{A}B\bar{B}}$ over the Rationals

Mathematical Foundations of Computer Science 2014 - Lecture Notes in Computer Science ◽

10.1007/978-3-662-44522-8_38 ◽

2014 ◽

pp. 451-463 ◽

Cited By ~ 1

Author(s):

Angelo Montanari ◽

Gabriele Puppis ◽

Pietro Sala

Keyword(s):

Temporal Logic ◽

Interval Temporal Logic

Download Full-text

Model Checking Concurrent Recursive Programs Using Temporal Logics

Mathematical Foundations of Computer Science 2014 - Lecture Notes in Computer Science ◽

10.1007/978-3-662-44522-8_37 ◽

2014 ◽

pp. 438-450 ◽

Cited By ~ 2

Author(s):

Roy Mennicke

Keyword(s):

Model Checking ◽

Temporal Logics ◽

Recursive Programs

Download Full-text

Information Rate of Some Classes of Non-regular Languages: An Automata-Theoretic Approach

Mathematical Foundations of Computer Science 2014 - Lecture Notes in Computer Science ◽

10.1007/978-3-662-44522-8_20 ◽

2014 ◽

pp. 232-243 ◽

Cited By ~ 3

Author(s):

Cewei Cui ◽

Zhe Dang ◽

Thomas R. Fischer ◽

Oscar H. Ibarra

Keyword(s):

Regular Languages ◽

Information Rate ◽

Theoretic Approach

Download Full-text

An Algebraic Characterization of Unary Two-Way Transducers

Mathematical Foundations of Computer Science 2014 - Lecture Notes in Computer Science ◽

10.1007/978-3-662-44522-8_17 ◽

2014 ◽

pp. 196-207 ◽

Cited By ~ 4

Author(s):

Christian Choffrut ◽

Bruno Guillon

Keyword(s):

Algebraic Characterization

Download Full-text

Transforming Two-Way Alternating Finite Automata to One-Way Nondeterministic Automata

Mathematical Foundations of Computer Science 2014 - Lecture Notes in Computer Science ◽

10.1007/978-3-662-44522-8_25 ◽

2014 ◽

pp. 291-302 ◽

Cited By ~ 2

Author(s):

Viliam Geffert ◽

Alexander Okhotin

Keyword(s):

Finite Automata

Download Full-text

Alternating Vector Addition Systems with States

Mathematical Foundations of Computer Science 2014 - Lecture Notes in Computer Science ◽

10.1007/978-3-662-44522-8_19 ◽

2014 ◽

pp. 220-231 ◽

Cited By ~ 11

Author(s):

Jean-Baptiste Courtois ◽

Sylvain Schmitz

Keyword(s):

Vector Addition

Download Full-text

Complexity of Equivalence and Learning for Multiplicity Tree Automata

Mathematical Foundations of Computer Science 2014 - Lecture Notes in Computer Science ◽

10.1007/978-3-662-44522-8_35 ◽

2014 ◽

pp. 414-425 ◽

Cited By ~ 2

Author(s):

Ines Marusic ◽

James Worrell

Keyword(s):

Tree Automata

Download Full-text

Generalised Lyndon-Schützenberger Equations

Mathematical Foundations of Computer Science 2014 - Lecture Notes in Computer Science ◽

10.1007/978-3-662-44522-8_34 ◽

2014 ◽

pp. 402-413 ◽

Cited By ~ 2

Author(s):

Florin Manea ◽

Mike Müller ◽

Dirk Nowotka ◽

Shinnosuke Seki

Download Full-text

Random Deterministic Automata

Mathematical Foundations of Computer Science 2014 - Lecture Notes in Computer Science ◽

10.1007/978-3-662-44522-8_2 ◽

2014 ◽

pp. 5-23 ◽

Cited By ~ 4

Author(s):

Cyril Nicaud

Keyword(s):

Deterministic Automata

Download Full-text

Reachability in Pushdown Register Automata

Mathematical Foundations of Computer Science 2014 - Lecture Notes in Computer Science ◽

10.1007/978-3-662-44522-8_39 ◽

2014 ◽

pp. 464-473 ◽

Cited By ~ 4

Author(s):

Andrzej S. Murawski ◽

Steven J. Ramsay ◽

Nikos Tzevelekos

Download Full-text

Mathematical Foundations of Computer Science 2014 - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Decidability of the Interval Temporal Logic $\mathsf{A\bar{A}B\bar{B}}$ over the Rationals

Model Checking Concurrent Recursive Programs Using Temporal Logics

Information Rate of Some Classes of Non-regular Languages: An Automata-Theoretic Approach

An Algebraic Characterization of Unary Two-Way Transducers

Transforming Two-Way Alternating Finite Automata to One-Way Nondeterministic Automata

Alternating Vector Addition Systems with States

Complexity of Equivalence and Learning for Multiplicity Tree Automata

Generalised Lyndon-Schützenberger Equations

Random Deterministic Automata

Reachability in Pushdown Register Automata

Mathematical Foundations of Computer Science 2014 - Lecture Notes in Computer Science
Latest Publications