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
- 1994
- Laurent Alonso:
Uniform Generation of a Motzkin Word. Theor. Comput. Sci. 134(2): 529-536 (1994) - J. A. Anderson:
Semiretracts of a Free Monoid. Theor. Comput. Sci. 134(1): 3-11 (1994) - Danièle Beauquier, Andreas Podelski:
Rabin Tree Automata and Finite Monoids. Theor. Comput. Sci. 134(1): 13-25 (1994) - Agnès Bonnier-Rigny, Daniel Krob:
A Complete System of Identities for One-Letter Rational Expressions with Multiplicities in the Tropical Semiring. Theor. Comput. Sci. 134(1): 27-50 (1994) - Fernanda Botelho, Max H. Garzon:
Boolean Neural Nets are Observable. Theor. Comput. Sci. 134(1): 51-61 (1994) - Renato M. Capocelli, Luisa Gargano, Ugo Vaccaro:
A Fast Algorithm for the Unique Decipherability of Multivalued Encodings. Theor. Comput. Sci. 134(1): 63-78 (1994) - Edward P. F. Chan:
Testing Satisfiability of a Class of Object-Oriented Conjunctive Queries. Theor. Comput. Sci. 134(2): 287-309 (1994) - Sinisa Crvenkovic, Rozália Sz. Madarász:
On Dynamic Algebras. Theor. Comput. Sci. 134(1): 79-86 (1994) - Elias Dahlhaus, Marek Karpinski:
An Efficient Parallel Algorithm for the Minimal Elimination Ordering (MEO) of an Arbitrary Graph. Theor. Comput. Sci. 134(2): 493-528 (1994) - Volker Diekert:
A Partial Trace Semantics for Petri Nets. Theor. Comput. Sci. 134(1): 87-105 (1994) - Bruno Durand:
Inversion of 2D Cellular Automata: Some Complexity Results. Theor. Comput. Sci. 134(2): 387-401 (1994) - Lance Fortnow, John Rompel, Michael Sipser:
On the Power of Multi-Prover Interactive Protocols. Theor. Comput. Sci. 134(2): 545-557 (1994) - Zoltán Fülöp:
Undecidable Properties of Deterministic Top-Down Tree Transducers. Theor. Comput. Sci. 134(2): 311-328 (1994) - Tero Harju, H. C. M. Kleijn, Michel Latteux, Alain Terlutte:
Representation of Rational Functions with Prefix and Suffix Codings. Theor. Comput. Sci. 134(2): 403-413 (1994) - John Harrison:
Morphic Congruences and D0L Languages. Theor. Comput. Sci. 134(2): 537-544 (1994) - Tao Jiang, Ming Li:
Approximating Shortest Superstrings with Constraints. Theor. Comput. Sci. 134(2): 473-491 (1994) - Helmut Jürgensen, Kai Salomaa, Sheng Yu:
Transducers and the Decidability of Independence in Free Monoids. Theor. Comput. Sci. 134(1): 107-117 (1994) - Michael Kaminski, Nissim Francez:
Finite-Memory Automata. Theor. Comput. Sci. 134(2): 329-363 (1994) - Alica Kelemenová, Erzsébet Csuhaj-Varjú:
Languages of Colonies. Theor. Comput. Sci. 134(1): 119-130 (1994) - Johannes Köbler:
Locating P/poly Optimally in the Extended Low Hierarchy. Theor. Comput. Sci. 134(2): 263-285 (1994) - Louis Mak:
Speedup of Determinism by Alternation for Multidimensional Turing Machines. Theor. Comput. Sci. 134(2): 427-453 (1994) - Frantisek Matús:
Stochastic Independence, Algebraic Independence and Abstract Connectedness. Theor. Comput. Sci. 134(2): 455-471 (1994) - Teo Mora:
An Introduction to Commutative and Noncommutative Gröbner Bases. Theor. Comput. Sci. 134(1): 131-173 (1994) - Friedrich Otto, Paliath Narendran:
Codes Modulo Finite Monadic String-Rewriting Systems. Theor. Comput. Sci. 134(1): 175-188 (1994) - Norman R. Reilly:
Bounds on the Variety Generated by Completely Regular Syntactic Monoids from Finite Prefix Codes. Theor. Comput. Sci. 134(1): 189-208 (1994) - Eric Rémila:
On the Tiling of a Torus with Two Bars. Theor. Comput. Sci. 134(2): 415-426 (1994) - Jean-Claude Spehner:
A Bijection Between Cliques in Graphs and Factorizations in Free Monoids. Theor. Comput. Sci. 134(1): 209-223 (1994) - Ferucio Laurentiu Tiplea, Cristian Ene, Cecilia Magdalena Ionescu, Octavian Procopiuc:
Some Decision Problems for Parallel Communicating Grammar Systems. Theor. Comput. Sci. 134(2): 365-385 (1994) - Andreas Weber:
Finite-Valued Distance Automata. Theor. Comput. Sci. 134(1): 225-251 (1994) - Andreas Weber:
Exponential Upper and Lower Bounds for the Order of a Regular Language. Theor. Comput. Sci. 134(1): 253-262 (1994)
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-09-27 23:23 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