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
12
views
24
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
4,702
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Descriptional Complexity of Formal Systems
Further Closure Properties of Input-Driven Pushdown Automata
other
Author(s):
Alexander Okhotin
,
Kai Salomaa
Publication date
(Online):
July 11 2018
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
Collective Dynamics
Most cited references
24
Record
: found
Abstract
: not found
Article
: not found
Ordering by Divisibility in Abstract Algebras
Graham Higman
(1952)
0
comments
Cited
141
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Conference Proceedings
: not found
Visibly pushdown languages
Rajeev Alur
,
P. Madhusudan
(2004)
0
comments
Cited
64
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Adding nesting structure to words
Rajeev Alur
,
P. Madhusudan
(2009)
0
comments
Cited
45
times
– based on
0
reviews
Review now
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2018
Publication date (Online):
July 11 2018
Pages
: 224-236
DOI:
10.1007/978-3-319-94631-3_19
SO-VID:
fdc81cf9-a117-47ba-b616-8cbc40e84d2e
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
4,702
Inference of Event-Recording Automata Using Timed Decision Trees
Authors:
Olga Grinchtein
,
Bengt. Jonsson
,
Paul Pettersson
Land use and land cover change dynamics and modeling future urban growth using cellular automata model over isfahan metropolitan area of Iran
Authors:
Mahdavi Estalkhsari
Fast algorithm for multiple-circle detection on images using learning automata
Authors:
E Cuevas
,
M Pérez-Cisneros
,
V. Osuna-Enciso
…
See all similar
Cited by
1
Towards Exact State Complexity Bounds for Input-Driven Pushdown Automata
Authors:
Galina Jirásková
,
Alexander Okhotin
See all cited by