default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 200 matches
- 2023
- Giovanni Pighizzini, Luca Prigioniero:
Forgetting 1-Limited Automata. NCMA 2023: 95-109 - Eric Andersson, Johanna Björklund, Frank Drewes, Anna Jonsson:
Generating Semantic Graph Corpora with Graph Expansion Grammar. NCMA 2023: 3-15 - Martin Berglund, Brink van der Merwe:
Formalizing BPE Tokenization. NCMA 2023: 16-27 - Martin Kutrib, Uwe Meyer:
Deterministic Real-Time Tree-Walking-Storage Automata. NCMA 2023: 48-62 - Brink van der Merwe:
Ordered Context-Free Grammars Revisited. NCMA 2023: 140-153 - Ömer Egecioglu, Benedek Nagy:
On Languages Generated by Signed Grammars. NCMA 2023: 28-37 - Tomás Kozár, Zbynek Krivka, Alexander Meduna:
Final Sentential Forms. NCMA 2023: 38-47 - Carlo Mereghetti, Beatrice Palano, Priscilla Raucci:
Latvian Quantum Finite State Automata for Unary Languages. NCMA 2023: 63-78 - Richard Mörbitz:
Constituency Parsing as an Instance of the M-monoid Parsing Problem. NCMA 2023: 79-94 - Maria Radionova, Alexander Okhotin:
Sweeping Permutation Automata. NCMA 2023: 110-124 - Bianca Truthe:
Merging two Hierarchies of Internal Contextual Grammars with Subregular Selection. NCMA 2023: 125-139 - Benedek Nagy, Rudolf Freund:
Proceedings of the 13th International Workshop on Non-Classical Models of Automata and Applications, NCMA 2023, Famagusta, North Cyprus, 18th-19th September, 2023. EPTCS 388, 2023 [contents] - 2022
- Martin Kutrib, Andreas Malcher:
Reversible Computations of One-Way Counter Automata. NCMA 2022: 126-142 - Maria Kosche, Tore Koß, Florin Manea, Stefan Siemer:
Combinatorial Algorithms for Subsequence Matching: A Survey. NCMA 2022: 11-27 - Artiom Alhazov, Rudolf Freund, Sergiu Ivanov:
P versus B: P Systems as a Formal Framework for Controllability of Boolean Networks. NCMA 2022: 28-48 - Samira Attou, Ludovic Mignot, Clément Miklarz, Florent Nicart:
Monadic Expressions and their Derivatives. NCMA 2022: 49-64 - Jürgen Dassow, Bianca Truthe:
On the Generative Capacity of Contextual Grammars with Strictly Locally Testable Selection Languages. NCMA 2022: 65-80 - Pál Dömösi, Adama Diene:
A Finite-Automaton Based Stream Cipher As a Quasigroup Based Cipher. NCMA 2022: 81-87 - Dominika Klobucníková, Zbynek Krivka, Alexander Meduna:
Conclusive Tree-Controlled Grammars. NCMA 2022: 112-125 - Frantisek Mráz, Friedrich Otto:
Non-Returning Finite Automata With Translucent Letters. NCMA 2022: 143-159 - Benedek Nagy:
Quasi-deterministic 5' -> 3' Watson-Crick Automata. NCMA 2022: 160-176 - Christian Rauch, Markus Holzer:
On the Accepting State Complexity of Operations on Permutation Automata. NCMA 2022: 177-189 - Jan Hammer, Zbynek Krivka:
Practical Aspects of Membership Problem of Watson-Crick Context-free Grammars. NCMA 2022: 88-111 - Gyula Klima:
Language and Intelligence, Artificial vs. Natural or What Can and What Cannot AI Do with NL? NCMA 2022: 1-10 - Henning Bordihn, Géza Horváth, György Vaszil:
Proceedings 12th International Workshop on Non-Classical Models of Automata and Applications, NCMA 2022, Debrecen, Hungary, August 26-27, 2022. EPTCS 367, 2022 [contents] - 2019
- Markus Holzer, Sebastian Jakobi:
A comment on strong language families and self-verifying complexity classes. NCMA 2019: 93-108 - Artiom Alhazov, Rudolf Freund, Sergiu Ivanov:
Register machines over groups. NCMA 2019: 31-46 - Samira Attou, Ludovic Mignot, Djelloul Ziadi:
Extended tree expressions and their derivatives. NCMA 2019: 47-62 - Jens Bruchertseifer, Henning Fernau:
Synchronizing series-parallel automata with loops. NCMA 2019: 63-78 - Rudolf Freund, Ludwig Staiger:
Turing machines with activations of transitions. NCMA 2019: 79-91
skipping 170 more matches
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-10-18 19:00 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint