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
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 585 matches
- 2024
- Yuan Feng, José Antonio Abell Mena, Han Yang, Hexiang Wang, Boris Jeremic:
Domain specific language for finite element modeling and simulation. Adv. Eng. Softw. 193: 103666 (2024) - Dmitry A. Ammosov, N. V. Malysheva, Liudmila S. Zamorshchikova:
Generalized multiscale finite element method for language competition modeling I: Offline approach. J. Comput. Appl. Math. 442: 115731 (2024) - Dmitry A. Ammosov, N. V. Malysheva, Liudmila S. Zamorshchikova:
Generalized multiscale finite element method for language competition modeling II: Online approach. J. Comput. Appl. Math. 442: 115732 (2024) - Karel Klouda, Stepán Starosta:
The number of primitive words of unbounded exponent in the language of an HD0L-system is finite. J. Comb. Theory, Ser. A 206: 105904 (2024) - Yiyou Sun, Junjie Hu, Wei Cheng, Haifeng Chen:
DFA-RAG: Conversational Semantic Router for Large Language Model with Definite Finite Automaton. ICML 2024 - Yoshito Kawasaki, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara:
Query Learning of Minimal Deterministic Symbolic Finite Automata Separating Regular Languages. SOFSEM 2024: 340-354 - Abdullah Al Ishtiaq, Sarkar Snigdha Sarathi Das, Syed Md. Mukit Rashid, Ali Ranjbar, Kai Tu, Tianwei Wu, Zhezheng Song, Weixuan Wang, Mujtahid Akon, Rui Zhang, Syed Rafiul Hussain:
Hermes: Unlocking Security Analysis of Cellular Network Protocols by Synthesizing Finite State Machines from Natural Language Specifications. USENIX Security Symposium 2024 - Yiyou Sun, Junjie Hu, Wei Cheng, Haifeng Chen:
Chatbot Meets Pipeline: Augment Large Language Model with Definite Finite Automaton. CoRR abs/2402.04411 (2024) - Nicolas Heurtel:
A Complete Graphical Language for Linear Optical Circuits with Finite-Photon-Number Sources and Detectors. CoRR abs/2402.17693 (2024) - Weizhi Tang, Vaishak Belle:
Zero, Finite, and Infinite Belief History of Theory of Mind Reasoning in Large Language Models. CoRR abs/2406.04800 (2024) - Andrea Benso, Flavio D'Alessandro, Paolo Papi:
Quantum automata and languages of finite index. CoRR abs/2406.13797 (2024) - Seung-Yeop Baik, Sicheol Sung, Yo-Sub Han:
A Framework for Quantum Finite-State Languages with Density Mapping. CoRR abs/2407.02776 (2024) - 2023
- Dmitry A. Ammosov, Aleksander V. Grigorev, Sergei P. Stepanov, N. V. Malysheva, Liudmila S. Zamorshchikova:
Numerical simulation of language interactions using online coupled Generalized Multiscale Finite Element Method. J. Comput. Appl. Math. 423: 114962 (2023) - Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano:
Iterated uniform finite-state transducers on unary languages. Theor. Comput. Sci. 969: 114049 (2023) - Martin Kutrib, Matthias Wendlandt:
State complexity of finite partial languages. Theor. Comput. Sci. 966-967: 114001 (2023) - Yong Li, Sven Schewe, Qiyi Tang:
A Novel Family of Finite Automata for Recognizing and Learning ømega-Regular Languages. ATVA (1) 2023: 53-73 - Arya McCarthy, Hao Zhang, Shankar Kumar, Felix Stahlberg, Ke Wu:
Long-Form Speech Translation through Segmentation with Finite-State Decoding Constraints on Large Language Models. EMNLP (Findings) 2023: 247-257 - Anej Svete, Ryan Cotterell:
Recurrent Neural Language Models as Probabilistic Finite-state Automata. EMNLP 2023: 8069-8086 - Wojciech Czerwinski, Maciej Debski, Tomasz Gogasz, Gordon Hoi, Sanjay Jain, Michal Skrzypczak, Frank Stephan, Christopher Tan:
Languages Given by Finite Automata over the Unary Alphabet. FSTTCS 2023: 22:1-22:20 - Daniel Alexander Spenner:
Decomposing Finite Languages. MFCS 2023: 83:1-83:14 - Carlo Mereghetti, Beatrice Palano, Priscilla Raucci:
Latvian Quantum Finite State Automata for Unary Languages. NCMA 2023: 63-78 - Gordon Hoi, Sanjay Jain, Frank Stephan, Christopher Tan:
Languages given by Finite Automata over the Unary Alphabet. CoRR abs/2302.06435 (2023) - Daniel Alexander Spenner:
Decomposing Finite Languages. CoRR abs/2307.06802 (2023) - Yong Li, Sven Schewe, Qiyi Tang:
A novel family of finite automata for recognizing and learning ω-regular languages. CoRR abs/2307.07490 (2023) - Abdullah Al Ishtiaq, Sarkar Snigdha Sarathi Das, Syed Md. Mukit Rashid, Ali Ranjbar, Kai Tu, Tianwei Wu, Zhezheng Song, Weixuan Wang, Mujtahid Akon, Rui Zhang, Syed Rafiul Hussain:
Hermes: Unlocking Security Analysis of Cellular Network Protocols by Synthesizing Finite State Machines from Natural Language Specifications. CoRR abs/2310.04381 (2023) - Anej Svete, Ryan Cotterell:
Recurrent Neural Language Models as Probabilistic Finite-state Automata. CoRR abs/2310.05161 (2023) - Arya D. McCarthy, Hao Zhang, Shankar Kumar, Felix Stahlberg, Ke Wu:
Long-Form Speech Translation through Segmentation with Finite-State Decoding Constraints on Large Language Models. CoRR abs/2310.13678 (2023) - 2022
- Tomasz Jastrzab, Zbigniew J. Czech, Wojciech Wieczorek:
An adaptive parallel algorithm for finite language decomposition. Appl. Intell. 52(3): 3029-3050 (2022) - Kitti Gelle, Szabolcs Iván:
Descriptive Complexity of Reversible Languages Having Finitely Many Reduced Automata. Int. J. Found. Comput. Sci. 33(3&4): 247-262 (2022) - Branislav Rovan, András Varga:
Finite Approximations and Similarity of Languages. Int. J. Found. Comput. Sci. 33(8): 967-1003 (2022)
skipping 555 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-09-24 09:52 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