Matthias Wendlandt

Nat. Comput., March, 2024

On the power of pushing or stationary moves for input-driven pushdown automata.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2024

Complexity of Unary Exclusive Nondeterministic Finite Automata.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 14th International Workshop on Non-Classical Models of Automata and Applications (NCMA 2024), 2024

On Properties of Languages Accepted by Deterministic Pushdown Automata with Translucent Input Letters.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Application of Automata, 2024

Deterministic Pushdown Automata with Translucent Input Letters.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory - 28th International Conference, 2024

2023

State complexity of finite partial languages.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2023

Complexity of Exclusive Nondeterministic Finite Automata.

[BibT_eX]

[DOI]

Proceedings of the Descriptional Complexity of Formal Systems, 2023

2022

Input-Driven Double-Head Pushdown Automata.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2022

2021

Input-driven multi-counter automata.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

Self-Verifying Pushdown and Queue Automata.

[BibT_eX]

[DOI]

Henning Fernau

Fundam. Informaticae, 2021

Reversibility for stateless ordered RRWW-automata.

[BibT_eX]

[DOI]

Friedrich Otto

Acta Informatica, 2021

String Assembling Systems: Comparison to Sticker Systems and Decidability.

[BibT_eX]

[DOI]

Proceedings of the Unconventional Computation and Natural Computation, 2021

Formale Aspekte endlicher Automaten entdecken.

[BibT_eX]

[DOI]

Katharina Wendlandt

Proceedings of the 19. GI-Fachtagung Informatik und Schule, 2021

State Complexity of Partial Word Finite Automata.

[BibT_eX]

[DOI]

Proceedings of the Descriptional Complexity of Formal Systems, 2021

2020

Boosting Reversible Pushdown and Queue Machines by Preprocessing.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2020

2019

Transducing reversibly with finite state machines.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Multi-stranded String Assembling Systems.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2019: Theory and Practice of Computer Science, 2019

Informatikunterricht - Ein Muss zur politischen Mündigkeit.

[BibT_eX]

[DOI]

Niko Hausner

Katharina Wendlandt

Proceedings of the Informatik für alle, 18. GI-Fachtagung Informatik und Schule, 2019

2018

Expressive capacity of subregular expressions.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2018

Diving into the queue.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2018

Descriptional complexity of limited automata.

[BibT_eX]

[DOI]

Giovanni Pighizzini

Inf. Comput., 2018

Parametrizing String Assembling Systems.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Application of Automata, 2018

Boosting Pushdown and Queue Machines by Preprocessing.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Application of Automata, 2018

Queue Automata: Foundations and Developments.

[BibT_eX]

[DOI]

Proceedings of the Reversibility and Universality, 2018

2017

Concatenation-free languages.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

Shrinking one-way cellular automata.

[BibT_eX]

[DOI]

Nat. Comput., 2017

Descriptional Complexity of Bounded Regular Languages.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2017

Reversible Limited Automata.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2017

Tinput-Driven Pushdown, Counter, and Stack Automata.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2017

Algorithmisieren im Grundschulalter.

[BibT_eX]

[DOI]

Sabrina Hoffmann

Katharina Wendlandt

Proceedings of the Informatische Bildung zum Verstehen und Gestalten der digitalen Welt, 2017

Self-verifying pushdown automata.

[BibT_eX]

Henning Fernau

Proceedings of the Ninth Workshop on Non-Classical Models of Automata and Applications, 2017

Fast One-Way Cellular Automata with Reversible Mealy Cells.

[BibT_eX]

[DOI]

Proceedings of the Cellular Automata and Discrete Complex Systems, 2017

2016

When input-driven pushdown automata meet reversiblity.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2016

Set Automata.

[BibT_eX]

[DOI]

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

Reversible Queue Automata.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2016

On the Computational Complexity of Partial Word Automata Problems.

[BibT_eX]

[DOI]

Markus Holzer

Sebastian Jakobi

Fundam. Informaticae, 2016

Boosting Reversible Pushdown Machines by Preprocessing.

[BibT_eX]

[DOI]

Proceedings of the Reversible Computation - 8th International Conference, 2016

Input-Driven Queue Automata with Internal Transductions.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2016

2015

Deterministic input-driven queue automata: Finite turns, decidability, and closure properties.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Deterministic One-Way Turing Machines with Sublinear Space.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2015

Expressive Capacity of Concatenation Freeness.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Application of Automata, 2015

Reversible Ordered Restarting Automata.

[BibT_eX]

[DOI]

Friedrich Otto

Kent Kwee

Proceedings of the Reversible Computation - 7th International Conference, 2015

When input-driven pushdown automata meet reversibility.

[BibT_eX]

Proceedings of the Seventh Workshop on Non-Classical Models of Automata and Applications - NCMA 2015, Porto, Portugal, August 31, 2015

Tinput-Driven Pushdown Automata.

[BibT_eX]

[DOI]

Proceedings of the Machines, Computations, and Universality - 7th International Conference, 2015

On Simulation Cost of Unary Limited Automata.

[BibT_eX]

[DOI]

Proceedings of the Descriptional Complexity of Formal Systems, 2015

2014

Nonterminal Controlled String Assembling Systems.

[BibT_eX]

[DOI]

Henning Bordihn

J. Autom. Lang. Comb., 2014

Bidirectional string assembling systems.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2014

Stateless One-Way Multi-Head Finite Automata with Pebbles.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2014

Simulations of Unary One-Way Multi-Head Finite Automata.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2014

Head and state hierarchies for unary multi-head finite automata.

[BibT_eX]

[DOI]

Acta Informatica, 2014

Parameterized Prefix Distance between Regular Languages.

[BibT_eX]

[DOI]

Katja Meckel

Proceedings of the SOFSEM 2014: Theory and Practice of Computer Science, 2014

Deterministic Set Automata.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory - 18th International Conference, 2014

Regularity and Size of Set Automata.

[BibT_eX]

[DOI]

Proceedings of the Descriptional Complexity of Formal Systems, 2014

Real-Time Reversible One-Way Cellular Automata.

[BibT_eX]

[DOI]

Proceedings of the Cellular Automata and Discrete Complex Systems, 2014

2013

Input-Driven Queue Automata: Finite Turns, Decidability, and Closure Properties.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Application of Automata, 2013

Deterministic one-way Turing machines with sublinear space bounds.

[BibT_eX]

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.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory - 17th International Conference, 2013

Size of Unary One-Way Multi-head Finite Automata.

[BibT_eX]

[DOI]

Proceedings of the Descriptional Complexity of Formal Systems, 2013

2012

String Assembling Systems.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2012

States and Heads Do Count for Unary Multi-head Finite Automata.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory - 16th International Conference, 2012

2007

Formalsprachliche Aspekte von XML.

[BibT_eX]

[DOI]