default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMatthias Wendlandt
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j29]Martin Kutrib
, Matthias Wendlandt:
Variants of string assembling systems. Nat. Comput. 23(1): 131-156 (2024)- [j28]Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
On the power of pushing or stationary moves for input-driven pushdown automata. Theor. Comput. Sci. 996: 114503 (2024) - [c43]Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano, Priscilla Raucci, Matthias Wendlandt:
Deterministic Pushdown Automata with Translucent Input Letters. DLT 2024: 203-217 - [c42]Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano, Priscilla Raucci, Matthias Wendlandt:
On Properties of Languages Accepted by Deterministic Pushdown Automata with Translucent Input Letters. CIAA 2024: 208-220 - [i1]Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
Complexity of Unary Exclusive Nondeterministic Finite Automata. CoRR abs/2409.06967 (2024) - 2023
- [j27]Martin Kutrib, Matthias Wendlandt:
State complexity of finite partial languages. Theor. Comput. Sci. 966-967: 114001 (2023) - [c41]Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
Complexity of Exclusive Nondeterministic Finite Automata. DCFS 2023: 121-133 - 2022
- [j26]Markus Holzer, Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
Input-Driven Double-Head Pushdown Automata. Int. J. Found. Comput. Sci. 33(3&4): 285-311 (2022) - [c40]Martin Kutrib, Matthias Wendlandt:
State Complexity of Finite Partial Languages. DCFS 2022: 170-183 - [c39]Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
On the Power of Pushing or Stationary Moves for Input-Driven Pushdown Automata. CIAA 2022: 140-151 - 2021
- [j25]Friedrich Otto, Matthias Wendlandt:
Reversibility for stateless ordered RRWW-automata. Acta Informatica 58(4): 397-425 (2021) - [j24]Henning Fernau, Martin Kutrib, Matthias Wendlandt:
Self-Verifying Pushdown and Queue Automata. Fundam. Informaticae 180(1-2): 1-28 (2021) - [j23]Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
Input-driven multi-counter automata. Theor. Comput. Sci. 870: 121-136 (2021) - [c38]Martin Kutrib, Matthias Wendlandt:
State Complexity of Partial Word Finite Automata. DCFS 2021: 113-124 - [c37]Katharina Wendlandt, Matthias Wendlandt:
Formale Aspekte endlicher Automaten entdecken. INFOS 2021: 231-239 - [c36]Martin Kutrib, Matthias Wendlandt:
String Assembling Systems: Comparison to Sticker Systems and Decidability. UCNC 2021: 101-115 - 2020
- [j22]Holger Bock Axelsen, Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
Boosting Reversible Pushdown and Queue Machines by Preprocessing. Int. J. Found. Comput. Sci. 31(8): 1021-1049 (2020)
2010 – 2019
- 2019
- [j21]Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
Transducing reversibly with finite state machines. Theor. Comput. Sci. 787: 111-126 (2019) - [c35]Niko Hausner, Katharina Wendlandt, Matthias Wendlandt:
Informatikunterricht - Ein Muss zur politischen Mündigkeit. INFOS 2019: 109-118 - [c34]Martin Kutrib, Matthias Wendlandt:
Multi-stranded String Assembling Systems. SOFSEM 2019: 285-297 - [c33]Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
Input-Driven Multi-counter Automata. CIAA 2019: 197-208 - 2018
- [j20]Martin Kutrib, Giovanni Pighizzini, Matthias Wendlandt:
Descriptional complexity of limited automata. Inf. Comput. 259(2): 259-276 (2018) - [j19]Simon Beier, Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
Diving into the queue. RAIRO Theor. Informatics Appl. 52(2-3-4): 89-110 (2018) - [j18]Martin Kutrib, Matthias Wendlandt:
Expressive capacity of subregular expressions. RAIRO Theor. Informatics Appl. 52(2-3-4): 201-218 (2018) - [c32]Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
Boosting Pushdown and Queue Machines by Preprocessing. CIAA 2018: 28-40 - [c31]Martin Kutrib, Matthias Wendlandt:
Parametrizing String Assembling Systems. CIAA 2018: 236-247 - [p1]Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
Queue Automata: Foundations and Developments. Reversibility and Universality 2018: 385-431 - 2017
- [j17]Martin Kutrib, Matthias Wendlandt:
Reversible Limited Automata. Fundam. Informaticae 155(1-2): 31-58 (2017) - [j16]Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
Tinput-Driven Pushdown, Counter, and Stack Automata. Fundam. Informaticae 155(1-2): 59-88 (2017) - [j15]Andrea Herrmann, Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
Descriptional Complexity of Bounded Regular Languages. J. Autom. Lang. Comb. 22(1-3): 93-121 (2017) - [j14]Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
Shrinking one-way cellular automata. Nat. Comput. 16(3): 383-396 (2017) - [j13]Martin Kutrib, Matthias Wendlandt:
Concatenation-free languages. Theor. Comput. Sci. 679: 83-94 (2017) - [c30]Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
Fast One-Way Cellular Automata with Reversible Mealy Cells. AUTOMATA 2017: 139-150 - [c29]Henning Fernau, Martin Kutrib, Matthias Wendlandt:
Self-verifying pushdown automata. NCMA 2017: 103-117 - [c28]Sabrina Hoffmann, Katharina Wendlandt, Matthias Wendlandt:
Algorithmisieren im Grundschulalter. INFOS 2017: 73-82 - [c27]Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
Transducing Reversibly with Finite State Machines. CIAA 2017: 151-162 - [c26]Markus Holzer, Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
Input-Driven Double-Head Pushdown Automata. AFL 2017: 128-142 - 2016
- [j12]Markus Holzer, Sebastian Jakobi, Matthias Wendlandt:
On the Computational Complexity of Partial Word Automata Problems. Fundam. Informaticae 148(3-4): 267-289 (2016) - [j11]Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
Reversible Queue Automata. Fundam. Informaticae 148(3-4): 341-368 (2016) - [j10]Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
Set Automata. Int. J. Found. Comput. Sci. 27(2): 187-214 (2016) - [j9]Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
When input-driven pushdown automata meet reversiblity. RAIRO Theor. Informatics Appl. 50(4): 313-330 (2016) - [c25]Andrea Herrmann, Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
Descriptional Complexity of Bounded Regular Languages. DCFS 2016: 138-152 - [c24]Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
Input-Driven Queue Automata with Internal Transductions. LATA 2016: 156-167 - [c23]Simon Beier, Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
Diving into the queue. NCMA 2016: 89-104 - [c22]Martin Kutrib, Matthias Wendlandt:
Expressive capacity of subregular expressions. NCMA 2016: 227-242 - [c21]Holger Bock Axelsen, Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
Boosting Reversible Pushdown Machines by Preprocessing. RC 2016: 89-104 - 2015
- [j8]Martin Kutrib, Julien Provillard, György Vaszil, Matthias Wendlandt:
Deterministic One-Way Turing Machines with Sublinear Space. Fundam. Informaticae 136(1-2): 139-155 (2015) - [j7]Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano, Matthias Wendlandt:
Deterministic input-driven queue automata: Finite turns, decidability, and closure properties. Theor. Comput. Sci. 578: 58-71 (2015) - [c20]Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
Shrinking One-Way Cellular Automata. Automata 2015: 141-154 - [c19]Martin Kutrib, Matthias Wendlandt:
On Simulation Cost of Unary Limited Automata. DCFS 2015: 153-164 - [c18]Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
Tinput-Driven Pushdown Automata. MCU 2015: 94-112 - [c17]Martin Kutrib, Matthias Wendlandt:
Reversible Limited Automata. MCU 2015: 113-128 - [c16]Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
When input-driven pushdown automata meet reversibility. NCMA 2015: 141-157 - [c15]Friedrich Otto, Matthias Wendlandt, Kent Kwee:
Reversible Ordered Restarting Automata. RC 2015: 60-75 - [c14]Martin Kutrib, Matthias Wendlandt:
Expressive Capacity of Concatenation Freeness. CIAA 2015: 199-210 - 2014
- [j6]Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
Head and state hierarchies for unary multi-head finite automata. Acta Informatica 51(8): 553-569 (2014) - [j5]Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
Simulations of Unary One-Way Multi-Head Finite Automata. Int. J. Found. Comput. Sci. 25(7): 877-896 (2014) - [j4]Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
Stateless One-Way Multi-Head Finite Automata with Pebbles. Int. J. Found. Comput. Sci. 25(8): 1141-1160 (2014) - [j3]Martin Kutrib, Matthias Wendlandt:
Bidirectional string assembling systems. RAIRO Theor. Informatics Appl. 48(1): 39-59 (2014) - [j2]Henning Bordihn, Martin Kutrib, Matthias Wendlandt:
Nonterminal Controlled String Assembling Systems. J. Autom. Lang. Comb. 19(1-4): 33-44 (2014) - [c13]Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
Real-Time Reversible One-Way Cellular Automata. Automata 2014: 56-69 - [c12]Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
Regularity and Size of Set Automata. DCFS 2014: 282-293 - [c11]Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
Deterministic Set Automata. Developments in Language Theory 2014: 303-314 - [c10]Markus Holzer, Sebastian Jakobi, Matthias Wendlandt:
On the computational complexity of partial word automata problems. NCMA 2014: 131-146 - [c9]Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
Reversible queue automata. NCMA 2014: 163-178 - [c8]Martin Kutrib, Katja Meckel, Matthias Wendlandt:
Parameterized Prefix Distance between Regular Languages. SOFSEM 2014: 419-430 - 2013
- [c7]Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
Size of Unary One-Way Multi-head Finite Automata. DCFS 2013: 148-159 - [c6]Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
One-Way Multi-Head Finite Automata with Pebbles But No States. Developments in Language Theory 2013: 313-324 - [c5]Martin Kutrib, Julien Provillard, György Vaszil, Matthias Wendlandt:
Deterministic one-way Turing machines with sublinear space bounds. NCMA 2013: 195-208 - [c4]Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano, Matthias Wendlandt:
Input-Driven Queue Automata: Finite Turns, Decidability, and Closure Properties. CIAA 2013: 232-243 - 2012
- [j1]Martin Kutrib, Matthias Wendlandt:
String Assembling Systems. RAIRO Theor. Informatics Appl. 46(4): 593-613 (2012) - [c3]Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
States and Heads Do Count for Unary Multi-head Finite Automata. Developments in Language Theory 2012: 214-225 - [c2]Martin Kutrib, Matthias Wendlandt:
Bidirectional String Assembling Systems. NCMA 2012: 107-121 - 2011
- [c1]Martin Kutrib, Matthias Wendlandt:
String Assembling Systems. NCMA 2011: 179-192
2000 – 2009
- 2007
- [b1]Matthias Wendlandt:
Formalsprachliche Aspekte von XML. University of Giessen, Gießen, Germany, 2007
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-15 21:35 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
