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
41
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,980
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,980
Inference of Event-Recording Automata Using Timed Decision Trees
Authors:
Olga Grinchtein
,
Bengt. Jonsson
,
Paul Pettersson
Control of cellular automata
Authors:
Raul Rechtman
,
Franco Bagnoli
,
Samira El Yacoubi
On real-time cellular automata and trellis automata
Authors:
C. Choffrut
,
K. Čulík
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