"On the Descriptional Complexity of the Window Size for Deterministic Restarting Automata"

entries per page

Filter:

Showing 1 to 20 of 100 entries

Book	Author(s)	Year	Publisher
Cellular Automata - Simplicity Behind Complexity	A. Salcido	2011	Intech
Cellular Automata and Complexity: Collected Papers	Stephen Wolfram	1994	Routledge
Finite Automata, Formal Logic, and Circuit Complexity	Howard Straubing	1994	Birkhäuser Boston
Problem Solving in Automata, Languages, and Complexity	Ding-Zhu Du Ph.D.,	2001	John Wiley & Sons
Automata, computability and complexity: theory and applications	Elaine Rich	2008	Pearson Prentice Hall
Problem solving in automata, languages, and complexity	Du, Dingzhu.	2001	Wiley
Restarting Stalled Research	Paul C. Rosenblatt	May 2015	SAGE Publications, Inc
Automata and Complexity: Essays Presented to Eric Goles on the Occasion of His 70th Birthday	Andrew Adamatzky	1st ed. 2022	Springer International Publishing
Descriptional Complexity of Formal Systems: 17th International Workshop, DCFS 2015, Waterloo, ON, Canada, June 25-27, 2015. Proceedings	Jeffrey Shallit; Alexander Okhotin	2015	Springer International Publishing
Whither China?: Restarting the Reform Agenda	Wu Jinglian; Ma Guochuan	2016	Oxford University Press
On the complexity of edge labelings for trees	Shmuel Zaks	1978	Dept. of Computer Science, University of Illinois at Urbana-Champaign
On complexity /	Morin, Edgar.	c2008.	Hampton Press,
Size list of doors, sashes, blinds, glazed windows, door & window frames	Hardy & Co Slattery	1884	Slattery, Hardy & Co.
Cellular Automata: A Volume in the Encyclopedia of Complexity and Systems Science, Second Edition	Andrew Adamatzky	1st ed. 2018	Springer US
Descriptional Complexity of Formal Systems: 14th International Workshop, DCFS 2012, Braga, Portugal, July 23-25, 2012, Proceedings	Martin Kutrib; Nelma Moreira; Rogério Reis	2012	Springer Berlin Heidelberg
Descriptional Complexity of Formal Systems: 15th International Workshop, DCFS 2013, London, Canada, July 22-25, 2013, Proceedings	Jürgensen; Rogério Reis	2013	Springer Berlin Heidelberg
Descriptional Complexity of Formal Systems: 22nd International Conference, DCFS 2020, Vienna, Austria, August 24–26, 2020, Proceedings	Galina Jirásková; Giovanni Pighizzini	1st ed. 2020	Springer International Publishing
Descriptional Complexity of Formal Systems: 16th International Workshop, DCFS 2014, Turku, Finland, August 5-8, 2014. Proceedings	Helmut Jürgensen, Juhani Karhumäki, Alexander Okhotin (eds.)	2014	Springer International Publishing
Descriptional Complexity of Formal Systems: 16th International Workshop, DCFS 2014, Turku, Finland, August 5-8, 2014, Proceedings	Jeffrey Shallit; Alexander Okhotin	Jul 21, 2014	Springer
Descriptional Complexity of Formal Systems: 16th International Workshop, DCFS 2014, Turku, Finland, August 5-8, 2014, Proceedings	Helmut Jürgensen; Juhani Karhumäki; Alexander Okhotin	2014	Springer International Publishing
Boook	Author(s)	Year	Publisher

Showing 1 to 20 of 100 entries

entries per page

Filter:

Showing 1 to 20 of 100 entries

