Developments in Language Theory - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

46

(FIVE YEARS 0)

H-INDEX

6

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783642223204, 9783642223211

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Inference of Residual Finite-State Tree Automata from Membership Queries and Finite Positive Data

Developments in Language Theory - Lecture Notes in Computer Science ◽

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

2011 ◽

pp. 476-477 ◽

Author(s):

Anna Kasprzik

Keyword(s):

Tree Automata ◽

Membership Queries ◽

Positive Data ◽

Finite State ◽

Download Full-text

Some Remarks on Automata Minimality

Developments in Language Theory - Lecture Notes in Computer Science ◽

10.1007/978-3-642-22321-1_2 ◽

2011 ◽

pp. 15-27 ◽

Author(s):

Antonio Restivo ◽

Roberto Vaglica

Download Full-text

Abelian Primitive Words

Developments in Language Theory - Lecture Notes in Computer Science ◽

10.1007/978-3-642-22321-1_18 ◽

2011 ◽

pp. 204-215 ◽

Author(s):

Michael Domaratzki ◽

Narad Rampersad

Keyword(s):

Primitive Words

Download Full-text

Generalized One-Unambiguity

Developments in Language Theory - Lecture Notes in Computer Science ◽

10.1007/978-3-642-22321-1_12 ◽

2011 ◽

pp. 129-140 ◽

Author(s):

Pascal Caron ◽

Yo-Sub Han ◽

Ludovic Mignot

Download Full-text

Deciding Networks of Evolutionary Processors

Developments in Language Theory - Lecture Notes in Computer Science ◽

10.1007/978-3-642-22321-1_29 ◽

2011 ◽

pp. 337-349 ◽

Author(s):

Florin Manea

Download Full-text

Enumeration and Decidable Properties of Automatic Sequences

Developments in Language Theory - Lecture Notes in Computer Science ◽

10.1007/978-3-642-22321-1_15 ◽

2011 ◽

pp. 165-179 ◽

Author(s):

Émilie Charlier ◽

Narad Rampersad ◽

Jeffrey Shallit

Keyword(s):

Automatic Sequences

Download Full-text

Describing Periodicity in Two-Way Deterministic Finite Automata Using Transformation Semigroups

Developments in Language Theory - Lecture Notes in Computer Science ◽

10.1007/978-3-642-22321-1_28 ◽

2011 ◽

pp. 324-336 ◽

Author(s):

Michal Kunc ◽

Alexander Okhotin

Keyword(s):

Finite Automata ◽

Transformation Semigroups ◽

Deterministic Finite Automata

Download Full-text

Chop Operations and Expressions: Descriptional Complexity Considerations

Developments in Language Theory - Lecture Notes in Computer Science ◽

10.1007/978-3-642-22321-1_23 ◽

2011 ◽

pp. 264-275 ◽

Author(s):

Markus Holzer ◽

Sebastian Jakobi

Keyword(s):

Descriptional Complexity

Download Full-text

On Prefix Normal Words

Developments in Language Theory - Lecture Notes in Computer Science ◽

10.1007/978-3-642-22321-1_20 ◽

2011 ◽

pp. 228-238 ◽

Author(s):

Gabriele Fici ◽

Zsuzsanna Lipták

Download Full-text

Nodes Connected by Path Languages

Developments in Language Theory - Lecture Notes in Computer Science ◽

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

2011 ◽

pp. 276-287 ◽

Author(s):

Markus Holzer ◽

Martin Kutrib ◽

Ursula Leiter

Download Full-text