Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen
Sign in
Register
Dashboard
Search
Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen
Sign in
Register
Dashboard
Search
51
views
0
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,506
similar
All similar
Record
: found
Abstract
: not found
Book
: not found
Fundamentals of Computation Theory
other
Editor(s):
Zoltán Ésik
Publication date
(Print):
1993
Publisher:
Springer Berlin Heidelberg
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
Numerical Algebra, Matrix Theory, Differential-Algebraic Equations, and Control Theory
Author and book information
Book
ISBN (Print):
978-3-540-57163-6
ISBN (Electronic):
978-3-540-47923-9
Publication date (Print):
1993
DOI:
10.1007/3-540-57163-9
SO-VID:
2059a98f-9b24-4c99-b5d0-6aeeabbce1ae
License:
http://www.springer.com/tdm
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 1
Rewriting, möbius functions and semi-commutations
pp. 16
Simulations between different models of parallel computers
pp. 31
Dense and disjunctive properties of languages
pp. 50
The hierarchy of codes
pp. 69
Five facets of hyperedge replacement beyond context-freeness
pp. 87
An action structure for synchronous π-calculus
pp. 106
AC0 circuit complexity
pp. 121
Pattern languages: Problems of decidability and generation
pp. 133
General solution of mirror equation
pp. 142
Decidability of equivalence for linear letter to letter top-down tree transducers
pp. 152
Translations between flowchart schemes and process graphs
pp. 162
Local equational logic
pp. 171
Liveness of weighted circuits and the diophantine problem of Frobenius
pp. 181
Context-free graph grammars: Separating vertex replacement from hyperedge replacement
pp. 194
Formal languages consisting of primitive words
pp. 204
Undecidability of the surjectivity problem for 2D cellular automata: A simplified proof
pp. 212
Efficient interpretation of state charts
pp. 222
Implementation of a universal unification algorithm for macro tree transducers
pp. 234
Finding maximum convex polygons
pp. 244
Approximations with axis-aligned rectangles (extended abstract)
pp. 256
Vector sequence analysis and full weak safety for concurrent systems
pp. 266
Does transitivity help? On the complexity of poset properties
pp. 279
Generalized topological sorting in linear time
pp. 289
Easily checked self-reducibility
pp. 299
On the complexities of linear LL(1) and LR(1) grammars
pp. 309
On the relation between firing sequences and processes of Petri nets
pp. 319
Maximum covering with D cliques
pp. 329
Monotonically labelled ordered trees and multidimensional binary trees
pp. 342
A maximum path length pumping lemma for edge-replacement languages
pp. 352
Regular approximations to shuffle products of context-free languages, and convergence of their generating functions
pp. 363
The equational theory of a Boolean monad
pp. 375
Non erasing Taring machines: a frontier between a decidable halting problem and Universality
pp. 386
On scattered syntactic monoids
pp. 396
Regular tree languages without unary symbols are star-free
pp. 406
One-way cellular automata on cayley graphs
pp. 418
ON tree pattern unification problems
pp. 430
Structural Equivalence and ETOL grammars
pp. 440
A hierarchy of deterministic top-down tree transformations
pp. 452
Synthesis of O(lg n) testable trees
pp. 462
On the learnability of a restricted predicate formulae
Similar content
3,506
Polyploidy as a Fundamental Phenomenon in Evolution, Development, Adaptation and Diseases
Authors:
Olga V. Anatskaya
,
Alexander E. Vinogradov
Fundamentals of rock joint deformation
Authors:
N.R. Barton
,
A.C. Lumsden
,
S.C. Bandis
Rapid Structure-Based Screening Informs Potential Agents for Coronavirus Disease (COVID-19) Outbreak * * Supported by the National Natural Science Foundation of China (Grant Nos. 11774279 and 11774280), the Fundamental Research Funds for the Central Universities of China (Grant Nos. xjj2017029 and xzy032020038), and the Natural Science Basic Research Plan in Shaanxi Province of China (Grant No. 2019JQ-603).
Authors:
Zhi-Wei Yang
,
Yi-Zhen Zhao
,
Yong-Jian Zang
…
See all similar