Language and Automata Theory and Applications - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783642283314, 9783642283321

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Feasible Automata for Two-Variable Logic with Successor on Data Words

Language and Automata Theory and Applications - Lecture Notes in Computer Science ◽

10.1007/978-3-642-28332-1_30 ◽

2012 ◽

pp. 351-362 ◽

Cited By ~ 6

Author(s):

Ahmet Kara ◽

Thomas Schwentick ◽

Tony Tan

Keyword(s):

Variable Logic

Download Full-text

One-Way Reversible and Quantum Finite Automata with Advice

Language and Automata Theory and Applications - Lecture Notes in Computer Science ◽

10.1007/978-3-642-28332-1_45 ◽

2012 ◽

pp. 526-537 ◽

Cited By ~ 2

Author(s):

Tomoyuki Yamakami

Keyword(s):

Finite Automata ◽

Quantum Finite Automata

Download Full-text

Isomorphism Testing of Boolean Functions Computable by Constant-Depth Circuits

Language and Automata Theory and Applications - Lecture Notes in Computer Science ◽

10.1007/978-3-642-28332-1_8 ◽

2012 ◽

pp. 83-94

Author(s):

Vikraman Arvind ◽

Yadu Vasudev

Keyword(s):

Boolean Functions ◽

Constant Depth ◽

Constant Depth Circuits

Download Full-text

On Stable and Unstable Limit Sets of Finite Families of Cellular Automata

Language and Automata Theory and Applications - Lecture Notes in Computer Science ◽

10.1007/978-3-642-28332-1_43 ◽

2012 ◽

pp. 502-513

Author(s):

Ville Salo ◽

Ilkka Törmä

Keyword(s):

Cellular Automata ◽

Limit Sets

Download Full-text

k-Automatic Sets of Rational Numbers

Language and Automata Theory and Applications - Lecture Notes in Computer Science ◽

10.1007/978-3-642-28332-1_42 ◽

2012 ◽

pp. 490-501 ◽

Cited By ~ 3

Author(s):

Eric Rowland ◽

Jeffrey Shallit

Keyword(s):

Rational Numbers

Download Full-text

P–NP Threshold for Synchronizing Road Coloring

Language and Automata Theory and Applications - Lecture Notes in Computer Science ◽

10.1007/978-3-642-28332-1_41 ◽

2012 ◽

pp. 480-489 ◽

Cited By ~ 2

Author(s):

Adam Roman

Download Full-text

Polynomial-Time Algorithms for Learning Typed Pattern Languages

Language and Automata Theory and Applications - Lecture Notes in Computer Science ◽

10.1007/978-3-642-28332-1_24 ◽

2012 ◽

pp. 277-288 ◽

Cited By ~ 1

Author(s):

Michael Geilke ◽

Sandra Zilles

Keyword(s):

Polynomial Time ◽

Pattern Languages ◽

Polynomial Time Algorithms

Download Full-text

An Efficient Implicit OBDD-Based Algorithm for Maximal Matchings

Language and Automata Theory and Applications - Lecture Notes in Computer Science ◽

10.1007/978-3-642-28332-1_13 ◽

2012 ◽

pp. 143-154 ◽

Cited By ~ 3

Author(s):

Beate Bollig ◽

Tobias Pröger

Download Full-text

Defining Contexts in Context-Free Grammars

Language and Automata Theory and Applications - Lecture Notes in Computer Science ◽

10.1007/978-3-642-28332-1_10 ◽

2012 ◽

pp. 106-118 ◽

Cited By ~ 4

Author(s):

Mikhail Barash ◽

Alexander Okhotin

Keyword(s):

Context Free ◽

Context Free Grammars

Download Full-text

Patterns with Bounded Treewidth

Language and Automata Theory and Applications - Lecture Notes in Computer Science ◽

10.1007/978-3-642-28332-1_40 ◽

2012 ◽

pp. 468-479 ◽

Cited By ~ 3

Author(s):

Daniel Reidenbach ◽

Markus L. Schmid

Keyword(s):

Bounded Treewidth

Download Full-text

Language and Automata Theory and Applications - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Feasible Automata for Two-Variable Logic with Successor on Data Words

One-Way Reversible and Quantum Finite Automata with Advice

Isomorphism Testing of Boolean Functions Computable by Constant-Depth Circuits

On Stable and Unstable Limit Sets of Finite Families of Cellular Automata

k-Automatic Sets of Rational Numbers

P–NP Threshold for Synchronizing Road Coloring

Polynomial-Time Algorithms for Learning Typed Pattern Languages

An Efficient Implicit OBDD-Based Algorithm for Maximal Matchings

Defining Contexts in Context-Free Grammars

Patterns with Bounded Treewidth

Language and Automata Theory and Applications - Lecture Notes in Computer Science
Latest Publications