default search action
Martin Kutrib
Person information
- affiliation: University of Giessen, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j135]Martin Kutrib, Andreas Malcher:
Reversible Computations of One-Way Counter Automata. RAIRO Theor. Informatics Appl. 58: 5 (2024) - [j134]Martin Kutrib, Matthias Wendlandt:
Variants of string assembling systems. Nat. Comput. 23(1): 131-156 (2024) - [j133]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) - [c173]Martin Kutrib, Andreas Malcher:
Cellular Automata: Communication Matters. CiE 2024: 32-43 - [c172]Martin Kutrib, Andreas Malcher:
Cellular Automata: From Black-and-White to High Gloss Color. DLT 2024: 22-36 - [c171]Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano, Priscilla Raucci, Matthias Wendlandt:
Deterministic Pushdown Automata with Translucent Input Letters. DLT 2024: 203-217 - [c170]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 - [c169]Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
Complexity of Unary Exclusive Nondeterministic Finite Automata. NCMA 2024: 136-149 - 2023
- [j132]Jürgen Dassow, Martin Kutrib, Giovanni Pighizzini:
25 Editions of DCFS: Origins and Directions. Bull. EATCS 141 (2023) - [j131]Martin Kutrib, Uwe Meyer:
Reversible Top-Down Syntax Analysis. Int. J. Found. Comput. Sci. 34(2&3): 225-251 (2023) - [j130]Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano:
Iterated Uniform Finite-State Transducers: Descriptional Complexity of Nondeterminism and Two-Way Motion. J. Autom. Lang. Comb. 28(1-3): 59-88 (2023) - [j129]Martin Kutrib, Uwe Meyer:
Syntax checking either way. Theor. Comput. Sci. 966-967: 114000 (2023) - [j128]Martin Kutrib, Matthias Wendlandt:
State complexity of finite partial languages. Theor. Comput. Sci. 966-967: 114001 (2023) - [j127]Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano:
Iterated uniform finite-state transducers on unary languages. Theor. Comput. Sci. 969: 114049 (2023) - [c168]Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
Complexity of Exclusive Nondeterministic Finite Automata. DCFS 2023: 121-133 - [c167]Martin Kutrib, Uwe Meyer:
Tree-Walking-Storage Automata. DLT 2023: 182-194 - [c166]Martin Kutrib:
Sweeping Input-Driven Pushdown Automata. CIAA 2023: 194-205 - [c165]Martin Kutrib, Uwe Meyer:
Deterministic Real-Time Tree-Walking-Storage Automata. NCMA 2023: 48-62 - [c164]Martin Kutrib, Andreas Malcher:
Reversible Two-Party Computations. AFL 2023: 142-154 - [e11]Martin Kutrib, Uwe Meyer:
Reversible Computation - 15th International Conference, RC 2023, Giessen, Germany, July 18-19, 2023, Proceedings. Lecture Notes in Computer Science 13960, Springer 2023, ISBN 978-3-031-38099-0 [contents] - 2022
- [j126]Martin Kutrib, Andreas Malcher, Christian Schneider:
Finite automata with undirected state graphs. Acta Informatica 59(1): 163-181 (2022) - [j125]Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano:
Computational and Descriptional Power of Nondeterministic Iterated Uniform Finite-State Transducers. Fundam. Informaticae 185(4): 337-356 (2022) - [j124]Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano:
Descriptional complexity of iterated uniform finite-state transducers. Inf. Comput. 284: 104691 (2022) - [j123]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) - [j122]Holger Bock Axelsen, Martin Kutrib, Andreas Malcher:
Reversible Shrinking Two-Pushdown Automata. J. Autom. Lang. Comb. 27(1-3): 47-77 (2022) - [j121]Martin Kutrib, Andreas Malcher:
Iterative arrays with finite inter-cell communication. Nat. Comput. 21(1): 3-15 (2022) - [j120]Martin Kutrib:
Iterative arrays with self-verifying communication cell. Nat. Comput. 21(1): 39-51 (2022) - [j119]Martin Kutrib, Andreas Malcher:
One-dimensional pattern generation by cellular automata. Nat. Comput. 21(3): 361-375 (2022) - [c163]Martin Kutrib, Matthias Wendlandt:
State Complexity of Finite Partial Languages. DCFS 2022: 170-183 - [c162]Niklas Deworetzki, Martin Kutrib, Uwe Meyer, Pia-Doreen Ritzke:
Optimizing Reversible Programs. RC 2022: 224-238 - [c161]Martin Kutrib, Uwe Meyer:
Syntax Checking Either Way. CIAA 2022: 128-139 - [c160]Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
On the Power of Pushing or Stationary Moves for Input-Driven Pushdown Automata. CIAA 2022: 140-151 - [c159]Martin Kutrib, Andreas Malcher:
Reversible Computations of One-Way Counter Automata. NCMA 2022: 126-142 - [i2]Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano:
Computational and Descriptional Power of Nondeterministic Iterated Uniform Finite-State Transducers. CoRR abs/2205.15631 (2022) - 2021
- [j118]Martin Kutrib, Andreas Malcher:
String Generation by Cellular Automata. Complex Syst. 30(2): 111-132 (2021) - [j117]Henning Fernau, Martin Kutrib, Matthias Wendlandt:
Self-Verifying Pushdown and Queue Automata. Fundam. Informaticae 180(1-2): 1-28 (2021) - [j116]Markus Holzer, Martin Kutrib, Friedrich Otto:
Two-Sided Strictly Locally Testable Languages. Fundam. Informaticae 180(1-2): 29-51 (2021) - [j115]Bruno Guillon, Martin Kutrib, Andreas Malcher, Luca Prigioniero:
Reversible pushdown transducers. Inf. Comput. 281: 104813 (2021) - [j114]Markus Holzer, Martin Kutrib:
Preface. Int. J. Found. Comput. Sci. 32(5): 417-418 (2021) - [j113]Martin Kutrib, Andreas Malcher:
Digging input-driven pushdown automata. RAIRO Theor. Informatics Appl. 55: 1-19 (2021) - [j112]Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
Input-driven multi-counter automata. Theor. Comput. Sci. 870: 121-136 (2021) - [c158]Martin Kutrib, Matthias Wendlandt:
State Complexity of Partial Word Finite Automata. DCFS 2021: 113-124 - [c157]Martin Kutrib, Uwe Meyer:
Reversible Top-Down Syntax Analysis. DLT 2021: 255-266 - [c156]Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano:
Iterated Transduction on Unary Languages. ICTCS 2021: 87-92 - [c155]Martin Kutrib, Uwe Meyer, Niklas Deworetzki, Marc Schuster:
Compiling Janus to RSSA. RC 2021: 64-78 - [c154]Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano:
Iterated Uniform Finite-State Transducers on Unary Languages. SOFSEM 2021: 218-232 - [c153]Martin Kutrib, Matthias Wendlandt:
String Assembling Systems: Comparison to Sticker Systems and Decidability. UCNC 2021: 101-115 - [c152]Martin Kutrib, Luca Prigioniero:
Boolean Kernels of Context-Free Languages. CIAA 2021: 152-164 - [p7]Hermann Gruber, Markus Holzer, Martin Kutrib:
Descriptional complexity of regular languages. Handbook of Automata Theory (I.) 2021: 411-457 - [p6]Martin Kutrib, Nelma Moreira, Giovanni Pighizzini, Rogério Reis:
Hot Current Topics of Descriptional Complexity. IFIP's Exciting First 60+ Years 2021: 3-28 - 2020
- [j111]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) - [j110]Markus Holzer, Martin Kutrib:
Automata That May Change Their Mind. J. Autom. Lang. Comb. 25(2-3): 115-140 (2020) - [j109]Martin Kutrib, Friedrich Otto:
On Two-Sided Locally Testable Languages. J. Autom. Lang. Comb. 25(2-3): 171-199 (2020) - [j108]Martin Kutrib, Thomas Worsch:
Self-Verifying Cellular Automata. J. Cell. Autom. 15(3): 223-242 (2020) - [j107]Jan M. Baetens, Martin Kutrib:
Preface. Nat. Comput. 19(4): 757-758 (2020) - [c151]Martin Kutrib, Andreas Malcher:
One-Dimensional Pattern Generation by Cellular Automata. ACRI 2020: 46-55 - [c150]Martin Kutrib, Andreas Malcher:
Cellular String Generators. Automata 2020: 59-70 - [c149]Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano:
Deterministic and Nondeterministic Iterated Uniform Finite-State Transducers: Computational and Descriptional Power. CiE 2020: 87-99 - [c148]Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano:
Iterated Uniform Finite-State Transducers: Descriptional Complexity of Nondeterminism and Two-Way Motion. DCFS 2020: 117-129 - [c147]Martin Kutrib:
Kernels of Sub-classes of Context-Free Languages. SOFSEM 2020: 136-147 - [p5]Bogdan Aman, Gabriel Ciobanu, Robert Glück, Robin Kaarsgaard, Jarkko Kari, Martin Kutrib, Ivan Lanese, Claudio Antares Mezzina, Lukasz Mikulski, Rajagopal Nagarajan, Iain C. C. Phillips, G. Michele Pinna, Luca Prigioniero, Irek Ulidowski, Germán Vidal:
Foundations of Reversible Computation. Selected Results of the COST Action IC1405 2020: 1-40 - [e10]Emil Sekerinski, Nelma Moreira, José N. Oliveira, Daniel Ratiu, Riccardo Guidotti, Marie Farrell, Matt Luckcuck, Diego Marmsoler, José Creissac Campos, Troy Astarte, Laure Gonnord, Antonio Cerone, Luis Couto, Brijesh Dongol, Martin Kutrib, Pedro Monteiro, David Delmas:
Formal Methods. FM 2019 International Workshops - Porto, Portugal, October 7-11, 2019, Revised Selected Papers, Part I. Lecture Notes in Computer Science 12232, Springer 2020, ISBN 978-3-030-54993-0 [contents] - [e9]Emil Sekerinski, Nelma Moreira, José N. Oliveira, Daniel Ratiu, Riccardo Guidotti, Marie Farrell, Matt Luckcuck, Diego Marmsoler, José Creissac Campos, Troy Astarte, Laure Gonnord, Antonio Cerone, Luis Couto, Brijesh Dongol, Martin Kutrib, Pedro Monteiro, David Delmas:
Formal Methods. FM 2019 International Workshops - Porto, Portugal, October 7-11, 2019, Revised Selected Papers, Part II. Lecture Notes in Computer Science 12233, Springer 2020, ISBN 978-3-030-54996-1 [contents]
2010 – 2019
- 2019
- [j106]Simon Beier, Markus Holzer, Martin Kutrib:
Operational State Complexity and Decidability of Jumping Finite Automata. Int. J. Found. Comput. Sci. 30(1): 5-27 (2019) - [j105]Markus Holzer, Martin Kutrib:
One-Time Nondeterministic Computations. Int. J. Found. Comput. Sci. 30(6-7): 1069-1089 (2019) - [j104]Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
Transducing reversibly with finite state machines. Theor. Comput. Sci. 787: 111-126 (2019) - [c146]Martin Kutrib, Andreas Malcher:
Iterative Arrays with Finite Inter-cell Communication. Automata 2019: 35-47 - [c145]Martin Kutrib, Thomas Worsch:
Iterative Arrays with Self-verifying Communication Cell. Automata 2019: 77-90 - [c144]Markus Holzer, Martin Kutrib:
Non-Recursive Trade-Offs Are "Almost Everywhere". CiE 2019: 25-36 - [c143]Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano:
Descriptional Complexity of Iterated Uniform Finite-State Transducers. DCFS 2019: 223-234 - [c142]Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano:
Iterated Uniform Finite-State Transducers. ICTCS 2019: 52-57 - [c141]Martin Kutrib, Andreas Malcher:
Digging input-driven pushdown automata. NCMA 2019: 109-124 - [c140]Martin Kutrib, Matthias Wendlandt:
Multi-stranded String Assembling Systems. SOFSEM 2019: 285-297 - [c139]Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
Input-Driven Multi-counter Automata. CIAA 2019: 197-208 - 2018
- [j103]Martin Kutrib, Giovanni Pighizzini, Matthias Wendlandt:
Descriptional complexity of limited automata. Inf. Comput. 259(2): 259-276 (2018) - [j102]Markus Holzer, Sebastian Jakobi, Martin Kutrib:
Minimal Reversible Deterministic Finite Automata. Int. J. Found. Comput. Sci. 29(2): 251-270 (2018) - [j101]Simon Beier, Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
Diving into the queue. RAIRO Theor. Informatics Appl. 52(2-3-4): 89-110 (2018) - [j100]Martin Kutrib, Matthias Wendlandt:
Expressive capacity of subregular expressions. RAIRO Theor. Informatics Appl. 52(2-3-4): 201-218 (2018) - [j99]Antonios Dimitriadis, Martin Kutrib, Georgios Ch. Sirakoulis:
Revisiting the cutting of the firing squad synchronization. Nat. Comput. 17(3): 455-465 (2018) - [c138]Martin Kutrib, Thomas Worsch:
Self-verifying Cellular Automata. ACRI 2018: 340-351 - [c137]Martin Kutrib, Andreas Malcher, Christian Schneider:
Finite Automata with Undirected State Graphs. DCFS 2018: 212-223 - [c136]Bruno Guillon, Martin Kutrib, Andreas Malcher, Luca Prigioniero:
Reversible Pushdown Transducers. DLT 2018: 354-365 - [c135]Markus Holzer, Martin Kutrib:
Automata that may change their mind. NCMA 2018: 83-98 - [c134]Martin Kutrib, Friedrich Otto:
Two-sided locally testable languages. NCMA 2018: 133-148 - [c133]Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
Boosting Pushdown and Queue Machines by Preprocessing. CIAA 2018: 28-40 - [c132]Martin Kutrib, Matthias Wendlandt:
Parametrizing String Assembling Systems. CIAA 2018: 236-247 - [p4]Martin Kutrib, Andreas Malcher:
Cellular Automata: Descriptional Complexity and Decidability. Reversibility and Universality 2018: 129-168 - [p3]Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
Queue Automata: Foundations and Developments. Reversibility and Universality 2018: 385-431 - [e8]Jan M. Baetens, Martin Kutrib:
Cellular Automata and Discrete Complex Systems - 24th IFIP WG 1.5 International Workshop, AUTOMATA 2018, Ghent, Belgium, June 20-22, 2018, Proceedings. Lecture Notes in Computer Science 10875, Springer 2018, ISBN 978-3-319-92674-2 [contents] - 2017
- [j98]Martin Kutrib, Matthias Wendlandt:
Reversible Limited Automata. Fundam. Informaticae 155(1-2): 31-58 (2017) - [j97]Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
Tinput-Driven Pushdown, Counter, and Stack Automata. Fundam. Informaticae 155(1-2): 59-88 (2017) - [j96]Holger Bock Axelsen, Markus Holzer, Martin Kutrib:
The Degree of Irreversibility in Deterministic Finite Automata. Int. J. Found. Comput. Sci. 28(5): 503-522 (2017) - [j95]Suna Bensch, Johanna Björklund, Martin Kutrib:
Deterministic Stack Transducers. Int. J. Found. Comput. Sci. 28(5): 583-602 (2017) - [j94]Andrea Herrmann, Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
Descriptional Complexity of Bounded Regular Languages. J. Autom. Lang. Comb. 22(1-3): 93-121 (2017) - [j93]Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
Shrinking one-way cellular automata. Nat. Comput. 16(3): 383-396 (2017) - [j92]Martin Kutrib, Matthias Wendlandt:
Concatenation-free languages. Theor. Comput. Sci. 679: 83-94 (2017) - [j91]Markus Holzer, Sebastian Jakobi, Martin Kutrib:
The chop of languages. Theor. Comput. Sci. 682: 122-137 (2017) - [j90]Martin Kutrib, Andreas Malcher:
One-way reversible multi-head finite automata. Theor. Comput. Sci. 682: 149-164 (2017) - [c131]Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
Fast One-Way Cellular Automata with Reversible Mealy Cells. AUTOMATA 2017: 139-150 - [c130]Markus Holzer, Martin Kutrib:
Structure and Complexity of Some Subregular Language Families. The Role of Theory in Computer Science 2017: 59-82 - [c129]Markus Holzer, Martin Kutrib:
One-Time Nondeterministic Computations. DCFS 2017: 177-188 - [c128]Simon Beier, Markus Holzer, Martin Kutrib:
Operational State Complexity and Decidability of Jumping Finite Automata. DLT 2017: 96-108 - [c127]Henning Fernau, Martin Kutrib, Matthias Wendlandt:
Self-verifying pushdown automata. NCMA 2017: 103-117 - [c126]Markus Holzer, Martin Kutrib, Friedrich Otto:
Two-sided strictly locally testable languages. NCMA 2017: 135-150 - [c125]Markus Holzer, Martin Kutrib:
Reversible Nondeterministic Finite Automata. RC 2017: 35-51 - [c124]Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
Transducing Reversibly with Finite State Machines. CIAA 2017: 151-162 - [c123]Simon Beier, Markus Holzer, Martin Kutrib:
On the Descriptional Complexity of Operations on Semilinear Sets. AFL 2017: 41-55 - [c122]Markus Holzer, Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
Input-Driven Double-Head Pushdown Automata. AFL 2017: 128-142 - 2016
- [j89]Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
Reversible Queue Automata. Fundam. Informaticae 148(3-4): 341-368 (2016) - [j88]Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
Set Automata. Int. J. Found. Comput. Sci. 27(2): 187-214 (2016) - [j87]Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
When input-driven pushdown automata meet reversiblity. RAIRO Theor. Informatics Appl. 50(4): 313-330 (2016) - [j86]Markus Holzer, Martin Kutrib, Bianca Truthe:
Editorial. J. Autom. Lang. Comb. 21(1-2): 3-4 (2016) - [j85]Markus Holzer, Martin Kutrib, Bianca Truthe:
Preface. J. Autom. Lang. Comb. 21(1-2): 5-6 (2016) - [j84]Martin Kutrib, Andreas Malcher:
Iterative Arrays with Set Storage. J. Cell. Autom. 12(1-2): 7-26 (2016) - [c121]Antonios Dimitriadis, Martin Kutrib, Georgios Ch. Sirakoulis:
Cutting the Firing Squad Synchronization. ACRI 2016: 123-133 - [c120]Andrea Herrmann, Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
Descriptional Complexity of Bounded Regular Languages. DCFS 2016: 138-152 - [c119]Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
Input-Driven Queue Automata with Internal Transductions. LATA 2016: 156-167 - [c118]Holger Bock Axelsen, Markus Holzer, Martin Kutrib, Andreas Malcher:
Reversible Shrinking Two-Pushdown Automata. LATA 2016: 579-591 - [c117]Simon Beier, Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
Diving into the queue. NCMA 2016: 89-104 - [c116]Martin Kutrib, Matthias Wendlandt:
Expressive capacity of subregular expressions. NCMA 2016: 227-242 - [c115]Holger Bock Axelsen, Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
Boosting Reversible Pushdown Machines by Preprocessing. RC 2016: 89-104 - [c114]Holger Bock Axelsen, Markus Holzer, Martin Kutrib:
The Degree of Irreversibility in Deterministic Finite Automata. CIAA 2016: 15-26 - [c113]Suna Bensch, Johanna Björklund, Martin Kutrib:
Deterministic Stack Transducers. CIAA 2016: 27-38 - 2015
- [j83]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) - [j82]Markus Holzer, Martin Kutrib:
Preface. Int. J. Found. Comput. Sci. 26(7): 803-804 (2015) - [j81]Henning Bordihn, Martin Kutrib, Andreas Malcher:
Returning Parallel Communicating Finite Automata with Communication Bounds: Hierarchies, Decidabilities, and Undecidabilities. Int. J. Found. Comput. Sci. 26(8): 1101-1126 (2015) - [j80]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) - [c112]Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
Shrinking One-Way Cellular Automata. Automata 2015: 141-154 - [c111]Martin Kutrib, Matthias Wendlandt:
On Simulation Cost of Unary Limited Automata. DCFS 2015: 153-164 - [c110]Markus Holzer, Sebastian Jakobi, Martin Kutrib:
Minimal Reversible Deterministic Finite Automata. DLT 2015: 276-287 - [c109]Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
Tinput-Driven Pushdown Automata. MCU 2015: 94-112 - [c108]Martin Kutrib, Matthias Wendlandt:
Reversible Limited Automata. MCU 2015: 113-128 - [c107]Martin Kutrib:
Reversible and Irreversible Computations of Deterministic Finite-State Devices. MFCS (1) 2015: 38-52 - [c106]Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
When input-driven pushdown automata meet reversibility. NCMA 2015: 141-157 - [c105]Holger Bock Axelsen, Sebastian Jakobi, Martin Kutrib, Andreas Malcher:
A Hierarchy of Fast Reversible Turing Machines. RC 2015: 29-44 - [c104]Martin Kutrib, Matthias Wendlandt:
Expressive Capacity of Concatenation Freeness. CIAA 2015: 199-210 - 2014
- [j79]Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
Head and state hierarchies for unary multi-head finite automata. Acta Informatica 51(8): 553-569 (2014) - [j78]Martin Kutrib, Andreas Malcher, Giovanni Pighizzini:
Oblivious two-way finite automata: Decidability and complexity. Inf. Comput. 237: 294-302 (2014) - [j77]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) - [j76]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) - [j75]Martin Kutrib, Matthias Wendlandt:
Bidirectional string assembling systems. RAIRO Theor. Informatics Appl. 48(1): 39-59 (2014) - [j74]Henning Bordihn, Martin Kutrib, Matthias Wendlandt:
Nonterminal Controlled String Assembling Systems. J. Autom. Lang. Comb. 19(1-4): 33-44 (2014) - [j73]Markus Holzer, Martin Kutrib:
Self-Assembling Pushdown Automata. J. Autom. Lang. Comb. 19(1-4): 107-118 (2014) - [j72]Jarkko Kari, Martin Kutrib, Andreas Malcher:
Preface. J. Cell. Autom. 9(5-6): 339 (2014) - [c103]Martin Kutrib, Andreas Malcher:
Iterative Arrays with Set Storage. ACRI 2014: 25-34 - [c102]Martin Kutrib:
Complexity of One-Way Cellular Automata. Automata 2014: 3-18 - [c101]Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
Real-Time Reversible One-Way Cellular Automata. Automata 2014: 56-69 - [c100]Martin Kutrib:
Aspects of Reversibility for Classical Automata. Computing with New Resources 2014: 83-98 - [c99]Martin Kutrib:
Complexity of Operation Problems. CiE 2014: 255-264 - [c98]Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
Regularity and Size of Set Automata. DCFS 2014: 282-293 - [c97]Martin Kutrib, Andreas Malcher:
Measuring Communication in Automata Systems - (Invited Paper). Developments in Language Theory 2014: 260-274 - [c96]Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
Deterministic Set Automata. Developments in Language Theory 2014: 303-314 - [c95]Enrico Formenti, Markus Holzer, Martin Kutrib, Julien Provillard:
ω-rational Languages: High Complexity Classes vs. Borel Hierarchy. LATA 2014: 372-383 - [c94]Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
Reversible queue automata. NCMA 2014: 163-178 - [c93]Martin Kutrib, Thomas Worsch:
Degrees of Reversibility for DFA and DPDA. RC 2014: 40-53 - [c92]Martin Kutrib, Katja Meckel, Matthias Wendlandt:
Parameterized Prefix Distance between Regular Languages. SOFSEM 2014: 419-430 - [c91]Henning Bordihn, Martin Kutrib, Andreas Malcher:
Measuring Communication in Parallel Communicating Finite Automata. AFL 2014: 124-138 - [e7]Markus Holzer, Martin Kutrib:
Implementation and Application of Automata - 19th International Conference, CIAA 2014, Giessen, Germany, July 30 - August 2, 2014. Proceedings. Lecture Notes in Computer Science 8587, Springer 2014, ISBN 978-3-319-08845-7 [contents] - 2013
- [j71]Martin Kutrib, Giovanni Pighizzini:
Recent Trends in Descriptional Complexity of Formal Languages. Bull. EATCS 111 (2013) - [j70]Martin Kutrib, Andreas Malcher:
One-Dimensional Cellular Automaton Transducers. Fundam. Informaticae 126(2-3): 201-224 (2013) - [j69]Martin Kutrib, Friedrich Otto:
On the Descriptional Complexity of the Window Size for Deleting Restarting Automata. Int. J. Found. Comput. Sci. 24(6): 831-846 (2013) - [c90]Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
Size of Unary One-Way Multi-head Finite Automata. DCFS 2013: 148-159 - [c89]Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
One-Way Multi-Head Finite Automata with Pebbles But No States. Developments in Language Theory 2013: 313-324 - [c88]Martin Kutrib, Julien Provillard, György Vaszil, Matthias Wendlandt:
Deterministic one-way Turing machines with sublinear space bounds. NCMA 2013: 195-208 - [c87]Martin Kutrib, Thomas Worsch:
Time-Symmetric Machines. RC 2013: 168-181 - [c86]Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano, Matthias Wendlandt:
Input-Driven Queue Automata: Finite Turns, Decidability, and Closure Properties. CIAA 2013: 232-243 - [e6]Jarkko Kari, Martin Kutrib, Andreas Malcher:
Cellular Automata and Discrete Complex Systems - 19th International Workshop, AUTOMATA 2013, Gießen, Germany, September 17-19, 2013. Proceedings. Lecture Notes in Computer Science 8155, Springer 2013, ISBN 978-3-642-40866-3 [contents] - 2012
- [j68]Markus Holzer, Sebastian Jakobi, Martin Kutrib:
The Magic Number Problem for Subregular Language Families. Int. J. Found. Comput. Sci. 23(1): 115-131 (2012) - [j67]Henning Bordihn, Martin Kutrib, Andreas Malcher:
On the Computational Capacity of Parallel Communicating Finite Automata. Int. J. Found. Comput. Sci. 23(3): 713-732 (2012) - [j66]Martin Kutrib:
Non-deterministic cellular automata and languages. Int. J. Gen. Syst. 41(6): 555-568 (2012) - [j65]Martin Kutrib, Matthias Wendlandt:
String Assembling Systems. RAIRO Theor. Informatics Appl. 46(4): 593-613 (2012) - [j64]Jürgen Dassow, Martin Kutrib, Nelma Moreira, Rogério Reis:
Editorial. J. Autom. Lang. Comb. 17(2-4): 59-60 (2012) - [j63]Martin Kutrib, Andreas Malcher:
The Size Impact of Little Iterative Array Resources. J. Cell. Autom. 7(5-6): 489-507 (2012) - [j62]Martin Kutrib, Andreas Malcher:
Reversible pushdown automata. J. Comput. Syst. Sci. 78(6): 1814-1827 (2012) - [j61]Markus Holzer, Martin Kutrib, Giovanni Pighizzini:
Preface. Theor. Comput. Sci. 449: 1 (2012) - [j60]Markus Holzer, Martin Kutrib, Katja Meckel:
Nondeterministic state complexity of star-free languages. Theor. Comput. Sci. 450: 68-80 (2012) - [c85]Martin Kutrib, Andreas Malcher:
Iterative Arrays: Little Resources Big Size Impact. ACRI 2012: 42-51 - [c84]Martin Kutrib, Friedrich Otto:
On CD-Systems of Stateless Deterministic Two-Phase RR(1)-Automata. Languages Alive 2012: 111-137 - [c83]Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
States and Heads Do Count for Unary Multi-head Finite Automata. Developments in Language Theory 2012: 214-225 - [c82]Suna Bensch, Markus Holzer, Martin Kutrib, Andreas Malcher:
Input-Driven Stack Automata. IFIP TCS 2012: 28-42 - [c81]Martin Kutrib, Andreas Malcher, Giovanni Pighizzini:
Oblivious Two-Way Finite Automata: Decidability and Complexity. LATIN 2012: 518-529 - [c80]Martin Kutrib, Matthias Wendlandt:
Bidirectional String Assembling Systems. NCMA 2012: 107-121 - [c79]Martin Kutrib, Andreas Malcher:
One-Way Reversible Multi-head Finite Automata. RC 2012: 14-28 - [c78]Martin Kutrib, Friedrich Otto:
On the Descriptional Complexity of the Window Size for Deterministic Restarting Automata. CIAA 2012: 253-264 - [c77]Martin Kutrib, Andreas Malcher:
Transductions Computed by One-Dimensional Cellular Automata. AUTOMATA & JAC 2012: 194-207 - [e5]Henning Bordihn, Martin Kutrib, Bianca Truthe:
Languages Alive - Essays Dedicated to Jürgen Dassow on the Occasion of His 65th Birthday. Lecture Notes in Computer Science 7300, Springer 2012, ISBN 978-3-642-31643-2 [contents] - [e4]Martin Kutrib, Nelma Moreira, Rogério Reis:
Descriptional Complexity of Formal Systems - 14th International Workshop, DCFS 2012, Braga, Portugal, July 23-25, 2012. Proceedings. Lecture Notes in Computer Science 7386, Springer 2012, ISBN 978-3-642-31622-7 [contents] - 2011
- [j59]Markus Holzer, Andreas Klein, Martin Kutrib, Oliver Ruepp:
Computational Complexity of NURIKABE. Fundam. Informaticae 110(1-4): 159-174 (2011) - [j58]Henning Bordihn, Rudolf Freund, Mika Hirvensalo, Markus Holzer, Martin Kutrib, Friedrich Otto:
Preface. Fundam. Informaticae 112(2-3) (2011) - [j57]Henning Bordihn, Markus Holzer, Martin Kutrib:
Decidability of operation problems for T0L languages and subclasses. Inf. Comput. 209(3): 344-352 (2011) - [j56]Markus Holzer, Martin Kutrib:
Descriptional and computational complexity of finite automata - A survey. Inf. Comput. 209(3): 456-470 (2011) - [j55]Markus Holzer, Martin Kutrib:
The Complexity of Regular(-like) Expressions. Int. J. Found. Comput. Sci. 22(7): 1533-1548 (2011) - [j54]Henning Bordihn, Martin Kutrib, Andreas Malcher:
Undecidability and Hierarchy Results for Parallel Communicating Finite Automata. Int. J. Found. Comput. Sci. 22(7): 1577-1592 (2011) - [j53]Henning Bordihn, Jürgen Dassow, Martin Kutrib, Bianca Truthe:
Selected Papers Dedicated to Friedrich Otto on the Occasion of his 60th Birthday - Editorial. J. Autom. Lang. Comb. 16(2-4): 71-74 (2011) - [j52]Henning Bordihn, Markus Holzer, Martin Kutrib:
Hairpin Finite Automata. J. Autom. Lang. Comb. 16(2-4): 91-107 (2011) - [j51]Markus Holzer, Martin Kutrib, Andreas Malcher:
Complexity of multi-head finite automata: Origins and directions. Theor. Comput. Sci. 412(1-2): 83-96 (2011) - [j50]Martin Kutrib, Andreas Malcher:
Cellular automata with limited inter-cell bandwidth. Theor. Comput. Sci. 412(30): 3917-3931 (2011) - [c76]Markus Holzer, Sebastian Jakobi, Martin Kutrib:
The Chop of Languages. AFL 2011: 197-210 - [c75]Martin Kutrib:
Nature-Based Problems in Cellular Automata. CiE 2011: 171-180 - [c74]Markus Holzer, Martin Kutrib, Ursula Leiter:
Nodes Connected by Path Languages. Developments in Language Theory 2011: 276-287 - [c73]Martin Kutrib, Matthias Wendlandt:
String Assembling Systems. NCMA 2011: 179-192 - [c72]Markus Holzer, Martin Kutrib:
Gaining Power by Input Operations: Finite Automata and Beyond. CIAA 2011: 16-29 - [c71]Markus Holzer, Martin Kutrib, Katja Meckel:
Nondeterministic State Complexity of Star-Free Languages. CIAA 2011: 178-189 - [e3]Markus Holzer, Martin Kutrib, Giovanni Pighizzini:
Descriptional Complexity of Formal Systems - 13th International Workshop, DCFS 2011, Gießen/Limburg, Germany, July 25-27, 2011. Proceedings. Lecture Notes in Computer Science 6808, Springer 2011, ISBN 978-3-642-22599-4 [contents] - 2010
- [j49]Martin Kutrib, Hartmut Messerschmidt, Friedrich Otto:
On stateless deterministic restarting automata. Acta Informatica 47(7-8): 391-412 (2010) - [j48]Martin Kutrib, Hartmut Messerschmidt, Friedrich Otto:
On Stateless Two-Pushdown Automata and Restarting Automata. Int. J. Found. Comput. Sci. 21(5): 781-798 (2010) - [j47]Hermann Gruber, Markus Holzer, Martin Kutrib:
On Measuring Non-recursive Trade-Offs. J. Autom. Lang. Comb. 15(1/2): 107-120 (2010) - [j46]Martin Kutrib, Andreas Malcher:
One-Way Cellular Automata, Bounded Languages, and Minimal Communication. J. Autom. Lang. Comb. 15(1/2): 135-153 (2010) - [j45]Martin Kutrib, Andreas Malcher:
Real-time reversible iterative arrays. Theor. Comput. Sci. 411(4-5): 812-822 (2010) - [j44]Martin Kutrib, Andreas Malcher:
Cellular automata with sparse communication. Theor. Comput. Sci. 411(38-39): 3516-3526 (2010) - [c70]Martin Kutrib, Jonas Lefèvre, Andreas Malcher:
The Size of One-Way Cellular Automata. Automata 2010: 71-90 - [c69]Markus Holzer, Martin Kutrib:
The Complexity of Regular(-Like) Expressions. Developments in Language Theory 2010: 16-30 - [c68]Henning Bordihn, Martin Kutrib, Andreas Malcher:
Undecidability and Hierarchy Results for Parallel Communicating Finite Automata. Developments in Language Theory 2010: 88-99 - [c67]Martin Kutrib, Andreas Malcher:
Measuring Communication in Cellular Automata. JAC 2010: 13-30 - [c66]Martin Kutrib, Andreas Malcher:
Transductions Computed by Iterative Arrays. JAC 2010: 156-167 - [c65]Martin Kutrib, Andreas Malcher:
Reversible Pushdown Automata. LATA 2010: 368-379 - [c64]Markus Holzer, Martin Kutrib:
Cellular Automata and the Quest for Nontrivial Artificial Self-Reproduction. Int. Conf. on Membrane Computing 2010: 19-36 - [c63]Markus Holzer, Martin Kutrib:
Descriptional Complexity of (Un)ambiguous Finite State Machines and Pushdown Automata. RP 2010: 1-23 - [c62]Martin Kutrib, Andreas Malcher:
Two-Party Watson-Crick Computations. CIAA 2010: 191-200 - [c61]Markus Holzer, Sebastian Jakobi, Martin Kutrib:
The Magic Number Problem for Subregular Language Families. DCFS 2010: 110-119 - [p2]Markus Holzer, Martin Kutrib:
Descriptional Complexity - An Introductory Survey. Scientific Applications of Language Methods 2010: 1-58 - [e2]Henning Bordihn, Rudolf Freund, Markus Holzer, Thomas Hinze, Martin Kutrib, Friedrich Otto:
Second Workshop on Non-Classical Models for Automata and Applications - NCMA 2010, Jena, Germany, August 23 - August 24, 2010. Proceedings. books@ocg.at 263, Austrian Computer Society 2010, ISBN 978-3-85403-263-2 [contents]
2000 – 2009
- 2009
- [j43]Hermann Gruber, Markus Holzer, Martin Kutrib:
More on the Size of Higman-Haines Sets: Effective Constructions. Fundam. Informaticae 91(1): 105-121 (2009) - [j42]Suna Bensch, Henning Bordihn, Markus Holzer, Martin Kutrib:
On input-revolving deterministic and nondeterministic finite automata. Inf. Comput. 207(11): 1140-1155 (2009) - [j41]Markus Holzer, Martin Kutrib:
Nondeterministic Finite Automata - Recent Results on the Descriptional and Computational Complexity. Int. J. Found. Comput. Sci. 20(4): 563-580 (2009) - [j40]Andreas Klein, Martin Kutrib:
Self-Assembling Finite Automata. J. Autom. Lang. Comb. 14(1): 75-92 (2009) - [j39]Martin Kutrib, Andreas Malcher:
Computations and Decidability of Iterative Arrays with Restricted Communication. Parallel Process. Lett. 19(2): 247-264 (2009) - [j38]Henning Bordihn, Markus Holzer, Martin Kutrib:
Determination of finite automata accepting subregular languages. Theor. Comput. Sci. 410(35): 3209-3222 (2009) - [j37]Martin Kutrib, Andreas Malcher, Larissa Werlein:
Regulated nondeterminism in pushdown automata. Theor. Comput. Sci. 410(37): 3447-3460 (2009) - [c60]Markus Holzer, Martin Kutrib:
Descriptional and Computational Complexity of Finite Automata. LATA 2009: 23-42 - [c59]Henning Bordihn, Markus Holzer, Martin Kutrib:
Undecidability of Operation Problems for T0L Languages and Subclasses. LATA 2009: 236-246 - [c58]Martin Kutrib, Hartmut Messerschmidt, Friedrich Otto:
On Stateless Deterministic Restarting Automata. SOFSEM 2009: 353-364 - [c57]Martin Kutrib, Andreas Malcher:
Cellular Automata with Sparse Communication. CIAA 2009: 34-43 - [c56]Rudolf Freund, Andreas Klein, Martin Kutrib:
On the Number of Membranes in Unary P Systems. DCFS 2009: 101-109 - [c55]Hermann Gruber, Markus Holzer, Martin Kutrib:
On Measuring Non-Recursive Trade-Offs. DCFS 2009: 141-150 - [c54]Martin Kutrib, Andreas Malcher:
Bounded Languages Meet Cellular Automata with Sparse Communication. DCFS 2009: 163-172 - [c53]Martin Kutrib, Andreas Malcher:
On One-way One-bit O (One)-message Cellular Automata. AUTOMATA 2009: 77-91 - [e1]Henning Bordihn, Rudolf Freund, Markus Holzer, Martin Kutrib, Friedrich Otto:
Workshop on Non-Classical Models for Automata and Applications - NCMA 2009, Wroclaw, Poland, August 31 - September 1, 2009. Proceedings. books@ocg.at 256, Austrian Computer Society 2009, ISBN 978-3-85403-256-4 [contents] - [r1]Martin Kutrib:
Cellular Automata and Language Theory. Encyclopedia of Complexity and Systems Science 2009: 800-823 - 2008
- [j36]Martin Kutrib, Andreas Malcher, Detlef Wotschke:
The Boolean closure of linear context-free languages. Acta Informatica 45(3): 177-191 (2008) - [j35]Martin Kutrib, Andreas Malcher:
Fast reversible language recognition using cellular automata. Inf. Comput. 206(9-10): 1142-1151 (2008) - [j34]Martin Kutrib, Jens Reimann:
Succinct description of regular languages by weak restarting automata. Inf. Comput. 206(9-10): 1152-1160 (2008) - [j33]Martin Kutrib, Jens Reimann:
Optimal Simulations of Weak Restarting Automata. Int. J. Found. Comput. Sci. 19(4): 795-811 (2008) - [j32]Martin Kutrib:
Efficient Pushdown Cellular Automata: Universality, Time and Space Hierarchies. J. Cell. Autom. 3(2): 93-114 (2008) - [c52]Martin Kutrib, Hartmut Messerschmidt, Friedrich Otto:
On Stateless Two-Pushdown Automata and Restarting Automata. AFL 2008: 257-268 - [c51]Martin Kutrib, Andreas Malcher:
Real-time reversible language recognition by cellular automata. Automata 2008: 208-221 - [c50]Henning Bordihn, Markus Holzer, Martin Kutrib:
State Complexity of NFA to DFA Conversion of Subregular Language Families. DCFS 2008: 85-96 - [c49]Henning Bordihn, Martin Kutrib, Andreas Malcher:
On the Computational Capacity of Parallel Communicating Finite Automata. Developments in Language Theory 2008: 146-157 - [c48]Suna Bensch, Henning Bordihn, Markus Holzer, Martin Kutrib:
Deterministic Input-Reversal and Input-Revolving Finite Automata. LATA 2008: 113-124 - [c47]Markus Holzer, Martin Kutrib:
Nondeterministic Finite Automata-Recent Results on the Descriptional and Computational Complexity. CIAA 2008: 1-16 - [c46]Markus Holzer, Martin Kutrib, Andreas Malcher:
Multi-Head Finite Automata: Characterizations, Concepts and Open Problems. CSP 2008: 93-107 - [p1]Martin Kutrib:
Cellular Automata - A Computational Point of View. New Developments in Formal Languages and Applications 2008: 183-227 - 2007
- [j31]Martin Kutrib, Andreas Malcher:
Finite turns and the regular closure of linear context-free languages. Discret. Appl. Math. 155(16): 2152-2164 (2007) - [j30]Andreas Klein, Martin Kutrib:
Cellular Devices and Unary Languages. Fundam. Informaticae 78(3): 343-368 (2007) - [j29]Henning Bordihn, Markus Holzer, Martin Kutrib:
Hybrid Extended Finite Automata. Int. J. Found. Comput. Sci. 18(4): 745-760 (2007) - [j28]Andreas Klein, Martin Kutrib:
Context-Free Grammars with Linked Nonterminals. Int. J. Found. Comput. Sci. 18(6): 1271-1282 (2007) - [j27]Martin Kutrib, Andreas Malcher:
When Church-Rosser Becomes Context Free. Int. J. Found. Comput. Sci. 18(6): 1293-1302 (2007) - [j26]Markus Holzer, Martin Kutrib, Jens Reimann:
Non-Recursive Trade-Offs for Deterministic Restarting Automata. J. Autom. Lang. Comb. 12(1-2): 195-213 (2007) - [j25]Martin Kutrib, Andreas Malcher:
Context-dependent nondeterminism for pushdown automata. Theor. Comput. Sci. 376(1-2): 101-111 (2007) - [j24]Hermann Gruber, Markus Holzer, Martin Kutrib:
The size of Higman-Haines sets. Theor. Comput. Sci. 387(2): 167-176 (2007) - [c45]Martin Kutrib, Jens Reimann:
Optimal Simulations of Weak Restarting Automata. DCFS 2007: 81-92 - [c44]Henning Bordihn, Markus Holzer, Martin Kutrib:
Hairpin Finite Automata. Developments in Language Theory 2007: 108-119 - [c43]Martin Kutrib, Andreas Malcher:
Real-Time Reversible Iterative Arrays. FCT 2007: 376-387 - [c42]Martin Kutrib, Andreas Malcher:
Fast Reversible Language Recognition Using Cellular Automata. LATA 2007: 331-342 - [c41]Martin Kutrib, Jens Reimann:
Succinct Description of Regular Languages by Weak Restarting Automata. LATA 2007: 343-354 - [c40]Hermann Gruber, Markus Holzer, Martin Kutrib:
More on the Size of Higman-Haines Sets: Effective Constructions. MCU 2007: 193-204 - [c39]Martin Kutrib, Andreas Malcher, Larissa Werlein:
Regulated Nondeterminism in Pushdown Automata. CIAA 2007: 85-96 - 2006
- [j23]Markus Holzer, Martin Kutrib:
Variable Complexity of Simple Programs. Fundam. Informaticae 74(4): 511-528 (2006) - [c38]Markus Holzer, Martin Kutrib:
The Size of Higman-Haines Sets. DCFS 2006: 177-187 - [c37]Martin Kutrib, Andreas Malcher:
Context-Dependent Nondeterminism for Pushdown Automata. Developments in Language Theory 2006: 133-144 - [c36]Martin Kutrib, Andreas Malcher:
Fast Cellular Automata with Restricted Inter-Cell Communication: Computational Capacity. IFIP TCS 2006: 151-164 - [c35]Martin Kutrib, Andreas Malcher:
Fast Iterative Arrays with Restricted Inter-cell Communication: Constructions and Decidability. MFCS 2006: 634-645 - [c34]Henning Bordihn, Markus Holzer, Martin Kutrib:
Hybrid Extended Finite Automata. CIAA 2006: 34-45 - 2005
- [j22]Henning Bordihn, Markus Holzer, Martin Kutrib:
Unsolvability levels of operation problems for subclasses of context-free languages. Int. J. Found. Comput. Sci. 16(3): 423-440 (2005) - [j21]Martin Kutrib:
The phenomenon of non-recursive trade-offs. Int. J. Found. Comput. Sci. 16(5): 957-973 (2005) - [j20]Markus Holzer, Martin Kutrib:
On the descriptional complexity of finite automata with modified acceptance conditions. Theor. Comput. Sci. 330(2): 267-285 (2005) - [j19]Martin Kutrib:
On the descriptional power of heads, counters, and pebbles. Theor. Comput. Sci. 330(2): 311-324 (2005) - [c33]Markus Holzer, Martin Kutrib, Jens Reimann:
Descriptional Complexity of Deterministic Restarting Automata. DCFS 2005: 158-169 - [c32]Henning Bordihn, Markus Holzer, Martin Kutrib:
Revolving-Input Finite Automata. Developments in Language Theory 2005: 168-179 - 2004
- [j18]Martin Kutrib, Maurice Margenstern, Hiroshi Umeo:
Foreword. IEICE Trans. Inf. Syst. 87-D(3): 647-649 (2004) - [j17]Björn Fay, Martin Kutrib:
The Fault-Tolerant Early Bird Problem. IEICE Trans. Inf. Syst. 87-D(3): 687-693 (2004) - [j16]Henning Bordihn, Markus Holzer, Martin Kutrib:
Economy of Description for Basic Constructions on Rational Transductions. J. Autom. Lang. Comb. 9(2/3): 175-188 (2004) - [c31]Martin Kutrib:
The Phenomenon of Non-Recursive Trade-Offs. DCFS 2004: 83-97 - [c30]Henning Bordihn, Markus Holzer, Martin Kutrib:
Input Reversals and Iterated Pushdown Automata: A New Characterization of Khabbaz Geometric Hierarchy of Languages. Developments in Language Theory 2004: 102-113 - [c29]Martin Kutrib, Andreas Malcher, Detlef Wotschke:
The Boolean Closure of Linear Context-Free Languages. Developments in Language Theory 2004: 284-295 - [c28]Markus Holzer, Martin Kutrib:
Register Complexity of LOOP-, WHILE-, and GOTO-Programs. MCU 2004: 233-244 - [c27]Henning Bordihn, Markus Holzer, Martin Kutrib:
Some Non-semi-decidability Problems for Linear and Deterministic Context-Free Languages. CIAA 2004: 68-79 - 2003
- [j15]Martin Kutrib, Jan-Thomas Löwe:
Space- and Time-Bounded Nondeterminism for Cellular Automata. Fundam. Informaticae 58(2003): 273-293 (2003) - [j14]Martin Kutrib, Maurice Margenstern, Hiroshi Umeo:
Foreword. Fundam. Informaticae 58(2003) (2003) - [j13]Markus Holzer, Martin Kutrib:
Nondeterministic Descriptional Complexity Of Regular Languages. Int. J. Found. Comput. Sci. 14(6): 1087-1102 (2003) - [j12]Andreas Klein, Martin Kutrib:
Fast one-way cellular automata. Theor. Comput. Sci. 295: 233-250 (2003) - [c26]Martin Kutrib:
On the Descriptional Power of Heads, Counters, and Pebbles. DCFS 2003: 138-149 - [c25]Markus Holzer, Martin Kutrib:
Flip-Pushdown Automata: Nondeterminism Is Better than Determinism. Developments in Language Theory 2003: 361-372 - [c24]Martin Kutrib:
Dimension- and Time-Hierarchies for Small Time Bounds. FCT 2003: 321-332 - [c23]Markus Holzer, Martin Kutrib:
Flip-Pushdown Automata: k+1 Pushdown Reversals Are Better than k. ICALP 2003: 490-501 - 2002
- [j11]Martin Kutrib, Jan-Thomas Löwe:
Massively parallel fault tolerant computations on syntactical patterns. Future Gener. Comput. Syst. 18(7): 905-919 (2002) - [j10]Thomas Buchholz, Andreas Klein, Martin Kutrib:
On Interacting Automata with Limited Nondeterminism. Fundam. Informaticae 52(1-3): 15-38 (2002) - [j9]Martin Kutrib:
Refining Nondeterminism Below Linear Time. J. Autom. Lang. Comb. 7(4): 533-547 (2002) - [j8]Andreas Klein, Martin Kutrib:
Deterministic Turing machines in the range between real-time and linear-time. Theor. Comput. Sci. 289(1): 253-275 (2002) - [c22]Andreas Klein, Martin Kutrib:
Self-Assembling Finite Automata. COCOON 2002: 310-319 - [c21]Henning Bordihn, Markus Holzer, Martin Kutrib:
Economy of Descriptions for Basic Constructions on Rational Transductions. DCFS 2002: 55-69 - [c20]Markus Holzer, Martin Kutrib:
Unary Language Operations and Their Nondeterministic State Complexity. Developments in Language Theory 2002: 162-172 - [c19]Martin Kutrib, Jan-Thomas Löwe:
String Transformation for n -Dimensional Image Compression. SOFSEM 2002: 208-217 - [c18]Markus Holzer, Martin Kutrib:
State Complexity of Basic Operations on Nondeterministic Finite Automata. CIAA 2002: 148-157 - 2001
- [c17]Martin Kutrib:
Automata arrays and context-free languages. Where Mathematics, Computer Science, Linguistics and Biology Meet 2001: 139-148 - [c16]Martin Kutrib:
Refining Nondeterminism below Linear-Time. DCFS 2001: 103-114 - [c15]Martin Kutrib:
Efficient Universal Pushdown Cellular Automata and Their Application to Complexity. MCU 2001: 252-263 - [c14]Andreas Klein, Martin Kutrib:
A Time Hierarchy for Bounded One-Way Cellular Automata. MFCS 2001: 439-450 - [c13]Markus Holzer, Martin Kutrib:
Improving Raster Image Run-Length Encoding Using Data Order. CIAA 2001: 161-176 - 2000
- [c12]Martin Kutrib, Jan-Thomas Löwe:
Fault Tolerant Parallel Pattern Recognition. ACRI 2000: 72-80 - [c11]Thomas Buchholz, Andreas Klein, Martin Kutrib:
Iterative Arrays With Limited Nondeterministic Communication Cell. Words, Languages & Combinatorics 2000: 73-87 - [c10]Thomas Buchholz, Andreas Klein, Martin Kutrib:
Real-Time Language Recognition by Alternating Cellular Automata. IFIP TCS 2000: 213-225 - [c9]Thomas Buchholz, Andreas Klein, Martin Kutrib:
Iterative Arrays with Small Time Bounds. MFCS 2000: 243-252 - [c8]Martin Kutrib, Jan-Thomas Löwe:
Massively Parallel Pattern Recognition with Link Failures. SOFSEM 2000: 392-401 - [i1]Andreas Klein, Martin Kutrib:
Deterministic Turing Machines in the Range between Real-Time and Linear-Time. Electron. Colloquium Comput. Complex. TR00 (2000)
1990 – 1999
- 1999
- [j7]Thomas Buchholz, Andreas Klein, Martin Kutrib:
On time reduction and simulation in cellular spaces. Int. J. Comput. Math. 71(4): 459-474 (1999) - [j6]Martin Kutrib:
Pushdown Cellular Automata. Theor. Comput. Sci. 215(1-2): 239-261 (1999) - [c7]Thomas Buchholz, Andreas Klein, Martin Kutrib:
On tally languages and generalized interacting automata. Developments in Language Theory 1999: 316-325 - [c6]Thomas Buchholz, Andreas Klein, Martin Kutrib:
Iterative Arrays with a Wee Bit Alternation. FCT 1999: 173-184 - 1998
- [j5]Thomas Buchholz, Martin Kutrib:
On Time Computability of Functions in One-Way Cellular Automata. Acta Informatica 35(4): 329-352 (1998) - [c5]Thomas Buchholz, Andreas Klein, Martin Kutrib:
One Guess One-Way Cellular Arrays. MFCS 1998: 807-815 - 1997
- [j4]Martin Kutrib, Roland Vollmar, Thomas Worsch:
Introduction to the Special Issue on Cellular Automata. Parallel Comput. 23(11): 1567-1576 (1997) - [j3]Thomas Buchholz, Martin Kutrib:
Some Relations Between Massively Parallel Arrays. Parallel Comput. 23(11): 1643-1662 (1997) - [c4]Thomas Buchholz, Martin Kutrib:
On the power of one-way bounded cellular time computers. Developments in Language Theory 1997: 365-375 - 1996
- [c3]Alf-Christian Achilles, Martin Kutrib, Thomas Worsch:
On Relations between Arrays of Processing Elements of Different Dimensionality. Parcella 1996: 13-20 - 1995
- [j2]Martin Kutrib, Roland Vollmar:
The Firing Squad Synchronization Problem in Defective Cellular Automata. IEICE Trans. Inf. Syst. 78-D(7): 895-900 (1995) - [c2]Martin Kutrib, Jörg Richstein:
Real-Time One-Way Pushdown Cellular Automata Languages. Developments in Language Theory 1995: 420-429 - 1994
- [c1]Martin Kutrib, Thomas Worsch:
Investigation of Different Input Modes for Cellular Automata. Parcella 1994: 141-150 - 1993
- [b1]Martin Kutrib:
Kellererweiterte Polyautomaten. University of Giessen, Gießen, Germany, 1993, pp. 1-151 - 1991
- [j1]Martin Kutrib, Roland Vollmar:
Minimal Time Synchronization in Restricted Defective Cellular Automata. J. Inf. Process. Cybern. 27(3): 179-196 (1991)
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-11-25 23:39 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint