Home
Journals
Archaeology International
Architecture_MPS
Europe and the World: A law review
Film Education Journal
History Education Research Journal
International Journal of Development Education and Global Learning
International Journal of Social Pedagogy
Jewish Historical Studies: A Journal of English-Speaking Jewry
Journal of Bentham Studies
London Review of Education
Radical Americas
Research for All
The Journal of the Sylvia Townsend Warner Society
The London Journal of Canadian Studies
About
About UCL Press
Who we are
Contact us
My ScienceOpen
Sign in
Register
Dashboard
Search
Home
Journals
Archaeology International
Architecture_MPS
Europe and the World: A law review
Film Education Journal
History Education Research Journal
International Journal of Development Education and Global Learning
International Journal of Social Pedagogy
Jewish Historical Studies: A Journal of English-Speaking Jewry
Journal of Bentham Studies
London Review of Education
Radical Americas
Research for All
The Journal of the Sylvia Townsend Warner Society
The London Journal of Canadian Studies
About
About UCL Press
Who we are
Contact us
My ScienceOpen
Sign in
Register
Dashboard
Search
5
views
7
references
Top references
cited by
0
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
3,287
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Language and Automata Theory and Applications
Preimage Problems for Reaction Systems
other
Author(s):
Alberto Dennunzio
,
Enrico Formenti
,
Luca Manzoni
,
Antonio E. Porreca
Publication date
(Online):
February 24 2015
Publisher:
Springer International Publishing
Read this book at
Publisher
Buy book
Review
Review book
Invite someone to review
Bookmark
Cite as...
There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.
Related collections
Socioecological systems
Most cited references
7
Record
: found
Abstract
: not found
Article
: not found
The complexity of optimization problems
Mark W. Krentel
(1988)
0
comments
Cited
45
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Polynomial Space Counting Problems
Richard Ladner
(1989)
0
comments
Cited
10
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Minimal and almost minimal reaction systems
Arto Salomaa
,
A Salomaa
(2013)
0
comments
Cited
6
times
– based on
0
reviews
Review now
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2015
Publication date (Online):
February 24 2015
Pages
: 537-548
DOI:
10.1007/978-3-319-15579-1_42
SO-VID:
8557a878-7e86-474c-a7d7-d84535cb34ba
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 3
Automated Synthesis of Application-Layer Connectors from Automata-Based Specifications
pp. 25
Automated Program Verification
pp. 47
Hankel Matrices: From Words to Graphs (Extended Abstract)
pp. 56
Complexity Classes for Membrane Systems: A Survey
pp. 70
The Shuffle Product: New Research Directions
pp. 85
Average-Case Optimal Approximate Circular String Matching
pp. 97
An Efficient Best-Trees Algorithm for Weighted Tree Automata over the Tropical Semiring
pp. 109
Construction of a de Bruijn Graph for Assembly from a Truncated Suffix Tree
pp. 121
Frequent Pattern Mining with Non-overlapping Inversions
pp. 133
A Parallel Algorithm for Finding All Minimal Maximum Subsequences via Random Walk
pp. 145
Building Bridges Between Sets of Partial Orders
pp. 161
Complexity of Road Coloring with Prescribed Reset Words
pp. 175
Logics for Unordered Trees with Data Constraints on Siblings
pp. 188
Weak and Nested Class Memory Automata
pp. 200
Insertion Operations on Deterministic Reversal-Bounded Counter Machines
pp. 212
On the Synchronizing Probability Function and the Triple Rendezvous Time
pp. 224
On Robot Games of Degree Two
pp. 237
Time-Bounded Reachability Problem for Recursive Timed Automata is Undecidable
pp. 249
On Observability of Automata Networks via Computational Algebra
pp. 263
Reasoning on Schemas of Formulas: An Automata-Based Approach
pp. 275
Derivatives for Regular Shuffle Expressions
pp. 287
From $$\omega $$ -Regular Expressions to Büchi Automata via Partial Derivatives
pp. 299
Quotient of Acceptance Specifications Under Reachability Constraints
pp. 315
Structure and Measure of a Decidable Class of Two-dimensional Codes
pp. 328
On Torsion-Free Semigroups Generated by Invertible Reversible Mealy Automata
pp. 340
Coding Non-orientable Laminations
pp. 353
Preset Distinguishing Sequences and Diameter of Transformation Semigroups
pp. 365
Hierarchy and Expansiveness in 2D Subshifts of Finite Type
pp. 381
On the Number of Closed Factors in a Word
pp. 391
Online Computation of Abelian Runs
pp. 402
Coverability in Two Dimensions
pp. 414
Equation $$x^iy^jx^k=u^iv^ju^k$$ in Words
pp. 424
Square-Free Words over Partially Commutative Alphabets
pp. 436
On the Language of Primitive Partial Words
pp. 449
Complexity of Regular Functions
pp. 461
A Nonuniform Circuit Class with Multilayer of Threshold Gates Having Super Quasi Polynomial Size Lower Bounds Against NEXP
pp. 473
Finite Automata for the Sub- and Superword Closure of CFLs: Descriptional and Computational Complexity
pp. 486
A Game Characterisation of Tree-like Q-resolution Size
pp. 499
Recurrence Relations, Succession Rules, and the Positivity Problem
pp. 511
On the Complexity of Fragments of the Modal Logic of Allen’s Relations over Dense Structures
pp. 524
Parameterized Enumeration for Modification Problems
pp. 537
Preimage Problems for Reaction Systems
pp. 549
Parameterized Complexity of CTL
pp. 563
Single-Pass Testing Automata for LTL Model Checking
pp. 577
Compressed Data Structures for Range Searching
pp. 587
Average Linear Time and Compressed Space Construction of the Burrows-Wheeler Transform
pp. 599
Backward Linearised Tree Pattern Matching
pp. 611
BFS-Based Symmetry Breaking Predicates for DFA Identification
pp. 623
Learning Conjunctive Grammars and Contextual Binary Feature Grammars
pp. 639
Recognizable Series on Hypergraphs
pp. 652
Towards More Precise Rewriting Approximations
pp. 664
Sorting Networks: The End Game
pp. 676
Bounding Clique-Width via Perfect Graphs
pp. 689
Order Structures for Subclasses of Generalised Traces
pp. 703
A Nivat Theorem for Weighted Picture Automata and Weighted MSO Logic
pp. 716
Rational Selecting Relations and Selectors
pp. 727
A Hierarchy of Transducing Observer Systems
pp. 739
Sublinear DTD Validity
Similar content
3,287
Distribution des preimages et des points periodiques d'une correspondance polynomiale
Authors:
Tien-Cuong Dinh
Postorder Preimages
Authors:
Colin Defant
Realization problems of graphs as Reeb graphs of Morse functions with prescribed preimages
Authors:
N. Kitazawa
See all similar