ScienceOpen:
research and publishing network
For Publishers
Discovery
Metadata
Peer review
Hosting
Publishing
For Researchers
Join
Publish
Review
Collect
My ScienceOpen
Sign in
Register
Dashboard
Blog
About
Search
Advanced search
My ScienceOpen
Sign in
Register
Dashboard
Search
Search
Advanced search
For Publishers
Discovery
Metadata
Peer review
Hosting
Publishing
For Researchers
Join
Publish
Review
Collect
Blog
About
6
views
15
references
Top references
cited by
0
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,792
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Parallelogram Morphisms and Circular Codes
other
Author(s):
Alexandre Blondin Massé
,
Mélodie Lapointe
,
Hugo Tremblay
Publication date
(Online):
February 26 2016
Publisher:
Springer International Publishing
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
15
Record
: found
Abstract
: not found
Book
: not found
Graph Theory
Reinhard Diestel
(2010)
0
comments
Cited
76
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Book
: not found
Combinatorics on Words
M. Lothaire
(2009)
0
comments
Cited
24
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Codes with bounded synchronization delay
Solomon W. Golomb
,
Basil Gordon
(1965)
0
comments
Cited
14
times
– based on
0
reviews
Review now
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2016
Publication date (Online):
February 26 2016
Pages
: 221-232
DOI:
10.1007/978-3-319-30000-9_17
SO-VID:
537e0eb5-bc81-42cc-81c4-45428b7acb7a
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 3
Non-Zero Sum Games for Reactive Synthesis
pp. 24
Tangles and Connectivity in Graphs
pp. 42
Restricted Turing Machines and Language Recognition
pp. 57
Automata for Ontologies
pp. 63
Reasoning with Prototypes in the Description Logic $${\mathcal {ALC}}$$ ALC Using Weighted Tree Automata
pp. 76
$$+\omega $$ + ω -Picture Languages Recognizable by Büchi-Tiling Systems
pp. 89
A Logical Characterization for Dense-Time Visibly Pushdown Automata
pp. 102
A Complexity Measure on Büchi Automata
pp. 114
Compositional Bisimulation Minimization for Interval Markov Decision Processes
pp. 127
A Weighted MSO Logic with Storage Behaviour and Its Büchi-Elgot-Trakhtenbrot Theorem
pp. 143
Colored Nested Words
pp. 156
Input-Driven Queue Automata with Internal Transductions
pp. 168
Periodic Generalized Automata over the Reals
pp. 181
Minimal Separating Sequences for All Pairs of States
pp. 194
Forkable Regular Expressions
pp. 207
On the Levenshtein Automaton and the Size of the Neighbourhood of a Word
pp. 221
Parallelogram Morphisms and Circular Codes
pp. 233
On Del-Robust Primitive Partial Words with One Hole
pp. 245
Optimal Bounds for Computing $$\alpha $$ α -gapped Repeats
pp. 259
On XOR Lemma for Polynomial Threshold Weight and Length
pp. 270
The Beachcombers’ Problem: Walking and Searching from an Inner Point of a Line
pp. 283
Using Duality in Circuit Complexity
pp. 295
The Minimum Entropy Submodular Set Cover Problem
pp. 307
On the Capacity of Capacitated Automata
pp. 320
On Limited Nondeterminism and ACC Circuit Lower Bounds
pp. 330
The Complexity of Induced Tree Reconfiguration Problems
pp. 345
The Missing Case in Chomsky-Schützenberger Theorem
pp. 359
Homomorphic Characterizations of Indexed Languages
pp. 371
Ogden’s Lemma, Multiple Context-Free Grammars, and the Control Language Hierarchy
pp. 387
Steganography Based on Pattern Languages
pp. 400
Inferring a Relax NG Schema from XML Documents
pp. 412
Noise Free Multi-armed Bandit Game
pp. 427
Properties of Regular DAG Languages
pp. 439
Normal Form on Linear Tree-to-Word Transducers
pp. 452
A Kleene Theorem for Weighted Tree Automata over Tree Valuation Monoids
pp. 464
Hankel Matrices for Weighted Visibly Pushdown Automata
pp. 478
Linear Context-Free Tree Languages and Inverse Homomorphisms
pp. 493
Scalar Ambiguity and Freeness in Matrix Semigroups over Bounded Languages
pp. 506
The Word Problem for HNN-extensions of Free Inverse Semigroups
pp. 521
Between a Rock and a Hard Place – Uniform Parsing for Hyperedge Replacement DAG Grammars
pp. 533
An Error Correcting Parser for Context Free Grammars that Takes Less Than Cubic Time
pp. 549
Accurate Approximate Diagnosability of Stochastic Systems
pp. 562
Proof–Based Synthesis of Sorting Algorithms for Trees
pp. 579
Reversible Shrinking Two-Pushdown Automata
pp. 592
Reachability in Resource-Bounded Reaction Systems
pp. 603
Canonical Multi-target Toffoli Circuits
Similar content
1,792
Dualizable algebras with parallelogram terms
Authors:
Keith A. Kearnes
,
Agnes Szendrei
Meeting report of the EC/US workshop on genetic risk assessment: “Human genetic risks from exposure to chemicals, focusing on the feasibility of a parallelogram approach”☆
Authors:
M. WATERS
,
C. Nolan
The intensity distribution caused by image aberrations of mass spectrometers for beams filling parallelogram-like phase-space areas
Authors:
H. Wöllnik
See all similar