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
7
views
13
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,874
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Implementation and Application of Automata: 21st International Conference, CIAA 2016, Seoul, South Korea, July 19-22, 2016, Proceedings
Kuratowski Algebras Generated by Prefix-Free Languages
other
Author(s):
Jozef Jirásek
,
Juraj Šebej
Publication date
(Online):
July 06 2016
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
African Languages
Most cited references
13
Record
: found
Abstract
: not found
Book Chapter
: not found
Regular Languages
Sheng Yu
(1997)
0
comments
Cited
58
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Sur l'opération Ā de l'Analysis Situs
Casimir Kuratowski
(1922)
0
comments
Cited
10
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
CLOSURES IN FORMAL LANGUAGES AND KURATOWSKI'S THEOREM
JANUSZ BRZOZOWSKI
,
ELYOT GRANT
,
JEFFREY SHALLIT
(2011)
0
comments
Cited
5
times
– based on
0
reviews
Review now
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2016
Publication date (Online):
July 06 2016
Pages
: 150-162
DOI:
10.1007/978-3-319-40946-7_13
SO-VID:
f75791dc-f63c-4358-bea1-8f17c57100b6
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 3
Decision Problems for Finite Automata over Infinite Algebraic Structures
pp. 15
The Degree of Irreversibility in Deterministic Finite Automata
pp. 27
Deterministic Stack Transducers
pp. 39
Computing the Expected Edit Distance from a String to a PFA
pp. 51
Derived-Term Automata of Multitape Rational Expressions
pp. 64
Solving Parity Games Using an Automata-Based Algorithm
pp. 77
Ternary Equational Languages
pp. 89
Problems on Finite Automata and the Exponential Time Hypothesis
pp. 101
A Practical Algorithm for the Uniform Membership Problem of Labeled Multidigraphs of Tree-Width 2 for Spanning Tree Automata
pp. 113
A Practical Simulation Result for Two-Way Pushdown Automata
pp. 125
Nondeterministic Complexity of Operations on Closed and Ideal Languages
pp. 138
On Bounded Semilinear Languages, Counter Machines, and Finite-Index ET0L
pp. 150
Kuratowski Algebras Generated by Prefix-Free Languages
pp. 163
A Logical Characterization of Small 2NFAs
pp. 176
Experiments with Synchronizing Automata
pp. 189
Implementation of Code Properties via Transducers
pp. 202
On Synchronizing Automata and Uniform Distribution
pp. 213
Looking for Pairs that Hard to Separate: A Quantum Approach
pp. 224
Prefix Distance Between Regular Languages
pp. 236
Complexity of Sets of Two-Dimensional Patterns
pp. 248
The Complexity of Fixed-Height Patterned Tile Self-assembly
pp. 260
Derivative-Based Diagnosis of Regular Expression Ambiguity
pp. 273
Regular Approximation of Weighted Linear Nondeleting Context-Free Tree Languages
pp. 285
Derivatives for Enhanced Regular Expressions
pp. 298
Weighted Restarting Automata as Language Acceptors
pp. 310
Enhancing Practical TAG Parsing Efficiency by Capturing Redundancy
pp. 322
Analyzing Matching Time Behavior of Backtracking Regular Expression Matchers by Using Ambiguity of NFA
Similar content
3,874
Computability on the countable ordinals and the Hausdorff-Kuratowski theorem
Authors:
Arno Pauly
Kuratowski's theorem
Authors:
Carsten Thomassen
A Kuratowski closure-complement variant whose solution is independent of ZF
Authors:
Michael Cohen
,
Todd Johnson
,
Adam Kral
…
See all similar