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

9783642130885, 9783642130892

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Extending Stochastic Context-Free Grammars for an Application in Bioinformatics

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

10.1007/978-3-642-13089-2_49 ◽

2010 ◽

pp. 585-595 ◽

Cited By ~ 2

Author(s):

Frank Weinberg ◽

Markus E. Nebel

Keyword(s):

Stochastic Context Free Grammars ◽

Context Free ◽

Context Free Grammars

Download Full-text

SA-REPC – Sequence Alignment with Regular Expression Path Constraint

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

10.1007/978-3-642-13089-2_38 ◽

2010 ◽

pp. 451-462

Author(s):

Nimrod Milo ◽

Tamar Pinhas ◽

Michal Ziv-Ukelson

Keyword(s):

Sequence Alignment ◽

Regular Expression ◽

Path Constraint

Download Full-text

Analysis of Communicating Automata

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

10.1007/978-3-642-13089-2_4 ◽

2010 ◽

pp. 50-57 ◽

Cited By ~ 9

Author(s):

Anca Muscholl

Keyword(s):

Communicating Automata

Download Full-text

A Simple n-Dimensional Intrinsically Universal Quantum Cellular Automaton

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

10.1007/978-3-642-13089-2_6 ◽

2010 ◽

pp. 70-81 ◽

Cited By ~ 4

Author(s):

Pablo Arrighi ◽

Jonathan Grattage

Keyword(s):

Cellular Automaton ◽

Universal Quantum

Download Full-text

Primitive Words Are Unavoidable for Context-Free Languages

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

10.1007/978-3-642-13089-2_34 ◽

2010 ◽

pp. 403-413 ◽

Cited By ~ 1

Author(s):

Peter Leupold

Keyword(s):

Primitive Words ◽

Context Free

Download Full-text

Restarting Automata with Structured Output and Functional Generative Description

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

10.1007/978-3-642-13089-2_42 ◽

2010 ◽

pp. 500-511 ◽

Cited By ~ 1

Author(s):

Martin Plátek ◽

František Mráz ◽

Markéta Lopatková

Keyword(s):

Structured Output

Download Full-text

CD-Systems of Stateless Deterministic R(1)-Automata Accept All Rational Trace Languages

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

10.1007/978-3-642-13089-2_39 ◽

2010 ◽

pp. 463-474 ◽

Cited By ~ 9

Author(s):

Benedek Nagy ◽

Friedrich Otto

Download Full-text

Short Witnesses and Accepting Lassos in ω-Automata

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

10.1007/978-3-642-13089-2_22 ◽

2010 ◽

pp. 261-272 ◽

Cited By ~ 8

Author(s):

Rüdiger Ehlers

Download Full-text

Avoidable Binary Patterns in Partial Words

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

10.1007/978-3-642-13089-2_9 ◽

2010 ◽

pp. 106-117 ◽

Cited By ~ 2

Author(s):

Francine Blanchet-Sadri ◽

Robert Mercaş ◽

Sean Simmons ◽

Eric Weissenstein

Keyword(s):

Partial Words

Download Full-text

Abelian Square-Free Partial Words

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

10.1007/978-3-642-13089-2_8 ◽

2010 ◽

pp. 94-105 ◽

Cited By ~ 2

Author(s):

Francine Blanchet-Sadri ◽

Jane I. Kim ◽

Robert Mercaş ◽

William Severa ◽

Sean Simmons

Keyword(s):

Partial Words

Download Full-text

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

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Extending Stochastic Context-Free Grammars for an Application in Bioinformatics

SA-REPC – Sequence Alignment with Regular Expression Path Constraint

Analysis of Communicating Automata

A Simple n-Dimensional Intrinsically Universal Quantum Cellular Automaton

Primitive Words Are Unavoidable for Context-Free Languages

Restarting Automata with Structured Output and Functional Generative Description

CD-Systems of Stateless Deterministic R(1)-Automata Accept All Rational Trace Languages

Short Witnesses and Accepting Lassos in ω-Automata

Avoidable Binary Patterns in Partial Words

Abelian Square-Free Partial Words

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