• 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.

found 86 matches

• 1990
• 
  Egidio Astesiano, Alessandro Giovini, Gianna Reggio:
  Processes as Data Types: Observational Semantics and Logic. Semantics of Systems of Concurrent Processes 1990: 1-20
• 
  J. W. de Bakker, J. H. A. Warmerdam:
  Metric Pomset Semantics for a Concurrnt Language with Recursion. Semantics of Systems of Concurrent Processes 1990: 21-49
• 
  Joffroy Beauquier:
  Fault-Tolerant Naming and Mutual Exclusion. Semantics of Systems of Concurrent Processes 1990: 50-61
• 
  Gérard Boudol:
  Flow Event Structures and Flow Nets. Semantics of Systems of Concurrent Processes 1990: 62-95
• 
  Gérard Boudol, Ilaria Castellani:
  Three Equivalent Semantics for CCS. Semantics of Systems of Concurrent Processes 1990: 96-141
• 
  Luc Bougé, Patrick Garda:
  Towards a Semantic Approach to SIMD Architectures and their Languages. Semantics of Systems of Concurrent Processes 1990: 142-175
• 
  Bernadette Charron-Bost:
  Concerning the Size of Clocks. Semantics of Systems of Concurrent Processes 1990: 176-184
• 
  Andrea Corradini, Gian-Luigi Ferrari, Ugo Montanari:
  Transition Systems with Algebraic Structure as Models of Computations. Semantics of Systems of Concurrent Processes 1990: 185-222
• 
  Philippe Darondeau:
  Concurrency and Computability. Semantics of Systems of Concurrent Processes 1990: 223-238
• 
  Philippe Darondeau, Pierpaolo Degano:
  Causal Trees: Interleaving + Causality. Semantics of Systems of Concurrent Processes 1990: 239-255
• 
  Gérard Duchamp, Daniel Krob:
  Partially Commutative Formal Power Series. Semantics of Systems of Concurrent Processes 1990: 256-276
• 
  Paul Gastin:
  Infinite Traces. Semantics of Systems of Concurrent Processes 1990: 277-308
• 
  Rob J. van Glabbeek, Ursula Goltz:
  Equivalences and Refinement. Semantics of Systems of Concurrent Processes 1990: 309-333
• 
  Ursula Goltz:
  CCS and Petri Nets. Semantics of Systems of Concurrent Processes 1990: 334-357
• 
  Irène Guessarian:
  About Fixpoints for Concurrency. Semantics of Systems of Concurrent Processes 1990: 358-374
• 
  Stefano Kasangian, Anna Labella, Alberto Pettorossi:
  Observers, Experiments and Agents: a Comprehensive Approach to Parallelism. Semantics of Systems of Concurrent Processes 1990: 375-406
• 
  Rocco De Nicola, Frits W. Vaandrager:
  Action versus State based Logics for Transition Systems. Semantics of Systems of Concurrent Processes 1990: 407-419
• 
  Lutz Priese:
  Approaching Fair Computations by Ultra Metrics. Semantics of Systems of Concurrent Processes 1990: 420-433
• 
  Brigitte Rozoy:
  On Distributed Languages and Models for Distributed Computation. Semantics of Systems of Concurrent Processes 1990: 434-456
• 
  Irène Guessarian:
  Semantics of Systems of Concurrent Processes, LITP Spring School on Theoretical Computer Science, La Roche Posay, France, April 23-27, 1990, Proceedings. Lecture Notes in Computer Science 469, Springer 1990, ISBN 3-540-53479-2 [contents]
• 1989
• 
  Maurice Gross, Dominique Perrin:
  Electronic Dictionaries and Automata in Computational Linguistics, LITP Spring School on Theoretical Computer Science, Saint-Pierre d'Oléron, France, May 25-29, 1987, Proceedings. Lecture Notes in Computer Science 377, Springer 1989, ISBN 3-540-51465-1 [contents]
• 
  Jean-Eric Pin:
  Formal Properties of Finite Automata and Applications, LITP Spring School on Theoretical Computer Science, Ramatuelle, France, May 23-27, 1988, Proceedings. Lecture Notes in Computer Science 386, Springer 1989, ISBN 3-540-51631-X [contents]
• 1988
• 
  Jorge Almeida:
  Equations for pseudovarieties. Formal Properties of Finite Automata and Applications 1988: 148-164
• 
  Jean Berstel:
  Finite automata and rational languages. An introduction. Formal Properties of Finite Automata and Applications 1988: 2-14
• 
  Jean-Camille Birget:
  Basic techniques for two-way finite automata. Formal Properties of Finite Automata and Applications 1988: 56-64
• 
  Maxime Crochemore:
  Algorithms and automata. Formal Properties of Finite Automata and Applications 1988: 166-175
• 
  Irène Guessarian:
  A characterization of fair computations of finite state SCCS processes. Formal Properties of Finite Automata and Applications 1988: 234-248
• 
  Kosaburo Hashiguchi:
  Relative star height, star height and finite automata with distance functions. Formal Properties of Finite Automata and Applications 1988: 74-88
• 
  Aldo de Luca, Stefano Varricchio:
  A finiteness condition for semigroups. Formal Properties of Finite Automata and Applications 1988: 138-147
• 
  John C. Meakin:
  Automata and the word problem. Formal Properties of Finite Automata and Applications 1988: 89-103

skipping 56 more matches