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 32 matches
- 2006
- Suzana Andova, Tim A. C. Willemse:
Branching bisimulation for probabilistic systems: Characteristics and decidability. Theor. Comput. Sci. 356(3): 325-355 (2006) - Jos C. M. Baeten, Flavio Corradini:
Preface. Theor. Comput. Sci. 356(3): 263-264 (2006) - Marie-Pierre Béal, Dominique Perrin:
Codes, unambiguous automata and sofic systems. Theor. Comput. Sci. 356(1-2): 6-13 (2006) - Emmanuel Beffara, François Maurel:
Concurrent nets: A study of prefixing in process calculi. Theor. Comput. Sci. 356(3): 356-373 (2006) - Alberto Bertoni, Zoltán Ésik, Juhani Karhumäki:
Preface. Theor. Comput. Sci. 356(1-2): 1-5 (2006) - Alberto Bertoni, Carlo Mereghetti, Beatrice Palano:
Some formal tools for analyzing quantum automata. Theor. Comput. Sci. 356(1-2): 14-25 (2006) - Robert Brijder, Hendrik Jan Hoogeboom, Grzegorz Rozenberg:
Reducibility of gene patterns in ciliates using the breakpoint graph. Theor. Comput. Sci. 356(1-2): 26-45 (2006) - Janusz A. Brzozowski:
Representation of a class of nondeterministic semiautomata by canonical words. Theor. Comput. Sci. 356(1-2): 46-57 (2006) - Mikkel Bundgaard, Thomas T. Hildebrandt, Jens Chr. Godskesen:
A CPS encoding of name-passing in Higher-order mobile embedded resources. Theor. Comput. Sci. 356(3): 422-439 (2006) - Giusi Castiglione, Antonio Restivo, Roberto Vaglica:
A reconstruction algorithm for L-convex polyominoes. Theor. Comput. Sci. 356(1-2): 58-72 (2006) - Laura Chaubard, Jean-Eric Pin, Howard Straubing:
Actions, wreath products of C-varieties and concatenation product. Theor. Comput. Sci. 356(1-2): 73-89 (2006) - Alessandra Cherubini, Stefano Crespi-Reghizzi, Matteo Pradella, Pierluigi San Pietro:
Picture languages: Tiling systems versus tile rewriting grammars. Theor. Comput. Sci. 356(1-2): 90-103 (2006) - Flavio Corradini, Maria Rita Di Berardini, Walter Vogler:
Fairness of components in system computations. Theor. Comput. Sci. 356(3): 291-324 (2006) - Flavio D'Alessandro, Benedetto Intrigila, Stefano Varricchio:
On the structure of the counting function of sparse context-free languages. Theor. Comput. Sci. 356(1-2): 104-117 (2006) - Volker Diekert, Paul Gastin:
From local to global temporal logics over Mazurkiewicz traces. Theor. Comput. Sci. 356(1-2): 126-135 (2006) - Zoltán Ésik:
Characterizing CTL-like logics on finite trees. Theor. Comput. Sci. 356(1-2): 136-152 (2006) - Alain Finkel, Gilles Geeraerts, Jean-François Raskin, Laurent Van Begin:
On the omega-language expressive power of extended Petri nets. Theor. Comput. Sci. 356(3): 374-386 (2006) - Rob J. van Glabbeek:
On the expressiveness of higher dimensional automata. Theor. Comput. Sci. 356(3): 265-290 (2006) - Massimiliano Goldwurm, Violetta Lonati:
Pattern statistics and Vandermonde matrices. Theor. Comput. Sci. 356(1-2): 153-169 (2006) - Serge Grigorieff:
Synchronization of a bounded degree graph of cellular automata with nonuniform delays in time D floor(logm D). Theor. Comput. Sci. 356(1-2): 170-185 (2006) - Xudong Guan:
Name-passing in an ambient-like calculus and its proof using spatial logic. Theor. Comput. Sci. 356(3): 440-467 (2006) - Tero Harju, Dirk Nowotka:
On unique factorizations of primitive words. Theor. Comput. Sci. 356(1-2): 186-189 (2006) - Oscar H. Ibarra, Bala Ravikumar:
On partially blind multihead finite automata. Theor. Comput. Sci. 356(1-2): 190-199 (2006) - Juhani Karhumäki, Michal Kunc, Alexander Okhotin:
Computing by commuting. Theor. Comput. Sci. 356(1-2): 200-211 (2006) - Michel Latteux, Aurélien Lemay, Yves Roos, Alain Terlutte:
Identification of biRFSA languages. Theor. Comput. Sci. 356(1-2): 212-223 (2006) - Sylvain Lombardy, Jacques Sakarovitch:
Sequential? Theor. Comput. Sci. 356(1-2): 224-244 (2006) - Aldo de Luca, Alessandro De Luca:
Some characterizations of finite Sturmian words. Theor. Comput. Sci. 356(1-2): 118-125 (2006) - Jean Néraud:
Completing prefix codes in submonoids. Theor. Comput. Sci. 356(1-2): 245-254 (2006) - Rocco De Nicola, Daniele Gorla, Rosario Pugliese:
On the expressive power of KLAIM-based calculi. Theor. Comput. Sci. 356(3): 387-421 (2006) - Iain Phillips, Maria Grazia Vigliotti:
Leader election in rings of ambient processes. Theor. Comput. Sci. 356(3): 468-494 (2006)
skipping 2 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-21 08:38 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