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
26
views
14
references
Top references
cited by
8
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,620
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Developments in Language Theory
Factorization Forests
other
Author(s):
Mikołaj Bojańczyk
Publication date
(Print):
2009
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
ScienceOpen Research
Most cited references
14
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
Factorization forests of finite height
Imre Simon
(1990)
0
comments
Cited
34
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Limitedness theorem on finite automata with distance functions
K. Hashiguchi
(1982)
0
comments
Cited
22
times
– based on
0
reviews
Review now
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2009
Pages
: 1-17
DOI:
10.1007/978-3-642-02737-6_1
SO-VID:
8b86b0fb-6224-4374-a2c2-7cbf36900958
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 1
Factorization Forests
pp. 18
Weighted versus Probabilistic Logics
pp. 39
Post Correspondence Problem and Small Dimensional Matrices
pp. 47
Size Complexity of Two-Way Finite Automata
pp. 67
Matrix Mortality and the Černý-Pin Conjecture
pp. 81
A Quadratic Upper Bound on the Size of a Synchronizing Word in One-Cluster Automata
pp. 91
Regular Languages Definable by Majority Quantifiers with Two Variables
pp. 103
The Inclusion Problem of Context-Free Languages: Some Tractable Cases
pp. 113
On the Complexity of Deciding Avoidability of Sets of Partial Words
pp. 125
Closures in Formal Languages and Kuratowski’s Theorem
pp. 145
Rich and Periodic-Like Words
pp. 156
Traces of Control-Flow Graphs
pp. 170
Left and Right Synchronous Relations
pp. 183
An Extension of the Lyndon Schützenberger Result to Pseudoperiodic Words
pp. 195
Asymptotic Cellular Complexity
pp. 207
Strongly Regular Grammars and Regular Approximation of Context-Free Languages
pp. 221
Powers of Regular Languages
pp. 228
Existence and Nonexistence of Descriptive Patterns
pp. 240
On Stateless Multihead Finite Automata and Multihead Pushdown Automata
pp. 252
On Negative Bases
pp. 264
Crucial Words for Abelian Powers
pp. 276
Tight Bounds on the Descriptional Complexity of Regular Expressions
pp. 288
Subshifts, Languages and Logic
pp. 300
Magic Numbers and Ternary Alphabet
pp. 312
The Pumping Lemma for Well-Nested Multiple Context-Free Languages
pp. 326
The Support of a Recognizable Series over a Zero-Sum Free, Commutative Semiring Is Recognizable
pp. 334
A Game-Theoretic Characterization of Boolean Grammars
pp. 348
Word Equations with One Unknown
pp. 360
On Equations over Sets of Numbers and Their Limitations
pp. 372
Some Remarks on Superposition Based on Watson-Crick-Like Complementarity
pp. 384
A Weighted μ-Calculus on Words
pp. 396
Branching-Time Temporal Logics with Minimal Model Quantifiers
pp. 410
Simulations by Time-Bounded Counter Machines
pp. 419
Weighted Timed MSO Logics
pp. 431
Balanced Words Having Simple Burrows-Wheeler Transform
pp. 443
On the Complexity of Hmelevskii’s Theorem and Satisfiability of Three Unknown Equations
pp. 454
Definability in the Infix Order on Words
pp. 466
Two-Sided Bounds for the Growth Rates of Power-Free Languages
pp. 478
On the Decidability of the Equivalence for a Certain Class of Transducers
pp. 490
Erasing in Petri Net Languages and Matrix Grammars
Similar content
2,620
Interconnections among rural practices and Food-Water-Energy Security Nexus in the Atlantic Forest biome
Authors:
Gabriela Teixeira Duarte
,
Julia Camara Assis
,
Rafaela Aparecida da Silva
…
Influence of an Ice Storm on Aboveground Biomass of Subtropical Evergreen Broadleaf Forest in Lechang, Nanling Mountains of Southern China
Authors:
Yasushi Morikawa
,
Kazuo Tanaka
,
Motoshi Hiratsuka
…
Probability of Spring Frosts, Not Growing Degree-Days, Drives Onset of Spruce Bud Burst in Plantations at the Boreal-Temperate Forest Ecotone
Authors:
Benjamin Marquis
,
Yves Bergeron
,
Martin Simard
…
See all similar
Cited by
8
Green’s Relations and Their Use in Automata Theory
Authors:
Thomas Colcombet
Going Higher in the First-Order Quantifier Alternation Hierarchy on Words
Authors:
Thomas Place
,
Marc Zeitoun
Tight Worst-Case Bounds for Polynomial Loop Programs
Authors:
Amir Ben-Amram
,
Geoff Hamilton
See all cited by