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
25
views
16
references
Top references
cited by
7
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,499
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Fundamentals of Computation Theory
Piecewise and Local Threshold Testability of DFA
other
Author(s):
A. N. Trahtman
Publication date
(Online):
August 2 2001
Publisher:
Springer Berlin Heidelberg
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
Huddersfield Books
Most cited references
16
Record
: found
Abstract
: not found
Book Chapter
: not found
Piecewise testable events
Imre Simon
(1975)
0
comments
Cited
47
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors
Tom Head
(1987)
0
comments
Cited
39
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Characterizations of locally testable events
Imre Simon
,
J.A. Brzozowski
(1973)
0
comments
Cited
32
times
– based on
0
reviews
Review now
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2001
Publication date (Online):
August 2 2001
Pages
: 347-358
DOI:
10.1007/3-540-44669-9_33
SO-VID:
ff5a7454-e0d1-4382-8507-842514316bf4
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 396
Two-States Bilinear Intrinsically Universal Cellular Automata
pp. 445
On Robust Algorithms for the Maximum Weight Stable Set Problem
pp. 59
On Computational Power of Quantum Branching Programs
pp. 347
Piecewise and Local Threshold Testability of DFA
Similar content
3,499
The differential immunomodulating effects of levan and dfa-iv on macrophage function
Authors:
S-K PARK
,
K-H Jang
,
M.-H. Kim
…
Generating DFA Construction Problems Automatically
Authors:
Varun Shenoy
,
Ullas Aparanji
,
K. Sripradha
…
Adaptively Secure ABE for DFA from k-Lin and More
Authors:
Junqing Gong
,
Hoeteck Wee
See all similar
Cited by
7
Efficient Separability of Regular Languages by Subsequences and Suffixes
Authors:
Wojciech Czerwiński
,
Wim Martens
,
Tomáš Masopust
Alternative Automata Characterization of Piecewise Testable Languages
Authors:
Ondřej Klíma
,
Libor Polák
Separating Regular Languages by Piecewise Testable and Unambiguous Languages
Authors:
Thomas Place
,
Lorijn van Rooijen
,
Marc Zeitoun
See all cited by