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

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540732075, 9783540732082

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

The Dynamics of Cellular Automata in Shift-Invariant Topologies

Developments in Language Theory - Lecture Notes in Computer Science ◽

10.1007/978-3-540-73208-2_11 ◽

2007 ◽

pp. 84-95 ◽

Cited By ~ 1

Author(s):

Laurent Bienvenu ◽

Mathieu Sablik

Keyword(s):

Cellular Automata

Download Full-text

Approximability and Non-approximability Results in Computing the Mean Speedup of Trace Monoids

Developments in Language Theory - Lecture Notes in Computer Science ◽

10.1007/978-3-540-73208-2_10 ◽

2007 ◽

pp. 72-83

Author(s):

Alberto Bertoni ◽

Roberto Radicioni

Keyword(s):

The Mean

Download Full-text

On First-Order Fragments for Words and Mazurkiewicz Traces

Developments in Language Theory - Lecture Notes in Computer Science ◽

10.1007/978-3-540-73208-2_1 ◽

2007 ◽

pp. 1-19 ◽

Cited By ~ 3

Author(s):

Volker Diekert ◽

Manfred Kufleitner

Keyword(s):

First Order ◽

Mazurkiewicz Traces

Download Full-text

Descriptional Complexity of Nondeterministic Finite Automata

Developments in Language Theory - Lecture Notes in Computer Science ◽

10.1007/978-3-540-73208-2_6 ◽

2007 ◽

pp. 31-35 ◽

Cited By ~ 7

Author(s):

Kai Salomaa

Keyword(s):

Finite Automata ◽

Descriptional Complexity ◽

Nondeterministic Finite Automata

Download Full-text

An Efficient Computation of the Equation $\mathbb{K}$ -Automaton of a Regular $\mathbb{K}$ -Expression

Developments in Language Theory - Lecture Notes in Computer Science ◽

10.1007/978-3-540-73208-2_16 ◽

2007 ◽

pp. 145-156 ◽

Cited By ~ 3

Author(s):

Jean-Marc Champarnaud ◽

Faissal Ouardi ◽

Djelloul Ziadi

Keyword(s):

Efficient Computation

Download Full-text

Fine Hierarchy of Regular Aperiodic ω-Languages

Developments in Language Theory - Lecture Notes in Computer Science ◽

10.1007/978-3-540-73208-2_37 ◽

2007 ◽

pp. 399-410 ◽

Cited By ~ 6

Author(s):

Victor L. Selivanov

Download Full-text

Complexity Theory for Splicing Systems

Developments in Language Theory - Lecture Notes in Computer Science ◽

10.1007/978-3-540-73208-2_29 ◽

2007 ◽

pp. 300-311

Author(s):

Remco Loos ◽

Mitsunori Ogihara

Keyword(s):

Complexity Theory ◽

Splicing Systems

Download Full-text

An Extension of Newton’s Method to ω-Continuous Semirings

Developments in Language Theory - Lecture Notes in Computer Science ◽

10.1007/978-3-540-73208-2_17 ◽

2007 ◽

pp. 157-168 ◽

Cited By ~ 9

Author(s):

Javier Esparza ◽

Stefan Kiefer ◽

Michael Luttenberger

Keyword(s):

Newton’S Method ◽

Newton's Method

Download Full-text

2-Visibly Pushdown Automata

Developments in Language Theory - Lecture Notes in Computer Science ◽

10.1007/978-3-540-73208-2_15 ◽

2007 ◽

pp. 132-144 ◽

Cited By ~ 9

Author(s):

Dario Carotenuto ◽

Aniello Murano ◽

Adriano Peron

Keyword(s):

Visibly Pushdown Automata ◽

Pushdown Automata

Download Full-text

Hairpin Finite Automata

Developments in Language Theory - Lecture Notes in Computer Science ◽

10.1007/978-3-540-73208-2_13 ◽

2007 ◽

pp. 108-119 ◽

Cited By ~ 2

Author(s):

Henning Bordihn ◽

Markus Holzer ◽

Martin Kutrib

Keyword(s):

Finite Automata

Download Full-text

Developments in Language Theory - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

The Dynamics of Cellular Automata in Shift-Invariant Topologies

Approximability and Non-approximability Results in Computing the Mean Speedup of Trace Monoids

On First-Order Fragments for Words and Mazurkiewicz Traces

Descriptional Complexity of Nondeterministic Finite Automata

An Efficient Computation of the Equation $\mathbb{K}$ -Automaton of a Regular $\mathbb{K}$ -Expression

Fine Hierarchy of Regular Aperiodic ω-Languages

Complexity Theory for Splicing Systems

An Extension of Newton’s Method to ω-Continuous Semirings

2-Visibly Pushdown Automata

Hairpin Finite Automata

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