The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications at "DCFS"( http://dblp.L3S.de/Venues/DCFS )

URL (DBLP): http://dblp.uni-trier.de/db/conf/dcfs

Publication years (Num. hits)
2001 (20) 2002 (23) 2003 (27) 2004 (24) 2005 (29) 2006 (27) 2007 (17) 2008 (22) 2009 (19) 2010 (22) 2011 (26) 2012 (25) 2013 (27) 2014 (32) 2015 (25) 2016 (17) 2017 (25) 2018 (21) 2019 (23) 2020 (20) 2021 (17) 2022 (16) 2023 (15)
Publication types (Num. hits)
inproceedings(496) proceedings(23)
Venues (Conferences, Journals, ...)
DCFS(519)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
No Growbag Graphs found.

Results
Found 519 publication records. Showing 519 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Martin Kappes, Andreas Malcher, Detlef Wotschke Remembering Chandra Kintala Search on Bibsonomy DCFS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Anna Kasprzik Learning Residual Finite-State Automata Using Observation Tables Search on Bibsonomy DCFS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Markus Holzer 0001, Sebastian Jakobi, Martin Kutrib The Magic Number Problem for Subregular Language Families Search on Bibsonomy DCFS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Ian McQuillan, Giovanni Pighizzini (eds.) Proceedings Twelfth Annual Workshop on Descriptional Complexity of Formal Systems, DCFS 2010, Saskatoon, Canada, 8-10th August 2010. Search on Bibsonomy DCFS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Jürgen Dassow, Florin Manea Accepting Hybrid Networks of Evolutionary Processors with Special Topologies and Small Communication Search on Bibsonomy DCFS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Galina Jirásková, Monika Krausová Complexity in Prefix-Free Regular Languages Search on Bibsonomy DCFS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Yo-Sub Han, Kai Salomaa Nondeterministic State Complexity for Suffix-Free Regular Languages Search on Bibsonomy DCFS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Nelma Moreira, Davide Nabais, Rogério Reis State Elimination Ordering Strategies: Some Experimental Results Search on Bibsonomy DCFS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Xiaoxue Piao, Kai Salomaa Transformations Between Different Types of Unranked Bottom-Up Tree Automata Search on Bibsonomy DCFS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Yuan Gao 0001, Kai Salomaa, Sheng Yu 0001 Transition Complexity of Incomplete DFAs Search on Bibsonomy DCFS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Bo Cui 0001, Yuan Gao 0001, Lila Kari, Sheng Yu 0001 State Complexity of Catenation Combined with Star and Reversal Search on Bibsonomy DCFS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Erzsébet Csuhaj-Varjú, György Vaszil On the Size Complexity of Non-Returning Context-Free PC Grammar Systems Search on Bibsonomy DCFS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Tomás Masopust, Alexander Meduna Descriptional Complexity of Three-Nonterminal Scattered Context Grammars: An Improvement Search on Bibsonomy DCFS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Christel Baier, Nathalie Bertrand 0001, Marcus Größer Probabilistic Automata over Infinite Words: Expressiveness, Efficiency, and Decidability Search on Bibsonomy DCFS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Hermann Gruber, Markus Holzer 0001, Martin Kutrib On Measuring Non-Recursive Trade-Offs Search on Bibsonomy DCFS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Janusz A. Brzozowski Quotient Complexity of Regular Languages Search on Bibsonomy DCFS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Galina Jirásková, Alexander Okhotin Nondeterministic State Complexity of Positional Addition Search on Bibsonomy DCFS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Ralf Stiebe, Sherzod Turaev Capacity Bounded Grammars and Petri Nets Search on Bibsonomy DCFS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1M. Sakthi Balan Serializing the Parallelism in Parallel Communicating Pushdown Automata Systems Search on Bibsonomy DCFS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Martin Kutrib, Andreas Malcher Bounded Languages Meet Cellular Automata with Sparse Communication Search on Bibsonomy DCFS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1John Jack, Andrei Paun The Nondeterministic Waiting Time Algorithm: A Review Search on Bibsonomy DCFS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Remco Loos, Florin Manea, Victor Mitrana Small Universal Accepting Networks of Evolutionary Processors with Filtered Connections Search on Bibsonomy DCFS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Jürgen Dassow, Giovanni Pighizzini, Bianca Truthe (eds.) Proceedings Eleventh International Workshop on Descriptional Complexity of Formal Systems, DCFS 2009, Magdeburg, Germany, July 6-9, 2009. Search on Bibsonomy DCFS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Marco Almeida, Nelma Moreira, Rogério Reis Testing the Equivalence of Regular Languages Search on Bibsonomy DCFS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Yuan Gao 0001, Sheng Yu 0001 State Complexity Approximation Search on Bibsonomy DCFS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Pierluigi Frisco, Oscar H. Ibarra On Languages Accepted by P/T Systems Composed of joins Search on Bibsonomy DCFS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Franziska Biegler, Mark Daley, Ian McQuillan On the Shuffle Automaton Size for Words Search on Bibsonomy DCFS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Rudolf Freund, Andreas Klein 0001, Martin Kutrib On the Number of Membranes in Unary P Systems Search on Bibsonomy DCFS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Viliam Geffert, Lubomíra Istonová Translation from Classical Two-Way Automata to Pebble Two-Way Automata Search on Bibsonomy DCFS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Fevzi Belli, Mutlu Beyazit Mutation of Directed Graphs -- Corresponding Regular Expressions and Complexity of Their Generation Search on Bibsonomy DCFS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Hermann Gruber, Markus Holzer 0001 Language Operations with Regular Expressions of Polynomial Size. Search on Bibsonomy DCFS The full citation details ... 2008 DBLP  BibTeX  RDF
1Balasubramanian Ravikumar Non-regularity, Approximation and State Complexity. Search on Bibsonomy DCFS The full citation details ... 2008 DBLP  BibTeX  RDF
1Mark Daley, Michael Domaratzki, Kai Salomaa State Complexity of Orthogonal Catenation. Search on Bibsonomy DCFS The full citation details ... 2008 DBLP  BibTeX  RDF
1Eric Allender Circuit Complexity, Kolmogorov Complexity, and Prospects for Lower Bounds. Search on Bibsonomy DCFS The full citation details ... 2008 DBLP  BibTeX  RDF
1Lakshmanan Kuppusamy, Anand Mahendran, Kamala Krithivasan On the Trade-Off Between Ambiguity and Measures in Internal Contextual Grammars. Search on Bibsonomy DCFS The full citation details ... 2008 DBLP  BibTeX  RDF
1Franziska Biegler, Kai Salomaa On the Synchronized Derivation Depth of Context-Free Grammars. Search on Bibsonomy DCFS The full citation details ... 2008 DBLP  BibTeX  RDF
1Xiaoxue Piao, Kai Salomaa Operational State Complexity of Nested Word Automata. Search on Bibsonomy DCFS The full citation details ... 2008 DBLP  BibTeX  RDF
1Akihiro Matsuura, Yusuke Saito Equivalent Transformation of Minimal Finite Automata over a Two-Letter Alphabet. Search on Bibsonomy DCFS The full citation details ... 2008 DBLP  BibTeX  RDF
1Cezar Câmpeanu, Giovanni Pighizzini (eds.) 10th International Workshop on Descriptional Complexity of Formal Systems, DCFS 2008, Charlottetown, Prince Edward Island, Canada, July 16-18, 2008. Search on Bibsonomy DCFS The full citation details ... 2008 DBLP  BibTeX  RDF
1Henning Bordihn, Markus Holzer 0001, Martin Kutrib State Complexity of NFA to DFA Conversion of Subregular Language Families. Search on Bibsonomy DCFS The full citation details ... 2008 DBLP  BibTeX  RDF
1Artiom Alhazov, Erzsébet Csuhaj-Varjú, Carlos Martín-Vide, Yurii Rogozhin Computational Completeness of Hybrid Networks of Evolutionary Processors with Seven Nodes. Search on Bibsonomy DCFS The full citation details ... 2008 DBLP  BibTeX  RDF
1Elena Czeizler, Eugen Czeizler, Lila Kari, Kai Salomaa Watson-Crick automata: determinism and state complexity. Search on Bibsonomy DCFS The full citation details ... 2008 DBLP  BibTeX  RDF
1Jürgen Dassow, Bianca Truthe On Two Hierarchies of Subregularly Tree Controlled Languages. Search on Bibsonomy DCFS The full citation details ... 2008 DBLP  BibTeX  RDF
1György Vaszil Automata-like Membrane Systems - A Natural Way to Describe Complex Phenomena. Search on Bibsonomy DCFS The full citation details ... 2008 DBLP  BibTeX  RDF
1Marco Almeida, Nelma Moreira, Rogério Reis Exact Generation of Acyclic Deterministic Finite Automata. Search on Bibsonomy DCFS The full citation details ... 2008 DBLP  BibTeX  RDF
1Janusz A. Brzozowski, Nicolae Santean Determinism without Determinization. Search on Bibsonomy DCFS The full citation details ... 2008 DBLP  BibTeX  RDF
1Janusz A. Brzozowski, Stavros Konstantinidis State-Complexity Hierarchies of Uniform Languages of Alphabet-Size Length. Search on Bibsonomy DCFS The full citation details ... 2008 DBLP  BibTeX  RDF
1András Faragó On the Descriptional Complexity of Path Optimization in Graphs. Search on Bibsonomy DCFS The full citation details ... 2008 DBLP  BibTeX  RDF
1Maria Paola Bianchi, Beatrice Palano On leftmost #-Rewriting Systems. Search on Bibsonomy DCFS The full citation details ... 2008 DBLP  BibTeX  RDF
1Takashi Emori, Taishin Y. Nishida An Efficient Derivation Method for DTOL Systems and a Measure of Derivation Complexity. Search on Bibsonomy DCFS The full citation details ... 2008 DBLP  BibTeX  RDF
1Cristian Calude Incompleteness: A Personal Perspective. Search on Bibsonomy DCFS The full citation details ... 2008 DBLP  BibTeX  RDF
1Zoltán Ésik, Yuan Gao 0001, Guangwu Liu, Sheng Yu 0001 Estimation of State Complexity of Combined Operations. Search on Bibsonomy DCFS The full citation details ... 2008 DBLP  BibTeX  RDF
1Marco Almeida, Nelma Moreira, Rogério Reis Exact Generation of Minimal Acyclic Deterministic Finite Automata. Search on Bibsonomy DCFS The full citation details ... 2007 DBLP  BibTeX  RDF
1Rudolf Freund, Marion Oswald CD Grammar Systems with Regular Start Conditions. Search on Bibsonomy DCFS The full citation details ... 2007 DBLP  BibTeX  RDF
1Alexander Meduna, Jirí Techet Reduction of Scattered Context Generators of Sentences Preceded by Their Leftmost Parses. Search on Bibsonomy DCFS The full citation details ... 2007 DBLP  BibTeX  RDF
1Carlo Mereghetti The Descriptional Power of Sublogarithmic Resource Bounded Turing Machines. Search on Bibsonomy DCFS The full citation details ... 2007 DBLP  BibTeX  RDF
1Markus E. Nebel Compact Descriptions for Efficient Algorithms. Search on Bibsonomy DCFS The full citation details ... 2007 DBLP  BibTeX  RDF
1Tomás Masopust, Alexander Meduna Descriptional Complexity of Generalized Forbidding Grammars. Search on Bibsonomy DCFS The full citation details ... 2007 DBLP  BibTeX  RDF
1Viliam Geffert, Giovanni Pighizzini (eds.) 9th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2007, High Tatras, Slovakia, July 20 - 22, 2007 Search on Bibsonomy DCFS The full citation details ... 2007 DBLP  BibTeX  RDF
1Kostyantyn Archangelsky A New Measure of Descriptional Complexity of Languages and Formal Power Series: Compactness. Search on Bibsonomy DCFS The full citation details ... 2007 DBLP  BibTeX  RDF
1Helmut Jürgensen Complexity, Information, Energy. Search on Bibsonomy DCFS The full citation details ... 2007 DBLP  BibTeX  RDF
1Beatrice Palano A Regularity Condition for Context-Free Grammars. Search on Bibsonomy DCFS The full citation details ... 2007 DBLP  BibTeX  RDF
1Jürgen Dassow, Ralf Stiebe Nonterminal Complexity of Some Operations on Context-Free Languages. Search on Bibsonomy DCFS The full citation details ... 2007 DBLP  BibTeX  RDF
1Jirí Wiedermann, Dana Pardubská Wireless Parallel Computing and its Links to Descriptive Complexity. Search on Bibsonomy DCFS The full citation details ... 2007 DBLP  BibTeX  RDF
1Martin Kutrib, Jens Reimann Optimal Simulations of Weak Restarting Automata. Search on Bibsonomy DCFS The full citation details ... 2007 DBLP  BibTeX  RDF
1Remco Loos, Andreas Malcher, Detlef Wotschke Descriptional Complexity of Splicing Systems. Search on Bibsonomy DCFS The full citation details ... 2007 DBLP  BibTeX  RDF
1Taishin Y. Nishida Descriptional Complexities of Grammars over Alphabets with Finite Parameters. Search on Bibsonomy DCFS The full citation details ... 2007 DBLP  BibTeX  RDF
1Bianca Truthe Remarks on Context-Free Parallel Communicating Grammar Systems Generating Crossed Agreements. Search on Bibsonomy DCFS The full citation details ... 2007 DBLP  BibTeX  RDF
1Gheorghe Paun, Mario J. Pérez-Jiménez, Takashi Yokomori Representations and Characterizations of Languages in Chomsky Hierarchy by Means of Insertion-Deletion Systems. Search on Bibsonomy DCFS The full citation details ... 2007 DBLP  BibTeX  RDF
1Andreas Malcher Cellular Automata and Descriptional Complexity. Search on Bibsonomy DCFS The full citation details ... 2006 DBLP  BibTeX  RDF
1J. Kavitha, L. Jeganathan, G. Sethuraman 0001 Descriptional Complexity of Alternating Finite Automata. Search on Bibsonomy DCFS The full citation details ... 2006 DBLP  BibTeX  RDF
1Jürgen Dassow, Bianca Truthe On the Degree Complexity of Special Non-Context-Free Languages with Respect to PC Grammar Systems. Search on Bibsonomy DCFS The full citation details ... 2006 DBLP  BibTeX  RDF
1Jeffrey O. Shallit New Directions in State Complexity. Search on Bibsonomy DCFS The full citation details ... 2006 DBLP  BibTeX  RDF
1Rudolf Freund Special Variants of P Systems with One Catalyst in One Membrane. Search on Bibsonomy DCFS The full citation details ... 2006 DBLP  BibTeX  RDF
1Franziska Biegler, Ian McQuillan, Kai Salomaa An Infinite Hierarchy Induced by Depth Synchronization. Search on Bibsonomy DCFS The full citation details ... 2006 DBLP  BibTeX  RDF
1Carlo Mereghetti, Beatrice Palano Quantum Automata for some Multiperiodic Languages. Search on Bibsonomy DCFS The full citation details ... 2006 DBLP  BibTeX  RDF
1Franziska Biegler, Michael J. Burrell, Mark Daley Regulated RNA rewriting: modelling RNA editing with guided insertion. Search on Bibsonomy DCFS The full citation details ... 2006 DBLP  BibTeX  RDF
1Haiming Chen, Mihai Ionescu, Andrei Paun, Gheorghe Paun, Bianca Popa On Trace Languages Generated by (Small) Spiking Neural P Systems. Search on Bibsonomy DCFS The full citation details ... 2006 DBLP  BibTeX  RDF
1Brian Cloteaux, Desh Ranjan Some Separation Results Between Classes of Pointer Algorithms. Search on Bibsonomy DCFS The full citation details ... 2006 DBLP  BibTeX  RDF
1Joachim Kupke A Powerful Tool in Lower-Bounding Constantly Ambiguous Automata. Search on Bibsonomy DCFS The full citation details ... 2006 DBLP  BibTeX  RDF
1Rudolf Freund, Marion Oswald A Small Universal Antiport P System with Forbidden Context. Search on Bibsonomy DCFS The full citation details ... 2006 DBLP  BibTeX  RDF
1Marco Almeida, Nelma Moreira, Rogério Reis Aspects of Enumeration and Generation with a String Automata Representation. Search on Bibsonomy DCFS The full citation details ... 2006 DBLP  BibTeX  RDF
1Markus Holzer 0001, Martin Kutrib The Size of Higman-Haines Sets. Search on Bibsonomy DCFS The full citation details ... 2006 DBLP  BibTeX  RDF
1Hermann Gruber, Markus Holzer 0001 Results on the Average State and Transition Complexity of Finite Automata Accepting Finite Languages (Extended Abstract). Search on Bibsonomy DCFS The full citation details ... 2006 DBLP  BibTeX  RDF
1Brendan J. Cordy, Kai Salomaa Regular Approximations of Non-Regular Languages. Search on Bibsonomy DCFS The full citation details ... 2006 DBLP  BibTeX  RDF
1Yo-Sub Han, Kai Salomaa, Derick Wood State Complexity of Prefix-Free Regular Languages. Search on Bibsonomy DCFS The full citation details ... 2006 DBLP  BibTeX  RDF
1Piotr Faliszewski, Lane A. Hemaspaandra The Consequences of Eliminating NP Solutions. Search on Bibsonomy DCFS The full citation details ... 2006 DBLP  BibTeX  RDF
1Alessandra Cherubini, Andrzej Kisielewicz 0001 Recognizing Collapsing Words is co-NP-Complete. Search on Bibsonomy DCFS The full citation details ... 2006 DBLP  BibTeX  RDF
1Jürgen Dassow, György Vaszil On the Number of Active Symbols in Lindenmayer Systems. Search on Bibsonomy DCFS The full citation details ... 2006 DBLP  BibTeX  RDF
1Michael Domaratzki, Kai Salomaa Transition Complexity of Language Operations. Search on Bibsonomy DCFS The full citation details ... 2006 DBLP  BibTeX  RDF
1Vinod Chirayath, Luc Longpré Measuring privacy loss in statistical databases. Search on Bibsonomy DCFS The full citation details ... 2006 DBLP  BibTeX  RDF
1Hing Leung, Giovanni Pighizzini (eds.) 8th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2006, Las Cruces, New Mexico, USA, June 21 - 23, 2006. Proceedings Search on Bibsonomy DCFS The full citation details ... 2006 DBLP  BibTeX  RDF
1Yuan Gao 0001, Kai Salomaa, Sheng Yu 0001 State Complexity of Catenation and Reversal Combined with Star. Search on Bibsonomy DCFS The full citation details ... 2006 DBLP  BibTeX  RDF
1Cezar Câmpeanu, Andrei Paun, Jason R. Smith 0002 Tight Bounds for the State Complexity of Deterministic Cover Automata. Search on Bibsonomy DCFS The full citation details ... 2006 DBLP  BibTeX  RDF
1Tanbir Ahmed, Gösta Grahne Parallel Composition of Finite State Activity Automata. Search on Bibsonomy DCFS The full citation details ... 2006 DBLP  BibTeX  RDF
1Frank Nießner, Ulrich Ultes-Nitsche A Complete Characterization of Deterministic Regular Liveness Properties. Search on Bibsonomy DCFS The full citation details ... 2006 DBLP  BibTeX  RDF
1Galina Jirásková, Alexander Okhotin State complexity of cyclic shift. Search on Bibsonomy DCFS The full citation details ... 2005 DBLP  BibTeX  RDF
1Henning Bordihn, Henning Fernau The degree of parallelism. Search on Bibsonomy DCFS The full citation details ... 2005 DBLP  BibTeX  RDF
1Carlo Mereghetti, Beatrice Palano, Giovanni Pighizzini, Detlef Wotschke (eds.) 7th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2005, Como, Italy, June 30 - July 2, 2005. Proceedings Search on Bibsonomy DCFS The full citation details ... 2005 DBLP  BibTeX  RDF
1Lila Kari, Petr Sosík On Weight of Universal Insertion Grammars. Search on Bibsonomy DCFS The full citation details ... 2005 DBLP  BibTeX  RDF
Displaying result #301 - #400 of 519 (100 per page; Change: )
Pages: [<<][1][2][3][4][5][6][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license