Reversible Two-Party ComputationsM. Kutrib, A. MalcherInternational Journal of Foundations of Computer Science, to appear
State Complexity of Partial Word Finite AutomataM. Kutrib, M. WendlandtInternational Journal of Foundations of Computer Science, to appear
On Properties of Languages Accepted by Deterministic Pushdown Automata with Translucent Input LettersM. Kutrib, A. Malcher, C. Mereghetti, B. Palano, P. Raucci, M. WendlandtIn S. Z. Fazekas (ed.): Implementation and Application of Automata (CIAA 2024), LNCS 15015, Springer 2024, 208-220
Cellular Automata: From Black-and-White to High Gloss ColorM. Kutrib, A. MalcherIn J. D. Day, F. Manea (eds.): Developments in Language Theory (DLT 2024), LNCS 14791, Springer 2024, 22-36
Deterministic Pushdown Automata with Translucent Input LettersM. Kutrib, A. Malcher, C. Mereghetti, B. Palano, P. Raucci, M. WendlandtIn J. D. Day, F. Manea (eds.): Developments in Language Theory (DLT 2024), LNCS 14791, Springer 2024, 203-217
Complexity of Unary Exclusive Nondeterministic Finite AutomataM. Kutrib, A. Malcher, M. WendlandtIn F. Manea, G. Pighizzini (eds.): International Workshop on Non-Classical Models of Automata and Applications (NCMA 2024), EPTCS 407, 2024, 136-149
Cellular Automata: Communication MattersM. Kutrib, A. MalcherIn L. Levy Patey, E. Pimentel, L. Galeotti, F. Manea (eds.): Computability in Europe (CIE 2024), LNCS 14773, Springer 2024, 32-43
Variants of String Assembling SystemsM. Kutrib, M. WendlandtNatural Computing 23 (2024) 131-156
On the Power of Pushing or Stationary Moves for Input-Driven Pushdown AutomataM. Kutrib, A. Malcher, M. WendlandtTheoretical Computer Science 996 (2024) Art. 114503
Reversible Computations of One-Way Counter AutomataM. Kutrib, A. MalcherRAIRO - Theoretical Informatics and Applications 58 (2024) Art. 5
25 Editions of DCFS: Origins and DirectionsJ. Dassow, M. Kutrib, G. PighizziniEATCS Bulletin 141 (2023) pp. 34
Iterated Uniform Finite-State Transducers on Unary LanguagesM. Kutrib, A. Malcher, C. Mereghetti, B. PalanoTheoretical Computer Science 969 (2023) Art. 114049
Sweeping Input-Driven Pushdown AutomataM. KutribIn B. Nagy (ed.): Implementation and Application of Automata (CIAA 2023), LNCS 14151, Springer 2023, 194-205
Iterated Uniform Finite-State Transducers: Descriptional Complexity of Nondeterminism and Two-Way MotionM. Kutrib, A. Malcher, C. Mereghetti, B. PalanoJournal of Automata, Languages and Combinatorics 28 (2023) 59-88
Deterministic Real-Time Tree-Walking-Storage AutomataM. Kutrib, U. MeyerIn B. Nagy, R. Freund (eds.): Non-Classical Models of Automata and Applications (NCMA 2023), EPTCS 388, 2023, 48-62
Reversible Two-Party ComputationsM. Kutrib, A. MalcherIn Z. Gazdag, S. Iván, G. Kovásznai (eds.): Automata and Formal Languages (AFL 2023), EPTCS 386, 2023, 142-154
Complexity of Exclusive Nondeterministic Finite AutomataM. Kutrib, A. Malcher, M. WendlandtIn H. Bordihn, N. Tran, Gy. Vaszil (eds.): Descriptional Complexity of Formal Systems (DCFS 2023), LNCS 13918, Springer 2023, 121-133
Syntax Checking Either WayM. Kutrib, U. MeyerTheoretical Computer Science 966-967 (2023) Art. 114000
State Complexity of Finite Partial LanguagesM. Kutrib, M. WendlandtTheoretical Computer Science 966-967 (2023) Art. 114001
Tree-Walking-Storage AutomataM. Kutrib, U. MeyerIn F. Drewes, M. Volkov (eds.): Developments in Language Theory (DLT 2023), LNCS 13911, Springer 2023, 182-194
Reversible Top-Down Syntax AnalysisM. Kutrib, U. MeyerInternational Journal of Foundations of Computer Science 34 (2023) 225-251
Reversible Computations of One-Way Counter AutomataM. Kutrib, A. MalcherIn H. Bordihn, G. Horváth, G. Vaszil (eds.): Non-Classical Models of Automata and Applications (NCMA 2022), EPTCS 367, 2022, 126-142
State Complexity of Finite Partial LanguagesM. Kutrib, M. WendlandtIn Y.-S. Han, G. Vaszil (eds.): Descriptional Complexity of Formal Systems (DCFS 2022), LNCS 13439, Springer 2022, 170-183
One-Dimensional Pattern Generation by Cellular AutomataM. Kutrib, A. MalcherNatural Computing 21 (2022) 361-375
Reversible Shrinking Two-Pushdown AutomataH.B. Axelsen, M. Kutrib, A. MalcherJournal of Automata, Languages and Combinatorics 27 (2022) 47-77
Computational and Descriptional Power of Nondeterministic Iterated Uniform Finite-State TransducersM. Kutrib, A. Malcher, C. Mereghetti, B. PalanoFundamenta Informaticae 185 (2022) 337-356
Optimizing Reversible ProgramsN. Deworetzki, M. Kutrib, U. Meyer, P. RitzkeIn C. A. Mezzina, K. Podlaski (eds.): Reversible Computation (RC 2022), LNCS 13354, Springer 2022, 224-238
On the Power of Pushing or Stationary Moves for Input-Driven Pushdown AutomataM. Kutrib, A. Malcher, M. WendlandtIn P. Caron, L. Mignot (eds.): Implementation and Application of Automata (CIAA 2022), LNCS 13266, Springer 2022, 140-151
Input-Driven Double-Head Pushdown AutomataM. Holzer, M. Kutrib, A. Malcher, M. WendlandtInternational Journal of Foundations of Computer Science 33 (2022) 285-211
Iterative Arrays with Self-Verifying Communication CellM. KutribNatural Computing 21 (2022) 39-51
Iterative Arrays with Finite Inter-Cell CommunicationM. Kutrib, A. MalcherNatural Computing 21 (2022) 3-15
Descriptional Complexity of Iterated Uniform Finite-State TransducersM. Kutrib, A. Malcher, C. Mereghetti, B. PalanoInformation and Computation 284 (2022) Art. 104691
Finite Automata with Undirected State GraphsM. Kutrib, A. Malcher, C. SchneiderActa Informatica 59 (2022) 163-181
Reversible Pushdown TransducersB. Guillon, M. Kutrib, A. Malcher, L. PrigionieroInformation and Computation 281 (2021) Art. 104813
State Complexity of Partial Word Finite AutomataM. Kutrib, M. WendlandtIn Y.-S. Han, S.-K. Ko (eds.): Descriptional Complexity of Formal Systems (DCFS 2021), LNCS 13037, Springer 2021, 113-124
String Assembling Systems: Comparison to Sticker Systems and DecidabilityM. Kutrib, M. WendlandtIn I. Kostitsyna, P. Orponen (eds.): Unconventional Computation and Natural Computation (UCNC 2021), LNCS 12984, Springer 2021, 101-115
Reversible Top-Down Syntax AnalysisM. Kutrib, U. MeyerIn N. Moreira, R. Reis (eds.): Developments in Language Theory (DLT 2021), LNCS 12811, Springer 2021, 255-266
Hot Current Topics of Descriptional ComplexityM. Kutrib, N. Moreira, G. Pighizzini, R. ReisIn M. Goedicke, E. Neuhold, K. Rannenberg (eds.): IFIP's Exciting First 60+ Years, IFIP Advances in Information and Communication Technology 600, Springer 2021, 3-28
Digging Input-Driven Pushdown AutomataM. Kutrib, A. MalcherRAIRO - Theoretical Informatics and Applications 55 (2021) Art. 6
Boolean Kernels of Context-Free LanguagesM. Kutrib, L. PrigionieroIn S. Maneth (ed.): Implementation and Application of Automata (CIAA 2021), LNCS 12803, Springer 2021, 152-164
Compiling Janus to RSSAM. Kutrib, U. Meyer, N. Deworetzki, M. SchusterIn S. Yamashita, T. Yokoyama (eds.): Reversible Computation (RC 2021), LNCS 12805, Springer 2021, 64-78
String Generation by Cellular AutomataM. Kutrib, A. MalcherComplex Systems 30 (2021) 111-132
Self-Verifying Pushdown and Queue AutomataH. Fernau, M. Kutrib, M. WendlandtFundamenta Informaticae 180 (2021) 1-28
Two-Sided Strictly Locally Testable LanguagesM. Holzer, M. Kutrib, F. OttoFundamenta Informaticae 180 (2021) 29-51
Input-Driven Multi-Counter AutomataM. Kutrib, A. Malcher, M. WendlandtTheoretical Computer Science 870 (2021) 121-136
Boosting Reversible Pushdown and Queue Machines by PreprocessingH.B. Axelsen, M. Kutrib, A. Malcher, M. WendlandtInternational Journal of Foundations of Computer Science 31 (2020) 1021-1049
Iterated Uniform Finite-State Transducers on Unary LanguagesM. Kutrib, A. Malcher, C. Mereghetti, B. PalanoIn T. Bures, R. Dondi, J. Gamper, G. Guerrini T. Jurdzinski, C. Pahl, F. Sikora, P. W. H. Wong (eds.): Current Trends in Theory and Practice of Computer Science (SOFSEM 2021), LNCS 12607, Springer 2021, 218-232
One-Dimensional Pattern Generation by Cellular AutomataM. Kutrib, A. MalcherIn T. M. Gwizdalla, L. Manzoni, G. Ch. Sirakoulis, S. Bandini, K. Podlaski (eds.): Cellular Automata for Research and Industry (ACRI 2020), LNCS 12599, Springer 2020, 46-55
On Two-Sided Locally Testable LanguagesM. Kutrib, F. OttoJournal of Automata, Languages and Combinatorics 25 (2020) 171-199
Automata that May Change Their MindM. Holzer, M. KutribJournal of Automata, Languages and Combinatorics 25 (2020) 115-140
Self-Verifying Cellular AutomataM. Kutrib, Th. WorschJournal of Cellular Automata 15 (2020) 223-242
Iterated Uniform Finite-State Transducers: Descriptional Complexity of Nondeterminism and Two-Way MotionM. Kutrib, A. Malcher, C. Mereghetti, B. PalanoIn G. Jirásková, G. Pighizzini (eds.): Descriptional Complexity of Formal Systems (DCFS 2020), LNCS 12442, Springer 2020, 117-129
Cellular String GeneratorsM. Kutrib, A. MalcherIn H. Zenil (ed.): Cellular Automata and Discrete Complex Systems (AUTOMATA 2020), LNCS 12286, Springer 2020, 59-70
Deterministic and Nondeterministic Iterated Uniform Finite-State Transducers: Computational and Descriptional PowerM. Kutrib, A. Malcher, C. Mereghetti, B. PalanoIn M. Anselmo, G. Della Vedova, F. Manea, A. Pauly (eds.): Computability in Europe (CIE 2020), LNCS 12098, Springer 2020, 87-99
Kernels of Sub-Classes of Context-Free LanguagesM. KutribIn A. Chatzigeorgiou, R. Dondi, H. Herodotou, Ch. A. Kapoutsis, Y. Manolopoulos, G. A. Papadopoulos, F. Sikora (eds.): Current Trends in Theory and Practice of Computer Science (SOFSEM 2020), LNCS 12011, Springer 2020, 136-147
One-Time Nondeterministic ComputationsM. Holzer, M. KutribInternational Journal of Foundations of Computer Science 30 (2019) 1069-1089
Transducing Reversibly with Finite State MachinesM. Kutrib, A. Malcher, M. WendlandtTheoretical Computer Science 787 (2019) 111-126
Input-Driven Multi-Counter AutomataM. Kutrib, A. Malcher, M. WendlandtIn M. Hospodár, G. Jirásková (eds.): Implementation and Application of Automata (CIAA 2019), LNCS 11601, Springer 2019, 197-208
Descriptional Complexity of Iterated Uniform Finite State TransducersM. Kutrib, A. Malcher, C. Mereghetti, B. PalanoIn M. Hospodár, G. Jirásková, S. Konstantinidis (eds.): Descriptional Complexity of Formal Systems (DCFS 2019), LNCS 11612, Springer 2019, 223-234
Non-Recursive Trade-Offs Are “Almost Everywhere”M. Holzer, M. KutribIn F. Manea, B. Martin, D. Paulusma, G. Primiero (eds.): Computability in Europe (CIE 2019), LNCS 11558, Springer 2019, 25-36
Digging Input-Driven Pushdown AutomataM. Kutrib, A. MalcherIn R. Freund, M. Holzer, J.M. Sempere (eds.): Non-Classical Models of Automata and Applications (NCMA 2019), books@ocg.at, Volume 336, Austrian Computer Society 2019, 109-124
Iterative Arrays with Finite Inter-Cell CommunicationM. Kutrib, A. MalcherIn A. Castillo-Ramirez, Pedro P.B. de Oliveira (eds.): Cellular Automata and Discrete Complex Systems (AUTOMATA 2019), LNCS 11525, Springer 2019, 35-47
Iterative Arrays with Self-Verifying Communication CellM. Kutrib, Th. WorschIn A. Castillo-Ramirez, Pedro P.B. de Oliveira (eds.): Cellular Automata and Discrete Complex Systems (AUTOMATA 2019), LNCS 11525, Springer 2019, 77-90
Operational State Complexity and Decidability of Jumping Finite AutomataS. Beier, M. Holzer, M. KutribInternational Journal of Foundations of Computer Science 30 (2019) 5-27
Diving Into the QueueS. Beier, M. Kutrib, A. Malcher, M. WendlandtRAIRO - Theoretical Informatics and Applications 52 (2018) 89-110
Expressive Capacity of Subregular ExpressionsM. Kutrib, M. WendlandtRAIRO - Theoretical Informatics and Applications 52 (2018) 201-218
Multi-Stranded String Assembling SystemsM. Kutrib, M. WendlandtIn B. Catania, R. Královič, J.R. Nawrocki, G. Pighizzini (eds.): Current Trends in Theory and Practice of Computer Science (SOFSEM 2019), LNCS 11376, Springer 2019, 285-297
Self-Verifying Cellular AutomataM. Kutrib, Th. WorschIn G. Mauri, S. El Yacoubi, A. Dennunzio, K. Nishinari, L. Manzoni (eds.): Cellular Automata for Research and Industry (ACRI 2018), LNCS 11115, Springer 2018, 340-351
Reversible Pushdown TransducersB. Guillon, M. Kutrib, A. Malcher, L. PrigionieroIn M. Hoshi, S. Seki (eds.): Developments in Language Theory (DLT 2018), LNCS 11088, Springer 2018, 354-365
Revisiting the Cutting of the Firing Squad SynchronizationA. Dimitriadis, M. Kutrib, G.Ch. SirakoulisNatural Computing 17 (2018) 455-465
Automata that May Change Their MindM. Holzer, M. KutribIn R. Freund, M. Hospodár, G. Jirásková (eds.): Non-Classical Models of Automata and Applications (NCMA 2018), books@ocg.at, Volume 332, Austrian Computer Society 2018, 83-98 Two-Sided Locally Testable LanguagesM. Kutrib, F. OttoIn R. Freund, M. Hospodár, G. Jirásková (eds.): Non-Classical Models of Automata and Applications (NCMA 2018), books@ocg.at, Volume 332, Austrian Computer Society 2018, 133-148
Boosting Pushdown and Queue Machines by PreprocessingM. Kutrib, A. Malcher, M. WendlandtIn C. Câmpeanu (ed.): Implementation and Application of Automata (CIAA 2018), LNCS 10977, Springer 2018, 28-40
Parametrizing String Assembling SystemsM. Kutrib, M. WendlandtIn C. Câmpeanu (ed.): Implementation and Application of Automata (CIAA 2018), LNCS 10977, Springer 2018, 236-247
Finite Automata with Undirected State GraphsM. Kutrib, A. Malcher, C. SchneiderIn S. Konstantinidis, G. Pighizzini (eds.): Descriptional Complexity of Formal Systems (DCFS 2018), LNCS 10952, Springer 2018, 212-223
Queue Automata: Foundations and DevelopmentsM. Kutrib, A. Malcher, M. WendlandtIn A. Adamatzky (ed.): Reversibility and Universality. Emergence, Complexity and Computation, vol 30. Springer 2018, 385-431
Cellular Automata: Descriptional Complexity and DecidabilityM. Kutrib, A. MalcherIn A. Adamatzky (ed.): Reversibility and Universality. Emergence, Complexity and Computation, vol 30. Springer 2018, 129-168
Descriptional Complexity of Limited AutomataM. Kutrib, G. Pighizzini, M. WendlandtInformation and Computation 259 (2018) 259-276
Minimal Reversible Deterministic Finite AutomataM. Holzer, S. Jakobi, M. KutribInternational Journal of Foundations of Computer Science 29 (2018) 251-270
Deterministic Stack TransducersS. Bensch, J. Björklund, M. KutribInternational Journal of Foundations of Computer Science 28 (2017) 583-601
The Degree of Irreversibility in Deterministic Finite AutomataH.B. Axelsen, M. Holzer, M. KutribInternational Journal of Foundations of Computer Science 28 (2017) 503-522
Input-Driven Double-Head Pushdown AutomataM. Holzer, M. Kutrib, A. Malcher, M. WendlandtIn E. Csuhaj-Varjú, P. Dömösi, G. Vaszil (eds.): Automata and Formal Languages (AFL 2017), EPTCS 252 (2017) 128-142
On the Descriptional Complexity of Operations on Semilinear SetsS. Beier, M. Holzer, M. KutribIn E. Csuhaj-Varjú, P. Dömösi, G. Vaszil (eds.): Automata and Formal Languages (AFL 2017), EPTCS 252 (2017) 41-55
Shrinking One-Way Cellular AutomataM. Kutrib, A. Malcher, M. WendlandtNatural Computing 16 (2017) 383-396
Descriptional Complexity of Bounded Regular LanguagesA. Herrmann, M. Kutrib, A. Malcher, M. WendlandtJournal of Automata, Languages and Combinatorics 22 (2017) 93-121
Tinput-Driven Pushdown, Counter, and Stack AutomataM. Kutrib, A. Malcher, M. WendlandtFundamenta Informaticae 155 (2017) 59-88
Reversible Limited AutomataM. Kutrib, M. WendlandtFundamenta Informaticae 155 (2017) 31-58
Self-Verifying Pushdown AutomataH. Fernau, M. Kutrib, M. WendlandtIn R. Freund, F. Mráz, D. Průša (eds.): Non-Classical Models of Automata and Applications (NCMA 2017), books@ocg.at, Volume 329, Austrian Computer Society 2017, 103-117
Two-Sided Strictly Locally Testable LanguagesF. Otto, M. Holzer, M. KutribIn R. Freund, F. Mráz, D. Průša (eds.): Non-Classical Models of Automata and Applications (NCMA 2017), books@ocg.at, Volume 329, Austrian Computer Society 2017, 135-150
Operational State Complexity and Decidability of Jumping Finite AutomataS. Beier, M. Holzer, M. KutribIn É. Charlier, J. Leroy, M. Rigo (eds.): Developments in Language Theory (DLT 2017), LNCS 10396, Springer 2017, 96-108
On Structure and Complexity of Some Subregular Language FamiliesM. Holzer, M. KutribIn S. Konstantinidis, N. Moreira, R. Reis, J. Shallit (eds.): The Role of Theory in Computer Science, Chapter 3, World Scientific 2017, 59-82
Reversible Nondeterministic Finite AutomataM. Holzer, M. KutribIn I. Phillips, H. Rahaman (eds.): Reversible Computation (RC 2017), LNCS 10301, Springer 2017, 35-51
Transducing Reversibly with Finite State MachinesM. Kutrib, A. Malcher, M. WendlandtIn A. Carayol, C. Nicaud (eds.): Implementation and Application of Automata (CIAA 2017), LNCS 10329, Springer 2017, 151-162
One-Time Nondeterministic ComputationsM. Holzer, M. KutribIn G. Pighizzini, C. Câmpeanu (eds.): Descriptional Complexity of Formal Systems (DCFS 2017), LNCS 10316, Springer 2017, 177-188
Fast One-Way Cellular Automata with Reversible Mealy CellsM. Kutrib, A. Malcher, M. WendlandtIn A. Dennunzio, E. Formenti, L. Manzoni, A. E. Porreca (eds.): Cellular Automata and Discrete Complex Systems (AUTOMATA 2017), LNCS 10248, Springer 2017, 139-150
The Chop of LanguagesM. Holzer, S. Jakobi, M. KutribTheoretical Computer Science 682 (2017) 122-137
One-Way Reversible Multi-Head Finite AutomataM. Kutrib, A. MalcherTheoretical Computer Science 682 (2017) 149-164
Concatenation-Free LanguagesM. Kutrib, M. WendlandtTheoretical Computer Science 679 (2017) 83-94
Reversible Queue AutomataM. Kutrib, A. Malcher, M. WendlandtFundamenta Informaticae 148 (2016) 341-368
Iterative Arrays with Set StorageM. Kutrib, A. MalcherJournal of Cellular Automata 12 (2017) 7-26
When Input-Driven Pushdown Automata Meet ReversiblityM. Kutrib, A. Malcher, M. WendlandtRAIRO - Theoretical Informatics and Applications 50 (2016) 313-330
Diving Into the QueueS. Beier, M. Kutrib, A. Malcher, M. WendlandtIn H. Bordihn, R. Freund, B. Nagy, G. Vaszil (eds.): Non-Classical Models of Automata and Applications (NCMA 2016), books@ocg.at, Volume 321, Austrian Computer Society 2016, 89-104
Expressive Capacity of Subregular ExpressionsM. Kutrib, M. WendlandtIn H. Bordihn, R. Freund, B. Nagy, G. Vaszil (eds.): Non-Classical Models of Automata and Applications (NCMA 2016), books@ocg.at, Volume 321, Austrian Computer Society 2016, 227-242
Cutting the Firing Squad SynchronizationA. Dimitriadis, M. Kutrib, G.Ch. SirakoulisIn S. El Yacoubi, J. Wąs, S. Bandini (eds.): Cellular Automata for Research and Industry (ACRI 2016), LNCS 9863, Springer 2016, 123-133
Deterministic Stack TransducersS. Bensch, J. Björklund, M. KutribIn Y. S. Han, K. Salomaa (eds.): Implementation and Application of Automata (CIAA 2016), LNCS 9705, Springer 2016, 27-38
The Degree of Irreversibility in Deterministic Finite AutomataH.B. Axelsen, M. Holzer, M. KutribIn Y. S. Han, K. Salomaa (eds.): Implementation and Application of Automata (CIAA 2016), LNCS 9705, Springer 2016, 15-26
Boosting Reversible Pushdown Machines by PreprocessingH.B. Axelsen, M. Kutrib, A. Malcher, M. WendlandtIn S. Devitt, I. Lanese (eds.): Reversible Computation (RC 2016), LNCS 9720, Springer 2016, 89-104
Descriptional Complexity of Bounded Regular LanguagesA. Herrmann, M. Kutrib, A. Malcher, M. WendlandtIn C. Câmpeanu, F. Manea, J. Shallit (eds.): Descriptional Complexity of Formal Systems (DCFS 2016), LNCS 9777, Springer 2016, 138-152
Reversible Shrinking Two-Pushdown AutomataH.B. Axelsen, M. Holzer, M. Kutrib, A. MalcherIn A. H. Dediu, J. Janousek, C. Martín-Vide, B. Truthe (eds.): Language and Automata Theory and Applications (LATA 2016), LNCS 9618, Springer 2016, 579-591
Input-Driven Queue Automata with Internal TransductionsM. Kutrib, A. Malcher, M. WendlandtIn A. H. Dediu, J. Janousek, C. Martín-Vide, B. Truthe (eds.): Language and Automata Theory and Applications (LATA 2016), LNCS 9618, Springer 2016, 156-167
Set AutomataM. Kutrib, A. Malcher, M. WendlandtInternational Journal of Foundations of Computer Science 27 (2016) 187-214
Returning Parallel Communicating Finite Automata with Communication Bounds: Hierarchies, Decidabilities, and UndecidabilitiesH. Bordihn M. Kutrib, A. MalcherInternational Journal of Foundations of Computer Science 26 (2015) 1101-1126
Tinput-Driven Pushdown AutomataM. Kutrib, A. Malcher, M. WendlandtIn J. Durand-Lose, B. Nagy (eds.): Machines, Computations and Universality (MCU 2015), LNCS 9288, Springer 2015, 94-112
Reversible Limited AutomataM. Kutrib, M. WendlandtIn J. Durand-Lose, B. Nagy (eds.): Machines, Computations and Universality (MCU 2015), LNCS 9288, Springer 2015, 113-128
When Input-Driven Pushdown Automata Meet ReversibilityM. Kutrib, A. Malcher, M. WendlandtIn R. Freund, M. Holzer, N. Moreira, R. Reis (eds.): Non-Classical Models for Automata and Applications (NCMA 2015), books@ocg.at, Volume 318, Austrian Computer Society 2015, 141-157
Reversible and Irreversible Computations of Deterministic Finite-State DevicesM. KutribIn G. F. Italiano, G. Pighizzini, D. T. Sanella (ed.): Mathematical Foundations of Computer Science (MFCS 2015), LNCS 9234, Springer 2015, 38-52
Expressive Capacity of Concatenation FreenessM. Kutrib, M. WendlandtIn F. Drewes (ed.): Implementation and Application of Automata (CIAA 2015), LNCS 9223, Springer 2015, 199-210
Minimal Reversible Deterministic Finite AutomataM. Holzer, S. Jakobi, M. KutribIn I. Potapov (ed.): Developments in Language Theory (DLT 2015), LNCS 9168, Springer 2015, 276-287
A Hierarchy of Fast Reversible Turing MachinesH.B. Axelsen, S. Jakobi, M. Kutrib, A. MalcherIn J. Krivine, J.-B. Stefani (eds.): Reversible Computation (RC 2015), LNCS 9138, Springer 2015, 29-44
On Simulation Cost of Unary Limited AutomataM. Kutrib, M. WendlandtIn J. Shallit, A. Okhotin (eds.): Descriptional Complexity of Formal Systems (DCFS 2015), LNCS 9118, Springer 2015, 153-164
Shrinking One-Way Cellular AutomataM. Kutrib, A. Malcher, M. WendlandtIn J. Kari (ed.): Cellular Automata and Discrete Complex Systems (AUTOMATA 2015), LNCS 9099, Springer 2015, 141-154
Input-Driven Queue Automata: Finite Turns, Decidability, and Closure PropertiesM. Kutrib, A. Malcher, C. Mereghetti, B. Palano, M. WendlandtTheoretical Computer Science 578 (2015) 58-71
Deterministic One-Way Turing Machines with Sublinear Space BoundsM. Kutrib, J. Provillard, G. Vaszil, M. WendlandtFundamenta Informaticae 136 (2015) 139-155
Complexity of One-Way Cellular AutomataM. KutribIn T. Isokawa, K. Imai, N. Matsui, F. Peper, H. Umeo (eds.): Cellular Automata and Discrete Complex Systems (AUTOMATA 2014), LNCS 8996, Springer 2015, 3-18
Real-Time Reversible One-Way Cellular AutomataM. Kutrib, A. Malcher, M. WendlandtIn T. Isokawa, K. Imai, N. Matsui, F. Peper, H. Umeo (eds.): Cellular Automata and Discrete Complex Systems (AUTOMATA 2014), LNCS 8996, Springer 2015, 56-69
Stateless One-Way Multi-Head Finite Automata with PebblesM. Kutrib, A. Malcher, M. WendlandtInternational Journal of Foundations of Computer Science 25 (2014) 1141-1159
Aspects of Reversibility for Classical AutomataM. KutribIn C. S. Calude, G. R. Freivalds, K. Iwama (eds.): Computing with New Resources, Essays Dedicated to Jozef Gruska on the Occasion of his 80th Birthday, LNCS 8808, Springer 2014, 83-98
Simulations of Unary One-Way Multi-Head Finite AutomataM. Kutrib, A. Malcher, M. WendlandtInternational Journal of Foundations of Computer Science 25 (2014) 877-896
Head and State Hierarchies for Unary Multi-Head Finite AutomataM. Kutrib, A. Malcher, M. WendlandtActa Informatica 51 (2014) 553-569
Nonterminal Controlled String Assembling SystemsH. Bordihn, M. Kutrib, M. WendlandtJournal of Automata, Languages and Combinatorics 19 (2014) 33-44
Self-Assembling Pushdown AutomataM. Holzer, M. KutribJournal of Automata, Languages and Combinatorics 19 (2014) 107-118
Iterative Arrays with Set StorageM. Kutrib, A. MalcherIn J. Wąs, G. C. Sirakoulis, S. Bandini (eds.): Cellular Automata for Research and Industry (ACRI 2014), LNCS 8751, Springer 2014, 25-34
Measuring Communication in Automata SystemsM. Kutrib, A. MalcherIn A. M. Shur, M. V. Volkov (eds.): Developments in Language Theory (DLT 2014), LNCS 8633, Springer 2014, 260-274
Deterministic Set AutomataM. Kutrib, A. Malcher, M. WendlandtIn A. M. Shur, M. V. Volkov (eds.): Developments in Language Theory (DLT 2014), LNCS 8633, Springer 2014, 303-314
Regularity and Size of Set AutomataM. Kutrib, A. Malcher, M. WendlandtIn H. Jürgensen, J. Karhumäki, A. Okhotin (eds.): Descriptional Complexity of Formal Systems (DCFS 2014), LNCS 8614, Springer 2014, 281-293
Reversible Queue AutomataM. Kutrib, A. Malcher, M. WendlandtIn S. Bensch, R. Freund, F. Otto (eds.): Non-Classical Models for Automata and Applications (NCMA 2014), books@ocg.at, Volume 304, Austrian Computer Society 2014, 163-178
Measuring Communication in Parallel Communicating Finite AutomataH. Bordihn M. Kutrib, A. MalcherIn Z. Ésik, Z. Fülöp (eds.): Automata and Formal Languages (AFL 2014), EPTCS 151 (2014) 124-138
Degrees of Reversibility for DFA and DPDAM. Kutrib, Th. WorschIn Y. Shigeru, M. Shin-ichi (eds.): Reversible Computation (RC 2014), LNCS 8507, Springer 2014, 40-53
Bidirectional String Assembling SystemsM. Kutrib, M. WendlandtRAIRO - Theoretical Informatics and Applications 48 (2014) 39-59
Complexity of Operation ProblemsM. KutribIn A. Beckmann, E. Csuhaj-Varjú, K. Meer (eds.): Computability in Europe (CIE 2014), LNCS 8493, Springer 2014, 255-264
Omega-rational languages: high complexity classes vs. Borel HierarchyE. Formenti, M. Holzer, M. Kutrib, J. ProvillardIn A. H. Dediu, C. Martín-Vide, J. L. Sierra-Rodríguez, B. Truthe (eds.): Language and Automata Theory and Applications (LATA 2014), LNCS 8370, Springer 2014, 372-383
Parameterized Prefix Distance between Regular LanguagesM. Kutrib, K. Meckel, M. WendlandtIn V. Geffert, B. Preneel, B. Rovan, J. Stuller, A. M. Tjoa (eds.): Current Trends in Theory and Practice of Computer Science (SOFSEM 2014), LNCS 8327, Springer 2014, 419-430
On the Descriptional Complexity of the Window Size for Deleting Restarting AutomataM. Kutrib, F. OttoInternational Journal of Foundations of Computer Science 24 (2013) 831-846
Recent Trends in Descriptional Complexity of Formal LanguagesM. Kutrib, G. PighizziniEATCS Bulletin 111 (2013) 70-86
One-Dimensional Cellular Automata TransducersM. Kutrib, A. MalcherFundamenta Informaticae 126 (2013) 201-224
Deterministic One-Way Turing Machines with Sublinear Space BoundsM. Kutrib, J. Provillard, G. Vaszil, M. WendlandtIn S. Bensch, F. Drewes, R. Freund, F. Otto (eds.): Non-Classical Models for Automata and Applications (NCMA 2013), books@ocg.at, Volume 294, Austrian Computer Society 2013, 195-208
Size of Unary One-Way Multi-Head Finite AutomataM. Kutrib, A. Malcher, M. WendlandtIn H. Jürgensen, R. Reis (eds.): Descriptional Complexity of Formal Systems (DCFS 2013), LNCS 8031, Springer 2013, 148-159
Input-Driven Queue Automata: Finite Turns, Decidability, and Closure PropertiesM. Kutrib, A. Malcher, C. Mereghetti, B. Palano, M. WendlandtIn S. Konstantinidis (ed.): Implementation and Application of Automata (CIAA 2013), LNCS 7982, Springer 2013, 232-243
Time-Symmetric MachinesM. Kutrib, Th. WorschIn G.-W. Dueck, D. M. Miller (eds.): Reversible Computation (RC 2013), LNCS 7948, Springer 2013, 168-181
One-Way Multi-Head Finite Automata with Pebbles But No StatesM. Kutrib, A. Malcher, M. WendlandtIn M.-P. Béal, O. Carton (eds.): Developments in Language Theory (DLT 2013), LNCS 7907, Springer 2013, 313-324
The Size Impact of Little Iterative Array ResourcesM. Kutrib, A. MalcherJournal of Cellular Automata 7 (2012) 489-507
One-Way Reversible Multi-Head Finite AutomataM. Kutrib, A. MalcherIn R. Glück and T. Yokoyama (eds.): Reversible Computation (RC 2012), LNCS 7581, Springer 2013, 14-28
String Assembling SystemsM. Kutrib, M. WendlandtRAIRO - Theoretical Informatics and Applications 46 (2012) 593-613
Input-Driven Stack AutomataS. Bensch, M. Holzer, M. Kutrib, A. MalcherIn J. C. M. Baeten, T. Ball, F. S. de Boer (eds.): Theoretical Computer Science (IFIP TCS2012), LNCS 7604, Springer 2012, 28-42
Iterative Arrays: Little Resources Big Size ImpactM. Kutrib, A. MalcherIn G. C. Sirakoulis, S. Bandini (eds.): Cellular Automata for Research and Industry (ACRI 2012), LNCS 7495, Springer 2012, 42-51
Transductions Computed by One-Dimensional Cellular AutomataM. Kutrib, A. MalcherIn E. Formenti (ed.): Cellular Automata and Discrete Complex Systems (AUTOMATA 2012), EPTCS 90 (2012) 194-207
Bidirectional String assembling SystemsM. Kutrib, M. WendlandtIn R. Freund, M. Holzer, B. Truthe, U. Ultes-Nitsche (eds.): Non-Classical Models for Automata and Applications (NCMA 2012), books@ocg.at, Volume 290, Austrian Computer Society 2012, 107-121
Reversible Pushdown AutomataM. Kutrib, A. MalcherJournal of Computer and System Sciences 78 (2012) 1814-1827
Nondeterministic State Complexity of Star-Free LanguagesM. Holzer, M. Kutrib, K. MeckelTheoretical Computer Science 450 (2012) 68-80
States and Heads Do Count For Unary Multi-Head Finite AutomataM. Kutrib, A. Malcher, M. WendlandtIn H. C. Yen, O. H. Ibarra (eds.): Developments in Language Theory (DLT 2012), LNCS 7410, Springer 2012, 214-225
On CD-Systems of Stateless Deterministic Two-Phase RR(1)-AutomataM. Kutrib, F. OttoIn Languages Alive. Essays Dedicated to Jürgen Dassow on the Occasion of his 65th Birthday, LNCS 7300, Springer 2012, 111-137
Nondeterministic Cellular Automata and LanguagesM. KutribInternational Journal of General Systems 41 (2012) 555-568
On the Descriptional Complexity of the Window Size for Deterministic Restarting AutomataM. Kutrib, F. OttoIn N. Moreira, R. Reis (eds.): Implementation and Application of Automata (CIAA 2012), LNCS 7381, Springer 2012, 253-264
On the Computational Capacity of Parallel Communicating Finite AutomataH. Bordihn, M. Kutrib, A. MalcherInternational Journal of Foundations of Computer Science 23 (2012) 713-732
Oblivious Two-Way Finite Automata: Decidability and ComplexityM. Kutrib, A. Malcher, G. PighizziniIn D. Fernández-Baca (ed.): Latin American Theoretical Informatics Symposium (LATIN 2012), LNCS 7256, Springer 2012, 518-529
The Magic Number Problem for Subregular Language FamiliesM. Holzer, S. Jakobi, M. KutribInternational Journal of Foundations of Computer Science 23 (2012) 115-131
Hairpin Finite AutomataH. Bordihn, M. Holzer, M. KutribJournal of Automata, Languages and Combinatorics 16 (2011) 91-107
Undecidability and Hierarchy Results for Parallel Communicating Finite AutomataH. Bordihn, M. Kutrib, A. MalcherInternational Journal of Foundations of Computer Science 22 (2011) 1577-1592
The Complexity of Regular (Like) ExpressionsM. Holzer, M. KutribInternational Journal of Foundations of Computer Science 22 (2011) 1533-1548
Computational Complexity of NurikabeM. Holzer, A. Klein, M. Kutrib, O. RueppFundamenta Informaticae 110 (2011) 159-174
The Chop of LanguagesM. Holzer, S. Jakobi, M. KutribIn Pál Dömösi, Szabolcs Iván (eds.): Automata and Formal Languages (AFL 2011), Institute of Mathematics and Informatics, College of Nyíregyháza, Hungary, 2011, 197-210
Nodes Connected by Path LanguagesM. Holzer, M. Kutrib, U. LeiterIn G. Mauri, A. Leporati (eds.): Developments in Language Theory (DLT 2011), LNCS 6795, Springer 2011, 276-287
String Assembling SystemsM. Kutrib, M. WendlandtIn R. Freund, M. Holzer, C. Mereghetti, F. Otto, B. Palano (eds.): Non-Classical Models of Automata and Applications (NCMA 2011), books@ocg.at, Volume 282, Austrian Computer Society 2011, 179-192
Nondeterministic State Complexity of Star-Free LanguagesM. Holzer, M. Kutrib, K. MeckelIn B. Bouchou-Markhoff, P. Caron, J.-M. Champarnaud, D. Maurel (eds.): Implementation and Application of Automata (CIAA 2011), LNCS 6807, Springer 2011, 178-189
Gaining Power by Input Operations: Finite Automata and BeyondM. Holzer, M. KutribIn B. Bouchou-Markhoff, P. Caron, J.-M. Champarnaud, D. Maurel (eds.): Implementation and Application of Automata (CIAA 2011), LNCS 6807, Springer 2011, 16-29
Nature-Based Problems in Cellular AutomataM. KutribIn B. Löwe, D. Normann, I. Soskov, A. Soskova (eds.): Models of Computation in Context (CIE 2011), LNCS 6735, Springer 2011, 171-180
Cellular Automata with Limited Inter-Cell BandwidthM. Kutrib, A. MalcherTheoretical Computer Science 412 (2011) 3917-3931
Descriptional and Computational Complexity of Finite Automata - A SurveyM. Holzer, M. KutribInformation and Computation 209 (2011) 456-470
Undecidability of Operation Problems for T0L Languages and SubclassesH. Bordihn, M. Holzer, M. KutribInformation and Computation 209 (2011) 344-352
Measuring Communication in Cellular AutomataM. Kutrib, A. MalcherIn J. Kari (ed.): Symposium on Cellular Automata - Journées Automates Cellulaires (JAC 2010), TUCS Lecture Notes 13, Turku Centre for Computer Science 2010, 13-30
Transductions Computed by Iterative ArraysM. Kutrib, A. MalcherIn J. Kari (ed.): Symposium on Cellular Automata - Journées Automates Cellulaires (JAC 2010), TUCS Lecture Notes 13, Turku Centre for Computer Science 2010, 156-167
Multi-Head Finite Automata: Origins and DirectionsM. Holzer, M. Kutrib, A. MalcherTheoretical Computer Science 412 (2011) 83-96
On Stateless Deterministic Restarting AutomataM. Kutrib, H. Messerschmidt, F. OttoActa Informatica 47 (2010) 391-412
Two-Party Watson-Crick ComputationsM. Kutrib, A. MalcherIn M. Domaratzki, K. Salomaa (eds.): Implementation and Application of Automata (CIAA 2010), LNCS 6482, Springer 2010, 191-200
Cellular Automata and the Quest for Nontrivial Artificial Self-reproductionM. Holzer, M. KutribIn M. Gheorghe, T. Hinze, G. Păun (eds.): Conference on Membrane Computing (CMC 11), LNCS 6501, Springer 2010, 19-36
On Stateless Two-Pushdown Automata and Restarting AutomataM. Kutrib, H. Messerschmidt, F. OttoInternational Journal of Foundations of Computer Science 21 (2010) 781-798
Descriptional Complexity of (Un)ambiguous Finite State Machines and Pushdown AutomataM. Holzer, M. KutribIn A. Kucera, I. Potapov (eds.): Reachability Problems (RP 2010), LNCS 6227, Springer 2010, 1-23
![]() Undecidability and Hierarchy Results for Parallel Communicating Finite AutomataH. Bordihn, M. Kutrib, A. MalcherIn Y. Gao, H. Lu, S. Seki, S. Yu (eds.): Developments in Language Theory (DLT 2010), LNCS 6224, Springer 2010, 88-99
The Complexity of Regular (Like) ExpressionsM. Holzer, M. KutribIn Y. Gao, H. Lu, S. Seki, S. Yu (eds.): Developments in Language Theory (DLT 2010), LNCS 6224, Springer 2010, 16-30
Cellular Automata With Sparse CommunicationM. Kutrib, A. MalcherTheoretical Computer Science 411 (2010) 3516-3526
The Magic Number Problem for Subregular Language FamiliesM. Holzer, S. Jakobi, M. KutribIn I. McQuillan, G. Pighizzini, B. Trost (eds.): Descriptional Complexity of Formal Systems (DCFS 2010), University of Saskatchewan, Saskatoon, Canada 2010, 135-146
The Size of One-Way Cellular AutomataM. Kutrib, J. Lefèvre, A. MalcherIn N. Fatès, J. Kari, T. Worsch (eds.): Cellular Automata and Discrete Complex Systems (AUTOMATA 2010), Discrete Mathematics and Theoretical Computer Science, Proc. AL (2010) 75-94
Reversible Pushdown AutomataM. Kutrib, A. MalcherIn A.-H. Dediu, H. Fernau, C. Martín-Vide (eds.): Language and Automata Theory and Applications (LATA 2010), LNCS 6031, Springer 2010, 368-379
On Measuring Non-Recursive Trade-OffH. Gruber, M. Holzer, M. KutribJournal of Automata, Languages and Combinatorics 15 (2010) 107-120
One-Way Cellular Automata, Bounded Languages, and Minimal CommunicationM. Kutrib, A. MalcherJournal of Automata, Languages and Combinatorics 15 (2010) 135-153
Descriptional Complexity - An Introductory SurveyM. Holzer, M. KutribIn C. Martín-Vide (ed.): Scientific Applications of Language Methods, Chapter 1, Imperial College Press 2010, 1-58
Real-Time Reversible Iterative ArraysM. Kutrib, A. MalcherTheoretical Computer Science 411 (2010) 812-822
On Input-Revolving Deterministic and Nondeterministic Finite AutomataS. Bensch, H. Bordihn, M. Holzer, M. KutribInformation and Computation 207 (2009) 1140-1155
On One-Way One-Bit O(One)-Message Cellular AutomataM. Kutrib, A. MalcherElectronic Notes in Theoretical Computer Science 252 (2009) 77-91
Nondeterministic Finite Automata - Recent Results on the Descriptional and Computational ComplexityM. Holzer, M. KutribInternational Journal of Foundations of Computer Science 20 (2009) 563-580
Cellular Automata and Language TheoryM. KutribIn R. Meyers (ed.): Encyclopedia of Complexity and System Science, Springer 2009, 800-823
Regulated Nondeterminism in Pushdown AutomataM. Kutrib, A. Malcher, L. WerleinTheoretical Computer Science 410 (2009) 3447-3460
Self-Assembling Finite AutomataA. Klein, M. KutribJournal of Automata, Languages and Combinatorics 14 (2009) 75-92
Determinization of Finite Automata Accepting Subregular LanguagesH. Bordihn, M. Holzer, M. KutribTheoretical Computer Science 410 (2009), 3209-3222
Computations and Decidability of Iterative Arrays with Restricted CommunicationM. Kutrib, A. MalcherParallel Processing Letters 19 (2009) 247-264
On the Number of Membranes in Unary P SystemsR. Freund, A. Klein, M. KutribIn J. Dassow, G. Pighizzini, B. Truthe (eds.): Descriptional Complexity of Formal Systems (DCFS 2009), Otto-von-Guericke-Universität Magdeburg, Germany 2009, 139-149
Bounded Languages Meet Cellular Automata with Sparse CommunicationM. Kutrib, A. MalcherIn J. Dassow, G. Pighizzini, B. Truthe (eds.): Descriptional Complexity of Formal Systems (DCFS 2009), Otto-von-Guericke-Universität Magdeburg, Germany 2009, 211-222
More on the Size of Higman-Haines Sets: Effective ConstructionsH. Gruber, M. Holzer, M. KutribFundamenta Informaticae 91 (2009) 105-121
Descriptional and Computational Complexity of Finite AutomataM. Holzer, M. KutribIn A. H. Dediu, A. M. Ionescu, C. Martín-Vide (eds.): Language and Automata Theory and Applications (LATA 2009), LNCS 5457, Springer 2009, 23-42
Undecidability of Operation Problems for T0L Languages and SubclassesH. Bordihn, M. Holzer, M. KutribIn A. H. Dediu, A. M. Ionescu, C. Martín-Vide (eds.): Language and Automata Theory and Applications (LATA 2009), LNCS 5457, Springer 2009, 236-246
Succinct Description of Regular Languages by Weak Restarting AutomataM. Kutrib, J. ReimannInformation and Computation 206 (2008) 1152-1160
Fast Reversible Language Recognition Using Cellular AutomataM. Kutrib, A. MalcherInformation and Computation 206 (2008) 1142-1151
Optimal Simulations of Weak Restarting AutomataM. Kutrib, J. ReimannInternational Journal of Foundations of Computer Science 19 (2008), 795-811
On the Computational Capacity of Parallel Communicating Finite AutomataH. Bordihn, M. Kutrib, A. MalcherIn M. Ito, M. Toyama (eds.): Developments in Language Theory (DLT 2008), LNCS 5257, Springer 2008, 146-157
Deterministic Input-Reversal and Input-Revolving Finite AutomataS. Bensch, H. Bordihn, M. Holzer, M. KutribIn C. Martín-Vide, F. Otto, H. Fernau (eds.): Language and Automata Theory and Applications (LATA 2008), LNCS 5196, Springer 2008, 113-124
Nondeterministic Finite Automata - Recent Results on the Descriptional and Computational ComplexityM. Holzer, M. KutribIn O. H. Ibarra, B. Ravikumar (eds.): Implementation and Application of Automata (CIAA 2008), LNCS 5148, Springer 2008, 1-16
The Boolean Closure of Linear Context-Free LanguagesM. Kutrib, A. Malcher, D. WotschkeActa Informatica 45 (2008) 177-191
![]() Cellular Automata - A Computational Point of ViewM. KutribIn G. Bel-Enguix, M. D. Jiménez-López, C. Martín-Vide (eds.): New Developments in Formal Languages and Applications, Chapter 6, Springer 2008, 183-227
Efficient Pushdown Cellular Automata: Universality, Time and Space HierarchiesM. KutribJournal of Cellular Automata 3 (2008), 93-114
When Church-Rosser Becomes Context FreeM. Kutrib, A. MalcherInternational Journal of Foundations of Computer Science 18 (2007), 1293-1302
The Size of Higman-Haines SetsH. Gruber, M. Holzer, M. KutribTheoretical Computer Science 387 (2007), 167-176
Context-Free Grammars with Linked NonterminalsA. Klein, M. KutribInternational Journal of Foundations of Computer Science 18 (2007), 1271-1282
Non-Recursive Trade-Offs for Deterministic Restarting AutomataM. Holzer, M. Kutrib, J. ReimannJournal of Automata, Languages and Combinatorics 12 (2007), 195-213
Finite Turns and the Regular Closure of Linear Context-Free LanguagesM. Kutrib, A. MalcherDiscrete Applied Mathematics 155 (2007), 2152-2164
Hybrid Extended Finite AutomataH. Bordihn, M. Holzer, M. KutribInternational Journal of Foundations of Computer Science 18 (2007), 745-760
Hairpin Finite AutomataH. Bordihn, M. Holzer, M. KutribIn T. Harju, J. Karhumäki, A. Lepistö (eds.): Developments in Language Theory (DLT 2007), LNCS 4588, Springer 2007, 108-119
Context-Dependent Nondeterminism for Pushdown AutomataM. Kutrib, A. MalcherTheoretical Computer Science 376 (2007), 101-111
Cellular Devices and Unary LanguagesA. Klein, M. KutribFundamenta Informaticae 78 (2007), 343-368
Variable Complexity of Simple ProgramsM. Holzer, M. KutribFundamenta Informaticae 74 (2006), 511-528
Fast Iterative Arrays with Restricted Inter-Cell Communication: Constructions and DecidabilityM. Kutrib, A. MalcherIn R. Kralovic, P. Urzyczyn (eds.): Mathematical Foundations of Computer Science 2006 (MFCS 2006), LNCS 4162, Springer 2006, 634-645
Fast Cellular Automata with Restricted Inter-Cell Communication: Computational CapacityM. Kutrib, A. MalcherIn G. Navarro, L. Bertossi, Y. Kohayakawa (eds.): Theoretical Computer Science (IFIP TCS 2006), IFIP 209, Springer 2006, 151-164
The Phenomenon of Non-Recursive Trade-OffsM. KutribInternational Journal of Foundations of Computer Science 16 (2005), 957-973
Revolving-Input Finite AutomataH. Bordihn, M. Holzer, M. KutribIn C. De Felice, A. Restivo (eds.): Developments in Language Theory (DLT 2005), LNCS 3572, Springer 2005, 168-179
Unsolvability Levels of Operation Problems for Subclasses of Context-Free LanguagesH. Bordihn, M. Holzer, M. KutribInternational Journal of Foundations of Computer Science 16 (2005), 423-440
On the Descriptional Power of Heads, Counters, and PebblesM. KutribTheoretical Computer Science 330 (2005), 311-324
On the Descriptional Complexity of Finite Automata With Modified Acceptance ConditionsM. Holzer, M. KutribTheoretical Computer Science 330 (2005), 267-285
Economy of Description for Basic Constructions on Rational TransductionsH. Bordihn, M. Holzer, M. KutribJournal of Automata, Languages and Combinatorics 9 (2004), 175-188
Register Complexity of LOOP-, WHILE-, and GOTO-ProgramsM. Holzer, M. KutribIn M. Margenstern (ed.): Machines, Computations and Universality (MCU 2004), LNCS 3354, Springer 2005, 233-244
Input Reversals and Iterated Pushdown Automata -
H. Bordihn, M. Holzer, M. Kutrib |
17.02.2025 | |
Zurück zu M. Kutrib |