The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

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

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

Publication years (Num. hits)
2009 (18) 2010-2011 (29) 2012 (16) 2013 (17) 2014 (17) 2015-2016 (33) 2017 (17) 2018-2019 (28) 2022-2023 (25)
Publication types (Num. hits)
inproceedings(187) proceedings(13)
Venues (Conferences, Journals, ...)
NCMA(200)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
No Growbag Graphs found.

Results
Found 200 publication records. Showing 200 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Martin Kutrib, Uwe Meyer 0003 Deterministic Real-Time Tree-Walking-Storage Automata. Search on Bibsonomy NCMA The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Maria Radionova, Alexander Okhotin Sweeping Permutation Automata. Search on Bibsonomy NCMA The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Martin Berglund, Brink van der Merwe Formalizing BPE Tokenization. Search on Bibsonomy NCMA The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Carlo Mereghetti, Beatrice Palano, Priscilla Raucci Latvian Quantum Finite State Automata for Unary Languages. Search on Bibsonomy NCMA The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Tomás Kozár, Zbynek Krivka, Alexander Meduna Final Sentential Forms. Search on Bibsonomy NCMA The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Benedek Nagy, Rudolf Freund (eds.) Proceedings of the 13th International Workshop on Non-Classical Models of Automata and Applications, NCMA 2023, Famagusta, North Cyprus, 18th-19th September, 2023. Search on Bibsonomy NCMA The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Richard Mörbitz Constituency Parsing as an Instance of the M-monoid Parsing Problem. Search on Bibsonomy NCMA The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Ömer Egecioglu, Benedek Nagy On Languages Generated by Signed Grammars. Search on Bibsonomy NCMA The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Bianca Truthe Merging two Hierarchies of Internal Contextual Grammars with Subregular Selection. Search on Bibsonomy NCMA The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Giovanni Pighizzini, Luca Prigioniero Forgetting 1-Limited Automata. Search on Bibsonomy NCMA The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Brink van der Merwe Ordered Context-Free Grammars Revisited. Search on Bibsonomy NCMA The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Eric Andersson, Johanna Björklund, Frank Drewes, Anna Jonsson Generating Semantic Graph Corpora with Graph Expansion Grammar. Search on Bibsonomy NCMA The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Pál Dömösi, Adama Diene A Finite-Automaton Based Stream Cipher As a Quasigroup Based Cipher. Search on Bibsonomy NCMA The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Jürgen Dassow, Bianca Truthe On the Generative Capacity of Contextual Grammars with Strictly Locally Testable Selection Languages. Search on Bibsonomy NCMA The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Henning Bordihn, Géza Horváth, György Vaszil (eds.) Proceedings 12th International Workshop on Non-Classical Models of Automata and Applications, NCMA 2022, Debrecen, Hungary, August 26-27, 2022. Search on Bibsonomy NCMA The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Jan Hammer, Zbynek Krivka Practical Aspects of Membership Problem of Watson-Crick Context-free Grammars. Search on Bibsonomy NCMA The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Samira Attou, Ludovic Mignot, Clément Miklarz, Florent Nicart Monadic Expressions and their Derivatives. Search on Bibsonomy NCMA The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Maria Kosche, Tore Koß, Florin Manea, Stefan Siemer Combinatorial Algorithms for Subsequence Matching: A Survey. Search on Bibsonomy NCMA The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Martin Kutrib, Andreas Malcher Reversible Computations of One-Way Counter Automata. Search on Bibsonomy NCMA The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Artiom Alhazov, Rudolf Freund, Sergiu Ivanov 0001 P versus B: P Systems as a Formal Framework for Controllability of Boolean Networks. Search on Bibsonomy NCMA The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Gyula Klima Language and Intelligence, Artificial vs. Natural or What Can and What Cannot AI Do with NL? Search on Bibsonomy NCMA The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Christian Rauch 0001, Markus Holzer 0001 On the Accepting State Complexity of Operations on Permutation Automata. Search on Bibsonomy NCMA The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Dominika Klobucníková, Zbynek Krivka, Alexander Meduna Conclusive Tree-Controlled Grammars. Search on Bibsonomy NCMA The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Frantisek Mráz, Friedrich Otto Non-Returning Finite Automata With Translucent Letters. Search on Bibsonomy NCMA The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Benedek Nagy Quasi-deterministic 5' -> 3' Watson-Crick Automata. Search on Bibsonomy NCMA The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Markus Holzer 0001, Sebastian Jakobi A comment on strong language families and self-verifying complexity classes. Search on Bibsonomy NCMA The full citation details ... 2019 DBLP  BibTeX  RDF
1Igor T. Podolak, Adam Roman, Arkadiusz Czekajski, Damian Lesniak, Bartosz Zielinski 0001 Variational auto-encoders for generating feature-preserving automata. Search on Bibsonomy NCMA The full citation details ... 2019 DBLP  BibTeX  RDF
1Rudolf Freund, Markus Holzer 0001, José M. Sempere (eds.) Eleventh Workshop on Non-Classical Models of Automata and Applications, NCMA 2019, Valencia, Spain, July 2-3, 2019. Search on Bibsonomy NCMA The full citation details ... 2019 DBLP  BibTeX  RDF
1Rudolf Freund, Ludwig Staiger Turing machines with activations of transitions. Search on Bibsonomy NCMA The full citation details ... 2019 DBLP  BibTeX  RDF
1Peter Leupold Computing by observing reductions in partial orders. Search on Bibsonomy NCMA The full citation details ... 2019 DBLP  BibTeX  RDF
1Victor Mitrana DNA self-assembly by hairpin (extended abstract). Search on Bibsonomy NCMA The full citation details ... 2019 DBLP  BibTeX  RDF
1Jens Bruchertseifer, Henning Fernau Synchronizing series-parallel automata with loops. Search on Bibsonomy NCMA The full citation details ... 2019 DBLP  BibTeX  RDF
1Benedek Nagy, Zita Kovács On simple 5' → 3' sensing Watson-Crick finite-state transducers. Search on Bibsonomy NCMA The full citation details ... 2019 DBLP  BibTeX  RDF
1Artiom Alhazov, Rudolf Freund, Sergiu Ivanov 0001 Register machines over groups. Search on Bibsonomy NCMA The full citation details ... 2019 DBLP  BibTeX  RDF
1Samira Attou, Ludovic Mignot, Djelloul Ziadi Extended tree expressions and their derivatives. Search on Bibsonomy NCMA The full citation details ... 2019 DBLP  BibTeX  RDF
1Frantisek Mráz, Friedrich Otto Window size two suffices for deterministic monotone RWW-automata. Search on Bibsonomy NCMA The full citation details ... 2019 DBLP  BibTeX  RDF
1Agustín Riscos-Núñez Complexity classes in membrane computing: P-conjecture and related issues. Search on Bibsonomy NCMA The full citation details ... 2019 DBLP  BibTeX  RDF
1Martin Kutrib, Andreas Malcher Digging input-driven pushdown automata. Search on Bibsonomy NCMA The full citation details ... 2019 DBLP  BibTeX  RDF
1Bianca Truthe Accepting networks of evolutionary processors with resources restricted filters. Search on Bibsonomy NCMA The full citation details ... 2019 DBLP  BibTeX  RDF
1Martin Berglund, Frank Drewes, Brink van der Merwe On regular expressions with backreferences and transducers. Search on Bibsonomy NCMA The full citation details ... 2018 DBLP  BibTeX  RDF
1Frantisek Mráz, Friedrich Otto, Martin Plátek Characterizations of LRR-languages by correctness-preserving computations. Search on Bibsonomy NCMA The full citation details ... 2018 DBLP  BibTeX  RDF
1Pablo Arrighi, Clément Chouteau, Stefano Facchini, Simon Martiel Causal dynamics of discrete manifolds. Search on Bibsonomy NCMA The full citation details ... 2018 DBLP  BibTeX  RDF
1Ondrej Klíma 0001, Libor Polák Forbidden patterns for ordered automata. Search on Bibsonomy NCMA The full citation details ... 2018 DBLP  BibTeX  RDF
1José M. Sempere On the application of Watson-Crick finite automata for the resolution of bioinformatic problems. Search on Bibsonomy NCMA The full citation details ... 2018 DBLP  BibTeX  RDF
1Markus Holzer 0001, Martin Kutrib Automata that may change their mind. Search on Bibsonomy NCMA The full citation details ... 2018 DBLP  BibTeX  RDF
1Bruno Guillon On nondeterministic two-way transducers. Search on Bibsonomy NCMA The full citation details ... 2018 DBLP  BibTeX  RDF
1Radim Kocman, Benedek Nagy, Zbynek Krivka, Alexander Meduna A jumping 5' → 3' Watson-Crick finite automata model. Search on Bibsonomy NCMA The full citation details ... 2018 DBLP  BibTeX  RDF
1Rudolf Freund, Michal Hospodár, Galina Jirásková, Giovanni Pighizzini (eds.) Tenth Workshop on Non-Classical Models of Automata and Applications, NCMA 2018, Košice, Slovakia, August 21-22, 2018. Search on Bibsonomy NCMA The full citation details ... 2018 DBLP  BibTeX  RDF
1Maksims Dimitrijevs, Abuzer Yakaryilmaz Postselecting probabilistic finite state recognizers and verifiers. Search on Bibsonomy NCMA The full citation details ... 2018 DBLP  BibTeX  RDF
1Qichao Wang, Yongming Li 0001 Jumping restarting automata. Search on Bibsonomy NCMA The full citation details ... 2018 DBLP  BibTeX  RDF
1Tomoyuki Yamakami One-way topological automata and the tantalizing effects of their topological features. Search on Bibsonomy NCMA The full citation details ... 2018 DBLP  BibTeX  RDF
1Martin Kutrib, Friedrich Otto Two-sided locally testable languages. Search on Bibsonomy NCMA The full citation details ... 2018 DBLP  BibTeX  RDF
1Bianca Truthe Networks of evolutionary processors with resources restricted filters. Search on Bibsonomy NCMA The full citation details ... 2018 DBLP  BibTeX  RDF
1Tomoyuki Yamakami A recursive definition of quantum polynomial time computability (extended abstract). Search on Bibsonomy NCMA The full citation details ... 2017 DBLP  BibTeX  RDF
1Martin Plátek, Karel Oliva, Dana Pardubská Analysis by reduction of analytical PDT-trees. Search on Bibsonomy NCMA The full citation details ... 2017 DBLP  BibTeX  RDF
1Dávid Angyal, Benedek Nagy An extension of the LR parsing algorithm for two-head pushdown automata. Search on Bibsonomy NCMA The full citation details ... 2017 DBLP  BibTeX  RDF
1Friedrich Otto On shrinking restarting automata. Search on Bibsonomy NCMA The full citation details ... 2017 DBLP  BibTeX  RDF
1Markus Holzer 0001, Martin Kutrib, Friedrich Otto Two-sided strictly locally testable languages. Search on Bibsonomy NCMA The full citation details ... 2017 DBLP  BibTeX  RDF
1Henning Fernau, Meenakshi Paramasivan, D. Gnanaraj Thomas Regular grammars for array languages. Search on Bibsonomy NCMA The full citation details ... 2017 DBLP  BibTeX  RDF
1Bianca Truthe Hierarchies of language families of contextual grammars. Search on Bibsonomy NCMA The full citation details ... 2017 DBLP  BibTeX  RDF
1Galina Jirásková, Matús Palmovský Star-complement-star and Kuratowski algebras on prefix-free languages. Search on Bibsonomy NCMA The full citation details ... 2017 DBLP  BibTeX  RDF
1Rudolf Freund, Frantisek Mráz, Daniel Prusa (eds.) Ninth Workshop on Non-Classical Models of Automata and Applications, NCMA 2017, Prague, Czech Republic, August 17-18, 2017. Search on Bibsonomy NCMA The full citation details ... 2017 DBLP  BibTeX  RDF
1Michal Ajdarów Minimality problems for promise versions of finite automata. Search on Bibsonomy NCMA The full citation details ... 2017 DBLP  BibTeX  RDF
1Qichao Wang On the expressive power of weighted restarting automata. Search on Bibsonomy NCMA The full citation details ... 2017 DBLP  BibTeX  RDF
1Jirí Wiedermann, Jan van Leeuwen Non-classical Turing machines: extending the notion of computation. Search on Bibsonomy NCMA The full citation details ... 2017 DBLP  BibTeX  RDF
1Andreas Malcher Decidability questions for insertion systems. Search on Bibsonomy NCMA The full citation details ... 2017 DBLP  BibTeX  RDF
1Cezar Câmpeanu State complexity of distinguishability combined with union operation. Search on Bibsonomy NCMA The full citation details ... 2017 DBLP  BibTeX  RDF
1Sandra Alves, Sabine Broda Inhabitation machines: determinism and principality. Search on Bibsonomy NCMA The full citation details ... 2017 DBLP  BibTeX  RDF
1Giovanni Pighizzini, Luca Prigioniero Non-self-embedding grammars and descriptional complexity. Search on Bibsonomy NCMA The full citation details ... 2017 DBLP  BibTeX  RDF
1Henning Fernau, Martin Kutrib, Matthias Wendlandt Self-verifying pushdown automata. Search on Bibsonomy NCMA The full citation details ... 2017 DBLP  BibTeX  RDF
1Friedrich Otto, Frantisek Mráz Cyclically extended variants of Sgraffito and restarting automata for picture languages. Search on Bibsonomy NCMA The full citation details ... 2016 DBLP  BibTeX  RDF
1Igor Potapov Pattern formations with broadcasting automata model. Search on Bibsonomy NCMA The full citation details ... 2016 DBLP  BibTeX  RDF
1Maksims Dimitrijevs, Abuzer Yakaryilmaz Uncountable classical and quantum complexity classes. Search on Bibsonomy NCMA The full citation details ... 2016 DBLP  BibTeX  RDF
1Martin Kutrib, Matthias Wendlandt Expressive capacity of subregular expressions. Search on Bibsonomy NCMA The full citation details ... 2016 DBLP  BibTeX  RDF
1Kristína Cevorová Square on closed languages. Search on Bibsonomy NCMA The full citation details ... 2016 DBLP  BibTeX  RDF
1Stefan Popescu Networks of polarized evolutionary processors with elementary polarization of symbols. Search on Bibsonomy NCMA The full citation details ... 2016 DBLP  BibTeX  RDF
1Michal Hospodár, Galina Jirásková Concatenation on deterministic and alternating automata. Search on Bibsonomy NCMA The full citation details ... 2016 DBLP  BibTeX  RDF
1Özlem Salehi, Flavio D'Alessandro, A. C. Cem Say Language classes associated with automata over matrix groups. Search on Bibsonomy NCMA The full citation details ... 2016 DBLP  BibTeX  RDF
1Hae-Sung Eom, Matús Palmovský Combined operations on prefix-free and suffix-free languages. Search on Bibsonomy NCMA The full citation details ... 2016 DBLP  BibTeX  RDF
1Wan Heng Fong, Markus Holzer 0001, Bianca Truthe, Sherzod Turaev, Ahmad Firdaus Yosman On bonded sequential and parallel insertion systems. Search on Bibsonomy NCMA The full citation details ... 2016 DBLP  BibTeX  RDF
1Kaspars Balodis, Maksims Dimitrijevs, Abuzer Yakaryilmaz Two-way frequency finite automata. Search on Bibsonomy NCMA The full citation details ... 2016 DBLP  BibTeX  RDF
1Zoltán Fülöp 0001 Weighted tree automata and their characterization by logic - a summary. Search on Bibsonomy NCMA The full citation details ... 2016 DBLP  BibTeX  RDF
1Radim Kocman, Zbynek Krivka, Alexander Meduna On double-jumping finite automata. Search on Bibsonomy NCMA The full citation details ... 2016 DBLP  BibTeX  RDF
1Simon Beier, Martin Kutrib, Andreas Malcher, Matthias Wendlandt Diving into the queue. Search on Bibsonomy NCMA The full citation details ... 2016 DBLP  BibTeX  RDF
1Grzegorz Madejski Regular and linear permutation languages. Search on Bibsonomy NCMA The full citation details ... 2016 DBLP  BibTeX  RDF
1Stavros Konstantinidis, Nelma Moreira, Rogério Reis Generating error control codes with automata and transducers. Search on Bibsonomy NCMA The full citation details ... 2016 DBLP  BibTeX  RDF
1Cezar Câmpeanu, Nelma Moreira, Rogério Reis On the dissimilarity operation on finite languages. Search on Bibsonomy NCMA The full citation details ... 2016 DBLP  BibTeX  RDF
1Rudolf Freund P Automata: New ideas and results. Search on Bibsonomy NCMA The full citation details ... 2016 DBLP  BibTeX  RDF
1Henning Bordihn, Rudolf Freund, Benedek Nagy, György Vaszil (eds.) Eighth Workshop on Non-Classical Models of Automata and Applications, NCMA 2016, Debrecen, Hungary, August 29-30, 2016. Proceedings Search on Bibsonomy NCMA The full citation details ... 2016 DBLP  BibTeX  RDF
1Victor Mitrana Networks of picture processors. Search on Bibsonomy NCMA The full citation details ... 2016 DBLP  BibTeX  RDF
1Suna Bensch, Frank Drewes, Thomas Hellström Grammatical inference of graph transformation rules. Search on Bibsonomy NCMA The full citation details ... 2015 DBLP  BibTeX  RDF
1Frantisek Mráz, Friedrich Otto, Daniel Prusa On a class of rational functions for pictures. Search on Bibsonomy NCMA The full citation details ... 2015 DBLP  BibTeX  RDF
1Sylvain Lombardy Weighted two-way automata. Search on Bibsonomy NCMA The full citation details ... 2015 DBLP  BibTeX  RDF
1Peter Kostolányi A pumping lemma for flip-pushdown languages. Search on Bibsonomy NCMA The full citation details ... 2015 DBLP  BibTeX  RDF
1Martin Kutrib, Andreas Malcher, Matthias Wendlandt When input-driven pushdown automata meet reversibility. Search on Bibsonomy NCMA The full citation details ... 2015 DBLP  BibTeX  RDF
1Özlem Salehi, A. C. Cem Say Homing vector automata. Search on Bibsonomy NCMA The full citation details ... 2015 DBLP  BibTeX  RDF
1Rudolf Freund, Markus Holzer 0001, Nelma Moreira, Rogério Reis (eds.) Seventh Workshop on Non-Classical Models of Automata and Applications - NCMA 2015, Porto, Portugal, August 31 - September 1, 2015. Proceedings Search on Bibsonomy NCMA The full citation details ... 2015 DBLP  BibTeX  RDF
1Emanuele Rodaro New reformulations of Cerny's conjecture and related problems. Search on Bibsonomy NCMA The full citation details ... 2015 DBLP  BibTeX  RDF
1Dávid Angyal, Benedek Nagy On language families generated by controlled grammars. Search on Bibsonomy NCMA The full citation details ... 2015 DBLP  BibTeX  RDF
1Bruno Guillon Sweeping weakens two-way transducers even with a unary output alphabet. Search on Bibsonomy NCMA The full citation details ... 2015 DBLP  BibTeX  RDF
Displaying result #1 - #100 of 200 (100 per page; Change: )
Pages: [1][2][>>]
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