Matthias Wendlandt

According to our database1, Matthias Wendlandt
  • authored at least 41 papers between 2007 and 2017.
  • has a "Dijkstra number"2 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2017
Concatenation-free languages.
Theor. Comput. Sci., 2017

Transducing Reversibly with Finite State Machines.
Proceedings of the Implementation and Application of Automata, 2017

Fast One-Way Cellular Automata with Reversible Mealy Cells.
Proceedings of the Cellular Automata and Discrete Complex Systems, 2017

2016
When input-driven pushdown automata meet reversiblity.
RAIRO - Theor. Inf. and Applic., 2016

Set Automata.
Int. J. Found. Comput. Sci., 2016

Reversible Queue Automata.
Fundam. Inform., 2016

On the Computational Complexity of Partial Word Automata Problems.
Fundam. Inform., 2016

Boosting Reversible Pushdown Machines by Preprocessing.
Proceedings of the Reversible Computation - 8th International Conference, 2016

Expressive capacity of subregular expressions.
Proceedings of the Eighth Workshop on Non-Classical Models of Automata and Applications, 2016

Diving into the queue.
Proceedings of the Eighth Workshop on Non-Classical Models of Automata and Applications, 2016

Input-Driven Queue Automata with Internal Transductions.
Proceedings of the Language and Automata Theory and Applications, 2016

Descriptional Complexity of Bounded Regular Languages.
Proceedings of the Descriptional Complexity of Formal Systems, 2016

2015
Deterministic input-driven queue automata: Finite turns, decidability, and closure properties.
Theor. Comput. Sci., 2015

Deterministic One-Way Turing Machines with Sublinear Space.
Fundam. Inform., 2015

Expressive Capacity of Concatenation Freeness.
Proceedings of the Implementation and Application of Automata, 2015

Reversible Ordered Restarting Automata.
Proceedings of the Reversible Computation - 7th International Conference, 2015

When input-driven pushdown automata meet reversibility.
Proceedings of the Seventh Workshop on Non-Classical Models of Automata and Applications - NCMA 2015, Porto, Portugal, August 31, 2015

Reversible Limited Automata.
Proceedings of the Machines, Computations, and Universality - 7th International Conference, 2015

Tinput-Driven Pushdown Automata.
Proceedings of the Machines, Computations, and Universality - 7th International Conference, 2015

On Simulation Cost of Unary Limited Automata.
Proceedings of the Descriptional Complexity of Formal Systems, 2015

Shrinking One-Way Cellular Automata.
Proceedings of the Cellular Automata and Discrete Complex Systems, 2015

2014
Nonterminal Controlled String Assembling Systems.
Journal of Automata, Languages and Combinatorics, 2014

Bidirectional string assembling systems.
RAIRO - Theor. Inf. and Applic., 2014

Stateless One-Way Multi-Head Finite Automata with Pebbles.
Int. J. Found. Comput. Sci., 2014

Simulations of Unary One-Way Multi-Head Finite Automata.
Int. J. Found. Comput. Sci., 2014

Head and state hierarchies for unary multi-head finite automata.
Acta Inf., 2014

Parameterized Prefix Distance between Regular Languages.
Proceedings of the SOFSEM 2014: Theory and Practice of Computer Science, 2014

Reversible queue automata.
Proceedings of the Sixth Workshop on Non-Classical Models for Automata and Applications, 2014

On the computational complexity of partial word automata problems.
Proceedings of the Sixth Workshop on Non-Classical Models for Automata and Applications, 2014

Deterministic Set Automata.
Proceedings of the Developments in Language Theory - 18th International Conference, 2014

Regularity and Size of Set Automata.
Proceedings of the Descriptional Complexity of Formal Systems, 2014

Real-Time Reversible One-Way Cellular Automata.
Proceedings of the Cellular Automata and Discrete Complex Systems, 2014

2013
Input-Driven Queue Automata: Finite Turns, Decidability, and Closure Properties.
Proceedings of the Implementation and Application of Automata, 2013

Deterministic one-way Turing machines with sublinear space bounds.
Proceedings of the Fifth Workshop on Non-Classical Models for Automata and Applications - NCMA 2013, Umeå, Sweden, August 13, 2013

One-Way Multi-Head Finite Automata with Pebbles But No States.
Proceedings of the Developments in Language Theory - 17th International Conference, 2013

Size of Unary One-Way Multi-head Finite Automata.
Proceedings of the Descriptional Complexity of Formal Systems, 2013

2012
String Assembling Systems.
RAIRO - Theor. Inf. and Applic., 2012

Bidirectional String Assembling Systems.
Proceedings of the Fourth Workshop on Non-Classical Models for Automata and Applications, 2012

States and Heads Do Count for Unary Multi-head Finite Automata.
Proceedings of the Developments in Language Theory - 16th International Conference, 2012

2011
String Assembling Systems.
Proceedings of the Third Workshop on Non-Classical Models for Automata and Applications - NCMA 2011, Milan, Italy, July 18, 2011

2007
Formalsprachliche Aspekte von XML.
PhD thesis, 2007


  Loading...