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

9783642009815, 9783642009822

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Monadic Second-Order Logic for Graphs: Algorithmic and Language Theoretical Applications

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

10.1007/978-3-642-00982-2_2 ◽

2009 ◽

pp. 19-22

Author(s):

Bruno Courcelle

Keyword(s):

Second Order ◽

Order Logic ◽

Second Order Logic ◽

Monadic Second Order Logic

Download Full-text

Analysing Complexity in Classes of Unary Automatic Structures

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

10.1007/978-3-642-00982-2_44 ◽

2009 ◽

pp. 518-529

Author(s):

Jiamou Liu ◽

Mia Minnes

Keyword(s):

Automatic Structures

Download Full-text

On Extended Regular Expressions

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

10.1007/978-3-642-00982-2_24 ◽

2009 ◽

pp. 279-289 ◽

Cited By ~ 7

Author(s):

Benjamin Carle ◽

Paliath Narendran

Keyword(s):

Regular Expressions ◽

Extended Regular Expressions

Download Full-text

Descriptional and Computational Complexity of Finite Automata

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

10.1007/978-3-642-00982-2_3 ◽

2009 ◽

pp. 23-42 ◽

Cited By ~ 9

Author(s):

Markus Holzer ◽

Martin Kutrib

Keyword(s):

Computational Complexity ◽

Finite Automata

Download Full-text

Picture Languages Generated by Assembling Tiles

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

10.1007/978-3-642-00982-2_19 ◽

2009 ◽

pp. 224-235 ◽

Cited By ~ 1

Author(s):

Paola Bonizzoni ◽

Claudio Ferretti ◽

Anthonath Roslin Sagaya Mary ◽

Giancarlo Mauri

Keyword(s):

Picture Languages

Download Full-text

Constructing Infinite Words of Intermediate Arithmetical Complexity

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

10.1007/978-3-642-00982-2_59 ◽

2009 ◽

pp. 696-701 ◽

Cited By ~ 1

Author(s):

Paul V. Salimov

Keyword(s):

Infinite Words

Download Full-text

The Fault Tolerance of NP-Hard Problems

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

10.1007/978-3-642-00982-2_32 ◽

2009 ◽

pp. 374-385

Author(s):

Christian Glaßer ◽

A. Pavan ◽

Stephen Travers

Keyword(s):

Fault Tolerance ◽

Np Hard ◽

Hard Problems ◽

Np Hard Problems

Download Full-text

One-Clock Deterministic Timed Automata Are Efficiently Identifiable in the Limit

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

10.1007/978-3-642-00982-2_63 ◽

2009 ◽

pp. 740-751 ◽

Cited By ~ 3

Author(s):

Sicco Verwer ◽

Mathijs de Weerdt ◽

Cees Witteveen

Keyword(s):

Timed Automata

Download Full-text

On Parallel Communicating Grammar Systems and Correctness Preserving Restarting Automata

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

10.1007/978-3-642-00982-2_56 ◽

2009 ◽

pp. 660-671 ◽

Cited By ~ 1

Author(s):

Dana Pardubská ◽

Martin Plátek ◽

Friedrich Otto

Keyword(s):

Grammar Systems ◽

Parallel Communicating Grammar Systems

Download Full-text

Nested Counters in Bit-Parallel String Matching

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

10.1007/978-3-642-00982-2_29 ◽

2009 ◽

pp. 338-349 ◽

Cited By ~ 3

Author(s):

Kimmo Fredriksson ◽

Szymon Grabowski

Keyword(s):

String Matching ◽

Parallel String Matching

Download Full-text

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

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Monadic Second-Order Logic for Graphs: Algorithmic and Language Theoretical Applications

Analysing Complexity in Classes of Unary Automatic Structures

On Extended Regular Expressions

Descriptional and Computational Complexity of Finite Automata

Picture Languages Generated by Assembling Tiles

Constructing Infinite Words of Intermediate Arithmetical Complexity

The Fault Tolerance of NP-Hard Problems

One-Clock Deterministic Timed Automata Are Efficiently Identifiable in the Limit

On Parallel Communicating Grammar Systems and Correctness Preserving Restarting Automata

Nested Counters in Bit-Parallel String Matching

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