Chapter	Author(s)	Book	Book Authors	Year	Publisher
On the Descriptional Complexity of the Window Size for Deterministic Restarting Automata	Martin Kutrib; Friedrich Otto	Implementation and Application of Automata: 17th International Conference, CIAA 2012, Porto, Portugal, July 17-20, 2012. Proceedings	Nelma Moreira; Rogério Reis	2012	Springer Berlin Heidelberg
On the Descriptional Complexity of Deterministic Ordered Restarting Automata	Friedrich Otto	Descriptional Complexity of Formal Systems: 16th International Workshop, DCFS 2014, Turku, Finland, August 5-8, 2014, Proceedings	Helmut Jürgensen; Juhani Karhumäki; Alexander Okhotin	2014	Springer International Publishing
On the Descriptional Complexity of Deterministic Ordered Restarting Automa		Descriptional Complexity of Formal Systems: 16th International Workshop, DCFS 2014, Turku, Finland, August 5-8, 2014. Proceedings	Helmut Jürgensen, Juhani Karhumäki, Alexander Okhotin (eds.)	2014	Springer International Publishing
On Restarting Automata with Window Size One	Friedrich Otto	Descriptional Complexity of Formal Systems: 13 International Workshop, DCFS 2011, Gießen/Limburg, Germany, July 25-27, 2011. Proceedings	Markus Holzer; Martin Kutrib; Giovanni Pighizzini	2011	Springer Berlin Heidelberg
On Stateless Deterministic Restarting Automata	Martin Kutrib; Hartmut Messerschmidt; Friedrich Otto	SOFSEM 2009: Theory and Practice of Computer Science: 35th Conference on Current Trends in Theory and Practice of Computer Science, Špindleruv Mlýn, Czech Republic, January 24-30, 2009. Proceedings	Mogens Nielsen; Antonin Kucera; Peter Bro Miltersen; Catuscia Palamidessi; Petr Tuma; Frank Valencia	2009	Springer Berlin Heidelberg
On the Size Complexity of Deterministic Frequency Automata	Rūsiņš Freivalds; Thomas Zeugmann; Grant R. Pogosyan	Language and Automata Theory and Applications: 7th International Conference, LATA 2013, Bilbao, Spain, April 2-5, 2013, Proceedings	Adrian-Horia Dediu; Carlos Martín-Vide; Bianca Truthe	2013	Springer Berlin Heidelberg
On the Size Complexity of Deterministic Frequency Automata		Language and Automata Theory and Applications: 7th International Conference, LATA 2013, Bilbao, Spain, April 2-5, 2013. Proceedings	Adrian-Horia Dediu	2013	Springer Berlin Heidelberg;Imprint: Springer
On the Size Complexity of Deterministic Frequency Automata		Language and Automata Theory and Applications: 7th International Conference, LATA 2013, Bilbao, Spain, April 2-5, 2013. Proceedings	Adrian-Horia Dediu	2013	Springer Berlin Heidelberg;Imprint: Springer
On Left-Monotone Deterministic Restarting Automata	T. Jurdziński; F. Otto; F. Mráz; M. Plátek	Developments in Language Theory: 8th International Conference, DLT 2004, Auckland, New Zealand, December 13-17, Proceedings	Cristian S. Calude; Elena Calude; Michael J. Dinneen	2005	Springer Berlin Heidelberg
On Shrinking Restarting Automata of Window Size One and Two	František Mráz; Friedrich Otto	Developments in Language Theory: 23rd International Conference, DLT 2019, Warsaw, Poland, August 5–9, 2019, Proceedings	Piotrek Hofman; Michał Skrzypczak	1st ed. 2019	Springer International Publishing
Descriptional Complexity of Deterministic Regular Expressions	Katja Losemann; Wim Martens; Matthias Niewerth	Mathematical Foundations of Computer Science 2012: 37th International Symposium, MFCS 2012, Bratislava, Slovakia, August 27-31, 2012, Proceedings	Branislav Rovan; Vladimiro Sassone; Peter Widmayer	2012	Springer Berlin Heidelberg
Descriptional Complexity of Nondeterministic Finite Automata	Kai Salomaa	Developments in Language Theory: 11th International Conference, DLT 2007, Turku, Finland, July 3-6, 2007, Proceedings	Tero Harju; Juhani Karhumäki; Arto Lepistö	2007	Springer Berlin Heidelberg
On the Complexity of 2-Monotone Restarting Automata	T. Jurdziński; F. Otto; F. Mráz; M. Plátek	Developments in Language Theory: 8th International Conference, DLT 2004, Auckland, New Zealand, December 13-17, Proceedings	Cristian S. Calude; Elena Calude; Michael J. Dinneen	2005	Springer Berlin Heidelberg
On the Size of Deterministic Finite Automata	Bořivoj Melichar; Jan Skryja	Implementation and Application of Automata: 6th International Conference, CIAA 2001, Pretoria, South Africa, July 23-25, 2001. Revised Papers	Bruce Watson; Derick Wood	2002	Springer Berlin Heidelberg
Cellular Automata: Descriptional Complexity and Decidability	Martin Kutrib; Andreas Malcher	Reversibility and Universality: Essays Presented to Kenichi Morita on the Occasion of his 70th Birthday	Andrew Adamatzky	1st ed. 2018	Springer International Publishing
Descriptional and Computational Complexity of Finite Automata	Markus Holzer; Martin Kutrib	Language and Automata Theory and Applications: Third International Conference, LATA 2009, Tarragona, Spain, April 2-8, 2009. Proceedings	Adrian Horia Dediu; Armand Mihai Ionescu; Carlos Martin-Vide	2009	Springer Berlin Heidelberg
Descriptional Complexity of Unambiguous Nested Word Automata	Alexander Okhotin; Kai Salomaa	Language and Automata Theory and Applications: 5th International Conference, LATA 2011, Tarragona, Spain, May 26-31, 2011	Adrian-Horia Dediu; Carlos Martín-Vide; Shunsuke Inenaga	2011	Springer Berlin Heidelberg
Descriptional Complexity of Input-Driven Pushdown Automata	Alexander Okhotin; Xiaoxue Piao; Kai Salomaa	Languages Alive: Essays dedicated to Jürgen Dassow on the Occasion of His 65th Birthday	Henning Bordihn; Martin Kutrib; Bianca Truthe	2012	Springer Berlin Heidelberg
More on the Descriptional Complexity of Products of Finite Automata	Markus Holzer; Christian Rauch	Descriptional Complexity of Formal Systems: 23rd IFIP WG 1. 02 International Conference, DCFS 2021, Virtual Event, September 5, 2021, Proceedings	Yo-Sub Han; Sang-Ki Ko	1st ed. 2021	Springer International Publishing
Strictly Deterministic CD-Systems of Restarting Automata	H. Messerschmidt; F. Otto	Fundamentals of Computation Theory: 16th International Symposium, FCT 2007, Budapest, Hungary, August 27-30, 2007, Proceedings	Erzsébet Csuhaj-Varjú; Zoltán Ésik	2007	Springer Berlin Heidelberg
Chapter	Author(s)	Book	Book Authors	Year	Publisher

Showing 1 to 20 of 100 entries

"On the Descriptional Complexity of the Window Size for Deterministic Restarting Automata" - similar Books and Chapters