ScienceOpen:
research and publishing network
For Publishers
Discovery
Metadata
Peer review
Hosting
Publishing
For Researchers
Join
Publish
Review
Collect
My ScienceOpen
Sign in
Register
Dashboard
Blog
About
Search
Advanced search
My ScienceOpen
Sign in
Register
Dashboard
Search
Search
Advanced search
For Publishers
Discovery
Metadata
Peer review
Hosting
Publishing
For Researchers
Join
Publish
Review
Collect
Blog
About
30
views
0
references
Top references
cited by
1
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,285
similar
All similar
Record
: found
Abstract
: not found
Book
: not found
Descriptional Complexity of Formal Systems
other
Editor(s):
Stavros Konstantinidis
,
Giovanni Pighizzini
Publication date
(Print):
2018
Publisher:
Springer International Publishing
Read this book at
Publisher
Further versions
oa repository (via OAI-PMH doi match)
oa repository (via OAI-PMH doi match)
Powered by
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
Author and book information
Book
ISBN (Print):
978-3-319-94630-6
ISBN (Electronic):
978-3-319-94631-3
Publication date (Print):
2018
DOI:
10.1007/978-3-319-94631-3
SO-VID:
6d8d6559-8076-46ce-b105-0d0072df9c62
License:
http://www.springer.com/tdm
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 1
Finite Automata and Randomness
pp. 11
Properties of Right One-Way Jumping Finite Automata
pp. 24
Word Problem Languages for Free Inverse Monoids
pp. 37
Most Complex Deterministic Union-Free Regular Languages
pp. 49
Site-Directed Insertion: Decision Problems, Maximality and Minimality
pp. 62
Two-Way Automata over Locally Finite Semirings
pp. 75
A New Technique for Reachability of States in Concatenation Automata
pp. 88
Forward Injective Finite Automata: Exact and Random Generation of Nonisomorphic NFAs
pp. 101
On the Generation of 2-Polyominoes
pp. 114
A Local Limit Property for Pattern Statistics in Bicomponent Stochastic Models
pp. 126
Linear-Time Limited Automata
pp. 139
Cover Complexity of Finite Languages
pp. 151
On the Grammatical Complexity of Finite Languages
pp. 163
State Grammars with Stores
pp. 188
State Complexity of Unambiguous Operations on Deterministic Finite Automata
pp. 200
Cycle Height of Finite Automata
pp. 212
Finite Automata with Undirected State Graphs
pp. 224
Further Closure Properties of Input-Driven Pushdown Automata
pp. 237
State Complexity Characterizations of Parameterized Degree-Bounded Graph Connectivity, Sub-Linear Space Computation, and the Linear Space Hypothesis
Similar content
3,285
Use of the Diels-Alder adduct of pyrrole in organic synthesis. Formal racemic synthesis of Tamiflu.
Authors:
Akio Kamimura
,
Toshiki Nakano
Institutional asymmetry: How formal and informal institutions affect entrepreneurship in Bulgaria
Authors:
T. Vorley
,
N. Williams
Prepared for climate change? A method for the ex-ante assessment of formal responsibilities for climate adaptation in specific sectors
Authors:
C. Uittenbroek
,
H. K. Gilissen
,
P. P. J. Driessen
…
See all similar
Cited by
1
Context-free word problem semigroups
Authors:
Tara Brough
,
Alan Cain
,
Markus Pfeiffer
See all cited by