Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch 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 43 matches
- 2022
- Jirí Síma:
Stronger separation of analog neuron hierarchy by deterministic context-free languages. Neurocomputing 493: 605-612 (2022)
- Tomoyuki Yamakami:
Formal Grammars for Turn-Bounded Deterministic Context-Free Languages. ICTAC 2022: 425-441 - 2021
- Jirí Síma:
Stronger Separation of Analog Neuron Hierarchy by Deterministic Context-Free Languages. CoRR abs/2102.01633 (2021) - Tomoyuki Yamakami:
Intersection and Union Hierarchies of Deterministic Context-Free Languages and Pumping Lemmas. CoRR abs/2112.09383 (2021) - 2020
- Tomoyuki Yamakami:
Intersection and Union Hierarchies of Deterministic Context-Free Languages and Pumping Lemmas. LATA 2020: 341-353 - Josef Rukavicka:
Dissecting Power of a Finite Intersection of Deterministic Context Free Languages. CoRR abs/2006.15160 (2020) - 2019
- Jirí Síma, Martin Plátek
:
One Analog Neuron Cannot Recognize Deterministic Context-Free Languages. ICONIP (3) 2019: 77-89 - 2018
- Alexander A. Rubtsov:
A Structural Lemma for Deterministic Context-Free Languages. DLT 2018: 553-565 - 2016
- Anne-Kathrin Schmuck, Sven Schneider, Jörg Raisch, Uwe Nestmann:
Supervisory control synthesis for deterministic context free specification languages - Enforcing controllability least restrictively. Discret. Event Dyn. Syst. 26(1): 5-32 (2016) - Kaushik Mallik, Anne-Kathrin Schmuck:
Supervisory controller synthesis for decomposable deterministic context free specification languages. WODES 2016: 22-27 - 2013
- Tommi Lehtinen, Alexander Okhotin:
Homomorphisms Preserving Deterministic Context-Free Languages. Int. J. Found. Comput. Sci. 24(7): 1049-1066 (2013) - 2012
- Tommi Lehtinen, Alexander Okhotin:
Homomorphisms Preserving Deterministic Context-Free Languages. Developments in Language Theory 2012: 154-165 - 2004
- Claas E. Röver:
On Groups which are Syntactic Monoids of Deterministic Context-Free Languages. Int. J. Algebra Comput. 14(4): 499-504 (2004) - Henning Bordihn, Markus Holzer, Martin Kutrib:
Some Non-semi-decidability Problems for Linear and Deterministic Context-Free Languages. CIAA 2004: 68-79 - 2003
- Oliver Glier:
Kolmogorov Complexity and Deterministic Context-Free Languages. SIAM J. Comput. 32(5): 1389-1394 (2003) - Jacques Duparc:
A hierarchy of deterministic context-free omega-languages. Theor. Comput. Sci. 290(3): 1253-1300 (2003) - 2000
- Kenichi Morita, Jia Lee:
Characterizing the Class of Deterministic Context-Free Languages by Semi-Right-Terminating Uniquely Parsable Grammars. Recent Topics in Mathematical and Computational Linguistics 2000: 207-217 - 1992
- Priti Shankar, B. S. Adiga:
Corrigendum: A Graph-Based Regularity Test for Deterministic Context-Free Languages. Theor. Comput. Sci. 95(2): 339-340 (1992) - 1991
- Priti Shankar, B. S. Adiga:
A Graph-Based Regularity Test for Deterministic Context-free Languages. Theor. Comput. Sci. 88(1): 117-125 (1991) - 1990
- Géraud Sénizergues:
A Characterisation of Deterministic Context-Free Languages by Means of Right-Congruences. Theor. Comput. Sci. 70(2): 213-232 (1990) - 1989
- Géraud Sénizergues:
Church-Rosser Controller Rewriting Systems and Equivalence problems for Deterministic Context-Free Languages. Inf. Comput. 81(3): 265-279 (1989) - Sheng Yu:
A Pumping Lemma for Deterministic Context-Free Languages. Inf. Process. Lett. 31(1): 47-51 (1989) - 1987
- R. Boonyavatana, Giora Slutzki:
Note: on the sufficiency of Igarashi's conditions for real-time deterministic context-free-languages. Bull. EATCS 31: 9-11 (1987) - 1986
- Fabienne Romian, Jacques Sakarovitch:
One-Sided Dyck Reduction Over Two Letter Alphabet and Deterministic Context-Free Languages. MFCS 1986: 554-563 - 1985
- Yoshihide Igarashi:
A Pumping Lemma for Real-Time Deterministic Context-Free Languages. Theor. Comput. Sci. 36: 89-97 (1985) - 1981
- Christian Choffrut:
A Closure Property of Deterministic Context-Free Languages. Inf. Process. Lett. 12(1): 13-16 (1981) - 1980
- Leslie Paul Jones, Jonathan Goldstine:
A Characterization Theorem for Certain Bounded Deterministic Context-Free Languages. Inf. Control. 47(3): 220-236 (1980) - 1979
- Joffroy Beauquier:
Strong Non-Deterministic Context-Free Languages. Theoretical Computer Science 1979: 47-57 - 1978
- Yoshihide Igarashi:
Tape Bounds for Some Subclasses of Deterministic Context-Free Languages. Inf. Control. 37(3): 321-333 (1978) - Emily P. Friedman, Sheila A. Greibach:
On Equivalence and Subclass Containment Problems for Deterministic Context-Free Languages. Inf. Process. Lett. 7(6): 287-290 (1978)
skipping 13 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 2023-09-24 08:56 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
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
