Остановите войну!
for scientists:
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 60 matches
- 1975
- Jirí Adámek:
Automata and Categories: Finiteness Contra Minimality. MFCS 1975: 160-166 - A. V. Anisimov:
Languages Over Free Groups. MFCS 1975: 167-171 - Giorgio Ausiello, Marco Protasi:
On the Comparison of Notions of Approximation. MFCS 1975: 172-178 - Janis Barzdin, Janis Bicevskis, Audris Kalnins:
Construction of Complete Sample System for Correctness Testing. MFCS 1975: 1-12 - M. Benesová, Ivan Korec:
Non-Linear Speed-Up Theorem for Two Register Minsky Machines. MFCS 1975: 179-185 - Eike Best, Hans Albrecht Schmid:
Systems of Open Paths in Petri Nets. MFCS 1975: 186-193 - Peter van Emde Boas:
Ten Years of Speedup. MFCS 1975: 13-29 - Luc Boasson:
on the Largest Full Sub-AFL of the Full AFL of Context-Free Languages. MFCS 1975: 194-198 - Michal Chytil:
On Complexity of Nondeterministic Turing Machines Computations. MFCS 1975: 199-205 - Alexander Ja. Dikovsky:
On Closure Properties of Context-Free Derivation Complexity Classes. MFCS 1975: 206-211 - Venelin K. Evtimov:
Control Structures in Single Block Programs. MFCS 1975: 212-218 - R. V. Freivald:
Minimal Gödel Numbers and Their Identification in the Limit. MFCS 1975: 219-225 - Ferenc Gécseg:
Isomorphic Representation of Automata. MFCS 1975: 226-230 - Hartmann J. Genrich:
Extended Simple Regular Expressions. MFCS 1975: 231-237 - Giuseppina C. Gini, Maria L. Gini:
Conniver Programs by Logical Point of View. MFCS 1975: 238-245 - Jerzy W. Grzymala-Busse:
On the Set of All Automata with the Same Monoid of Endomorphisms. MFCS 1975: 246-251 - Petr Hájek:
On Logics of Discovery. MFCS 1975: 30-45 - Michael A. Harrison:
On Models of Protection in Operating Systems. MFCS 1975: 46-60 - Ivan M. Havel:
Nondterministically Recognizable Sets of Languages. MFCS 1975: 252-257 - Tomás Havránek:
The Approximation Problem in Computational Statistics. MFCS 1975: 258-265 - Klaus Indermark:
The Continuous Algebra of Monadic Languages. MFCS 1975: 266-270 - Max I. Kanovic:
On Sets of Complex-Programmed Numbers. MFCS 1975: 271-272 - Marek Karpinski:
Decision Algorithms for Havel's Branching Automata. MFCS 1975: 273-279 - Václav Koubek, Jan Reiterman:
Automata and Categories - Input Processes. MFCS 1975: 280-286 - Jaroslav Král, Jirí Demner:
Parsing as a Subtask of Compiling. MFCS 1975: 61-74 - Fred Kröger:
Formalization of Algorithmic Reasoning. MFCS 1975: 287-293 - Giorgio Levi, Franco Sirovich:
Proving Program Properties, Symbolic Evaluation and Logical Procedural Semantics. MFCS 1975: 294-301 - Jan Maluszynski:
A Contribution to Error Recovery. MFCS 1975: 302-307 - Antoni W. Mazurkiewicz:
Parallel Recursive Program Schemes. MFCS 1975: 75-87 - Otto Mayer:
On the Analysis and Synthesis Problems for Context-Free Expressions. MFCS 1975: 308-314
skipping 30 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-05-06 06: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