Matthias Wendlandt

From MaRDI portal
Person:478517

Available identifiers

zbMath Open wendlandt.matthiasMaRDI QIDQ478517

List of research outcomes





PublicationDate of PublicationType
On properties of languages accepted by deterministic pushdown automata with translucent input letters2025-01-20Paper
On the power of pushing or stationary moves for input-driven pushdown automata2024-04-04Paper
Shrinking one-way cellular automata2024-02-09Paper
Complexity of exclusive nondeterministic finite automata2023-08-17Paper
Input-Driven Double-Head Pushdown Automata2023-08-15Paper
State complexity of finite partial languages2023-06-21Paper
State complexity of finite partial languages2023-01-18Paper
State complexity of partial word finite automata2022-11-09Paper
On the power of pushing or stationary moves for input-driven pushdown automata2022-08-16Paper
String assembling systems: comparison to sticker systems and decidability2022-07-06Paper
https://portal.mardi4nfdi.de/entity/Q50163642021-12-13Paper
Self-Verifying Pushdown and Queue Automata2021-11-15Paper
Reversibility for stateless ordered RRWW-automata2021-07-23Paper
Input-driven multi-counter automata2021-06-03Paper
Boosting Reversible Pushdown and Queue Machines by Preprocessing2021-04-19Paper
Multi-stranded string assembling systems2020-10-22Paper
Queue Automata: Foundations and Developments2020-05-28Paper
Input-driven multi-counter automata2020-05-06Paper
Transducing reversibly with finite state machines2019-08-20Paper
Expressive capacity of subregular expressions2019-07-18Paper
Diving into the queue2019-07-18Paper
Parametrizing string assembling systems2018-11-07Paper
Boosting pushdown and queue machines by preprocessing2018-11-07Paper
https://portal.mardi4nfdi.de/entity/Q46093292018-03-29Paper
Descriptional complexity of limited automata2018-03-21Paper
Fast one-way cellular automata with reversible Mealy cells2018-03-08Paper
Reversible Limited Automata2018-01-19Paper
Tinput-Driven Pushdown, Counter, and Stack Automata2018-01-19Paper
On the Computational Complexity of Partial Word Automata Problems2017-11-09Paper
Reversible Queue Automata2017-11-09Paper
Transducing reversibly with finite state machines2017-08-22Paper
Concatenation-free languages2017-06-19Paper
When input-driven pushdown automata meet reversiblity2017-03-24Paper
https://portal.mardi4nfdi.de/entity/Q55070562016-12-16Paper
Descriptional Complexity of Bounded Regular Languages2016-11-09Paper
Reversible Ordered Restarting Automata2016-09-30Paper
Boosting Reversible Pushdown Machines by Preprocessing2016-08-10Paper
Set automata2016-06-23Paper
Deterministic one-way Turing machines with sublinear space2016-05-11Paper
Input-Driven Queue Automata with Internal Transductions2016-04-13Paper
Expressive Capacity of Concatenation Freeness2015-09-23Paper
Reversible Limited Automata2015-09-15Paper
Tinput-Driven Pushdown Automata2015-09-15Paper
On Simulation Cost of Unary Limited Automata2015-08-07Paper
Shrinking One-Way Cellular Automata2015-08-07Paper
Real-Time Reversible One-Way Cellular Automata2015-08-04Paper
Deterministic input-driven queue automata: finite turns, decidability, and closure properties2015-05-18Paper
STATELESS ONE-WAY MULTI-HEAD FINITE AUTOMATA WITH PEBBLES2015-04-23Paper
SIMULATIONS OF UNARY ONE-WAY MULTI-HEAD FINITE AUTOMATA2015-02-09Paper
Parameterized Prefix Distance between Regular Languages2015-01-13Paper
Head and state hierarchies for unary multi-head finite automata2014-12-03Paper
Deterministic Set Automata2014-10-14Paper
Bidirectional string assembling systems2014-08-22Paper
Regularity and Size of Set Automata2014-08-07Paper
Size of Unary One-Way Multi-head Finite Automata2013-08-09Paper
Input-Driven Queue Automata: Finite Turns, Decidability, and Closure Properties2013-08-07Paper
One-Way Multi-Head Finite Automata with Pebbles But No States2013-06-28Paper
String Assembling Systems2012-11-22Paper
States and Heads Do Count for Unary Multi-head Finite Automata2012-11-02Paper

Research outcomes over time

This page was built for person: Matthias Wendlandt