


default search action
Theoretical Computer Science, Volume 750
Volume 750, November 2018
- Kim G. Larsen

, Igor Potapov
, Jirí Srba
:
Reachability problems: Special issue. 1 - Sam A. M. Jones, Richard M. Thomas:

Word problems of groups: Formal languages, characterizations and decidability. 2-23 - Matthew Hague

, Anthony W. Lin
:
Decidable models of integer-manipulating programs with recursive parallelism. 24-37 - Thomas Geffroy, Jérôme Leroux, Grégoire Sutre

:
Occam's Razor applied to the Petri net coverability problem. 38-52 - Adrien Le Coënt, Laurent Fribourg, Nicolas Markey

, Florian De Vuyst, Ludovic Chamoin:
Compositional synthesis of state-dependent switching control. 53-68 - Natasha Alechina

, Nils Bulling, Stéphane Demri, Brian Logan:
On the complexity of resource-bounded logics. 69-100 - Eike Best, Thomas Hujsa

, Harro Wimmel:
Sufficient conditions for the marked graph realisability of labelled transition systems. 101-116

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.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID













