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 31 matches
- 2022
- Radim Kocman, Zbynek Krivka, Alexander Meduna, Benedek Nagy:
A jumping $5'\rightarrow 3'$ Watson-Crick finite automata model. Acta Informatica 59(5): 557-584 (2022) - Ujjwal Kumar Mishra, Kalpana Mahalingam, Raghavan Rama:
Watson-Crick Jumping Finite Automata: Combination, Comparison and Closure. Comput. J. 65(5): 1178-1188 (2022) - Simon Beier, Markus Holzer:
Nondeterministic right one-way jumping finite automata. Inf. Comput. 284: 104687 (2022) - 2021
- Ujjwal Kumar Mishra, Kalpana Mahalingam, Rama Raghavan:
Generalized Linear One-Way Jumping Finite Automata. CoRR abs/2106.02937 (2021) - Ujjwal Kumar Mishra, Kalpana Mahalingam, Rama Raghavan:
Generalized Circular One-Way Jumping Finite Automata. CoRR abs/2106.03852 (2021) - 2020
- Simon Beier:
New results on semilinear sets and variants of jumping finite automata. University of Gießen, Germany, Logos Verlag Berlin 2020, ISBN 978-3-8325-5210-7, pp. 1-232 - Simon Beier, Markus Holzer:
Decidability of Right One-Way Jumping Finite Automata. Int. J. Found. Comput. Sci. 31(6): 805-825 (2020) - Grzegorz Madejski, Andrzej Szepietowski:
Membership Problem for Two-Dimensional General Row Jumping Finite Automata. Int. J. Found. Comput. Sci. 31(4): 527-538 (2020) - Kalpana Mahalingam, Ujjwal Kumar Mishra, Rama Raghavan:
Watson-Crick Jumping Finite Automata. Int. J. Found. Comput. Sci. 31(7): 891-913 (2020) - 2019
- Simon Beier, Markus Holzer, Martin Kutrib:
Operational State Complexity and Decidability of Jumping Finite Automata. Int. J. Found. Comput. Sci. 30(1): 5-27 (2019) - Simon Beier, Markus Holzer:
Properties of right one-way jumping finite automata. Theor. Comput. Sci. 798: 78-94 (2019) - Simon Beier, Markus Holzer:
Nondeterministic Right One-Way Jumping Finite Automata (Extended Abstract). DCFS 2019: 74-85 - Pavel Martinek:
Jumping Fuzzy General Finite Automata and Their Simplified Description. FSDM 2019: 667-672 - Kalpana Mahalingam, Rama Raghavan, Ujjwal Kumar Mishra:
Watson-Crick Jumping Finite Automata. TAMC 2019: 467-480 - Simon Beier, Markus Holzer:
Semi-linear Lattices and Right One-Way Jumping Finite Automata (Extended Abstract). CIAA 2019: 70-82 - 2018
- Vojtech Vorel:
On Basic Properties of Jumping Finite Automata. Int. J. Found. Comput. Sci. 29(1): 1-16 (2018) - Radim Kocman, Zbynek Krivka, Alexander Meduna:
On double-jumping finite automata and their closure properties. RAIRO Theor. Informatics Appl. 52(2-3-4): 185-199 (2018) - Simon Beier, Markus Holzer:
Properties of Right One-Way Jumping Finite Automata. DCFS 2018: 11-23 - Simon Beier, Markus Holzer:
Decidability of Right One-Way Jumping Finite Automata. DLT 2018: 109-120 - Pavel Martinek:
Jumping Fuzzy Finite Automata and Their Languages. FSDM 2018: 196-201 - Radim Kocman, Benedek Nagy, Zbynek Krivka, Alexander Meduna:
A jumping 5' → 3' Watson-Crick finite automata model. NCMA 2018: 117-132 - 2017
- S. James Immanuel, D. Gnanaraj Thomas:
Two-dimensional double jumping finite automata. Int. J. Artif. Intell. Soft Comput. 6(3): 250-264 (2017) - Henning Fernau, Meenakshi Paramasivan, Markus L. Schmid, Vojtech Vorel:
Characterization and complexity results on jumping finite automata. Theor. Comput. Sci. 679: 31-52 (2017) - Simon Beier, Markus Holzer, Martin Kutrib:
Operational State Complexity and Decidability of Jumping Finite Automata. DLT 2017: 96-108 - 2016
- Hiroyuki Chigahara, Szilárd Zsolt Fazekas, Akihiro Yamamura:
One-Way Jumping Finite Automata. Int. J. Found. Comput. Sci. 27(3): 391- (2016) - Radim Kocman, Zbynek Krivka, Alexander Meduna:
On double-jumping finite automata. NCMA 2016: 195-210 - 2015
- S. James Immanuel, D. Gnanaraj Thomas:
Extension of Jumping Finite Automata to Two-Dimensional Languages. IWCIA (Special Track on Applications) 2015: 1-16 - Henning Fernau, Meenakshi Paramasivan, Markus L. Schmid:
Jumping Finite Automata: Characterizations and Complexity. CIAA 2015: 89-101 - Henning Fernau, Meenakshi Paramasivan, Markus L. Schmid, Vojtech Vorel:
Characterization and Complexity Results on Jumping Finite Automata. CoRR abs/1512.00482 (2015) - Vojtech Vorel:
On Basic Properties of Jumping Finite Automata. CoRR abs/1511.08396 (2015)
skipping 1 more match
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-12 10:46 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