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
15
references
Top references
cited by
4
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
1,451
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
STACS 2005
Regular Tree Languages Definable in FO
other
Author(s):
Michael Benedikt
,
Luc Segoufin
Publication date
(Print):
2005
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
African Languages
Most cited references
15
Record
: found
Abstract
: not found
Article
: not found
On finite monoids having only trivial subgroups
M.P. Schützenberger
(1965)
0
comments
Cited
100
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Weak Second-Order Arithmetic and Finite Automata
J. Büchi
(1960)
0
comments
Cited
99
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Generalized finite automata theory with an application to a decision problem of second-order logic
J. Thatcher
,
J B WRIGHT
(1968)
0
comments
Cited
70
times
– based on
0
reviews
Review now
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2005
Pages
: 327-339
DOI:
10.1007/978-3-540-31856-9_27
SO-VID:
53c49b3c-aad5-4836-9e30-4b5a989f2182
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 1
Automorphisms of Finite Rings and Applications to Complexity of Problems
pp. 18
Algebraic Generating Functions in Enumerative Combinatorics and Context-Free Languages
pp. 36
Algorithmics in Exponential Time
pp. 57
Sampling Sub-problems of Heterogeneous Max-cut Problems and Approximation Algorithms
pp. 83
Counting in the Two Variable Guarded Logic with Transitivity
pp. 110
The Core of a Countably Categorical Structure
pp. 121
How Common Can Be Universality for Cellular Automata?
pp. 133
Cellular Automata: Real-Time Equivalence Between One-Dimensional Neighborhoods
pp. 145
On the Decidability of Temporal Properties of Probabilistic Pushdown Automata
pp. 158
Deciding Properties of Contract-Signing Protocols
pp. 170
Polylog-Time Reductions Decrease Dot-Depth
pp. 182
On the Computational Complexity of the Forcing Chromatic Number
pp. 194
More Efficient Queries in PCPs for NP and Improved Approximation Hardness of Maximum CSP
pp. 206
Three Optimal Algorithms for Balls of Three Colors
pp. 218
Cost Sharing and Strategyproof Mechanisms for Set Cover Games
pp. 231
On Weighted Balls-into-Bins Games
pp. 244
Computing Minimal Multi-homogeneous Bézout Numbers Is Hard
pp. 256
Dynamic Complexity Theory Revisited
pp. 269
Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size
pp. 281
Shortest Monotone Descent Path Problem in Polyhedral Terrain
pp. 293
Packet Buffering: Randomization Beats Deterministic Algorithms
pp. 305
Solving Medium-Density Subset Sum Problems in Expected Polynomial Time
pp. 315
Quantified Constraint Satisfaction, Maximal Constraint Languages, and Symmetric Polymorphisms
pp. 327
Regular Tree Languages Definable in FO
pp. 340
Recursive Markov Chains, Stochastic Grammars, and Monotone Systems of Nonlinear Equations
pp. 353
Connectivity for Wireless Agents Moving on a Cycle or Grid
pp. 365
Improved Algorithms for Dynamic Page Migration
pp. 377
Approximate Range Mode and Range Median Queries
pp. 389
Topological Automata
pp. 399
Minimizing NFA’s and Regular Expressions
pp. 412
Increasing Kolmogorov Complexity
pp. 422
Kolmogorov-Loveland Randomness and Stochasticity
pp. 434
Information Theory in Property Testing and Monotonicity Testing in Higher Dimension
pp. 448
On Nash Equilibria in Non-cooperative All-Optical Networks
pp. 460
Speed Scaling to Manage Temperature
pp. 472
The Complexity of Solving Linear Equations over a Finite Ring
pp. 485
A Lower Bound on the Complexity of Polynomial Multiplication Over Finite Fields
pp. 496
Characterizing TC0 in Terms of Infinite Groups
pp. 508
Fast Pruning of Geometric Spanners
pp. 521
The PIGs Full Monty – A Floor Show of Minimal Separators
pp. 545
Varieties of Codes and Kraft Inequality
pp. 557
Improving the Alphabet-Size in High Noise, Almost Optimal Rate List Decodable Codes
pp. 569
The Power of Commuting with Finite Sets of Words
pp. 581
Exact Quantum Algorithms for the Leader Election Problem
pp. 593
Robust Polynomials and Quantum Algorithms
pp. 605
Quantum Interactive Proofs with Competing Provers
pp. 617
Roundings Respecting Hard Constraints
pp. 629
Sorting Stably, In-Place, with O(n log n) Comparisons and O(n) Moves
pp. 641
Cycle Cover with Short Cycles
pp. 654
A Polynomial Time Algorithm for Minimum Cycle Basis in Directed Graphs
pp. 666
All-Pairs Nearly 2-Approximate Shortest-Paths in O(n 2 polylog n) Time
pp. 680
Pattern Occurrences in Multicomponent Models
pp. 693
Automatic Presentations for Finitely Generated Groups
Similar content
1,451
Integrated forward osmosis–membrane distillation (FO–MD) hybrid system for the concentration of protein solutions
Authors:
Tai-Shung Chung
,
Adrian Nugroho
,
May Teoh
…
Alteration of structure and function of ATP synthase and cytochrome c oxidase by lack of Fo-a and Cox3 subunits caused by mitochondrial DNA 9205delTA mutation.
Authors:
Josef Houštěk
,
Sara Seneca
,
Tomás Mrácek
…
National Institute fo Health and Care Excellence. Single Technology Appraisal Treosulfan with fludarabine for malignant disease before allogeneic stem cell transplant [ID1508].
Authors:
See all similar
Cited by
4
Algebra for Infinite Forests with an Application to the Temporal Logic EF
Authors:
Mikołaj Bojanczyk
,
Tomasz Idziaszek
Logic Meets Algebra: the Case of Regular Languages
Authors:
,
Forest Categories
Authors:
Howard Straubing
See all cited by