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
29
views
17
references
Top references
cited by
8
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
778
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Descriptional Complexity of Formal Systems
Very Narrow Quantum OBDDs and Width Hierarchies for Classical OBDDs
other
Author(s):
Farid Ablayev
,
Aida Gainutdinova
,
Kamil Khadiev
,
Abuzer Yakaryılmaz
Publication date
(Print):
2014
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
AI & Robotics
Most cited references
17
Record
: found
Abstract
: not found
Book Chapter
: not found
Quantum Computational Complexity
John Watrous
(2009)
0
comments
Cited
38
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Book
: not found
Branching Programs and Binary Decision Diagrams
Ingo Wegener
(2000)
0
comments
Cited
24
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Analogies and differences between quantum and stochastic automata
Alberto Bertoni
,
Marco Carpentieri
(2001)
0
comments
Cited
18
times
– based on
0
reviews
Review now
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2014
Pages
: 53-64
DOI:
10.1007/978-3-319-09704-6_6
SO-VID:
f6d0f020-8a60-4c5a-bcc2-6d5c78aa9fa2
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 5
Automata with Reversal-Bounded Counters: A Survey
pp. 65
Matter and Anti-Matter in Membrane Systems
pp. 53
Very Narrow Quantum OBDDs and Width Hierarchies for Classical OBDDs
Similar content
778
Very narrow quantum OBDDs and width hierarchies for classical OBDDs
Authors:
Farid Ablayev
,
Aida Gainutdinova
,
Kamil Khadiev
…
A Novel Symbolic OBDD Algorithm for Generating Mechanical Assembly Sequences Using Decomposition Approach
Authors:
Zhoubo Xu
Discussion on “OBDD-Based Sectionalizing Strategies for Parallel Power System Restoration”
Authors:
Z Z Lin
,
F. Wen
See all similar
Cited by
8
Very Narrow Quantum OBDDs and Width Hierarchies for Classical OBDDs
Authors:
Farid Ablayev
,
Aida Gainutdinova
,
Kamil Khadiev
…
Language recognition power and succintness of affine automata
Authors:
,
Quantum Pushdown Automata with a Garbage Tape
Authors:
See all cited by