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
42
views
0
references
Top references
cited by
29
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
2,043
similar
All similar
Record
: found
Abstract
: not found
Book
: not found
Finite Automata, Formal Logic, and Circuit Complexity
other
Author(s):
Howard Straubing
Publication date
(Print):
1994
Publisher:
Birkhäuser Boston
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
ScienceOpen Research
Author and book information
Book
ISBN (Print):
978-1-4612-6695-2
ISBN (Electronic):
978-1-4612-0289-9
Publication date (Print):
1994
DOI:
10.1007/978-1-4612-0289-9
SO-VID:
ae0047d0-0990-4416-8722-b2828da9974d
License:
http://www.springer.com/tdm
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 1
Mathematical Preliminaries
pp. 9
Formal Languages and Formal Logic
pp. 21
Finite Automata
pp. 39
Model-Theoretic Games
pp. 53
Finite Semigroups
pp. 79
First-Order Logic
pp. 99
Modular Quantifiers
pp. 127
Circuit Complexity
pp. 155
Regular Languages and Circuit Complexity
Similar content
2,043
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
29
A SURVEY ON SMALL FRAGMENTS OF FIRST-ORDER LOGIC OVER FINITE WORDS
Authors:
VOLKER DIEKERT
,
PAUL GASTIN
,
MANFRED KUFLEITNER
Formal-Language-Constrained Path Problems
Authors:
Madhav V. Marathe
,
Riko Jacob
,
Chris Barrett
On Logical Descriptions of Regular Languages
Authors:
Howard Straubing
See all cited by