Home
Publishing
DrugRxiv
Drug Repurposing
Network Medicine
About
REPO4EU
Meet the team
Drug Repurposing Research Collection
Conference
Blog
My ScienceOpen
Sign in
Register
Dashboard
Search
Home
Publishing
DrugRxiv
Drug Repurposing
Network Medicine
About
REPO4EU
Meet the team
Drug Repurposing Research Collection
Conference
My ScienceOpen
Sign in
Register
Dashboard
Search
23
views
4
references
Top references
cited by
1
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
4,618
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Language and Automata Theory and Applications
Restarting Automata with Structured Output and Functional Generative Description
other
Author(s):
Martin Plátek
,
František Mráz
,
Markéta Lopatková
Publication date
(Print):
2010
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
Functional role of amyloid
Most cited references
4
Record
: found
Abstract
: not found
Book Chapter
: not found
Restarting Automata and Their Relations to the Chomsky Hierarchy
Friedrich Otto
(2003)
0
comments
Cited
6
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Book Chapter
: not found
Modeling Syntax of Free Word-Order Languages: Dependency Analysis by Reduction
Markéta Lopatková
,
Martin Plátek
,
Vladislav Kuboň
(2005)
0
comments
Cited
2
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Sorted dependency insertion grammars
Radu Gramatovici
,
Carlos Martin-Vide
(2006)
0
comments
Cited
2
times
– based on
0
reviews
Review now
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2010
Pages
: 500-511
DOI:
10.1007/978-3-642-13089-2_42
SO-VID:
f5792667-41a1-46fe-8d8a-8837b6ffb4d1
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 1
Complexity in Convex Languages
pp. 16
Three Learnable Models for the Description of Language
pp. 32
Arbology: Trees and Pushdown Automata
pp. 50
Analysis of Communicating Automata
pp. 58
Complexity of the Satisfiability Problem for a Class of Propositional Schemata
pp. 70
A Simple n-Dimensional Intrinsically Universal Quantum Cellular Automaton
pp. 82
A Fast Longest Common Subsequence Algorithm for Similar Strings
pp. 94
Abelian Square-Free Partial Words
pp. 106
Avoidable Binary Patterns in Partial Words
pp. 118
Equivalence and Inclusion Problem for Strongly Unambiguous Büchi Automata
pp. 130
Pregroup Grammars with Letter Promotions
pp. 142
A Hierarchical Classification of First-Order Recurrent Neural Networks
pp. 154
Choosing Word Occurrences for the Smallest Grammar Problem
pp. 166
Agreement and Cliticization in Italian: A Pregroup Analysis
pp. 178
Geometricity of Binary Regular Languages
pp. 190
On the Expressive Power of FO[ + ]
pp. 202
Finding Consistent Categorial Grammars of Bounded Value: A Parameterized Approach
pp. 214
Operator Precedence and the Visibly Pushdown Property
pp. 227
On the Maximal Number of Cubic Runs in a String
pp. 239
On the Hamiltonian Operators for Adiabatic Quantum Reduction of SAT
pp. 249
Parametric Metric Interval Temporal Logic
pp. 261
Short Witnesses and Accepting Lassos in ω-Automata
pp. 273
Grammar-Based Compression in a Streaming Model
pp. 285
Simplifying Regular Expressions
pp. 297
A Programming Language Tailored to the Specification and Solution of Differential Equations Describing Processes on Networks
pp. 309
The Inclusion Problem for Regular Expressions
pp. 321
Learnability of Automatic Classes
pp. 333
Untestable Properties Expressible with Four First-Order Quantifiers
pp. 344
The Copying Power of Well-Nested Multiple Context-Free Grammars
pp. 356
Post Correspondence Problem with Partially Commutative Alphabets
pp. 368
Reversible Pushdown Automata
pp. 380
String Extension Learning Using Lattices
pp. 392
The Equivalence Problem of Deterministic Multitape Finite Automata: A New Proof of Solvability Using a Multidimensional Tape
pp. 403
Primitive Words Are Unavoidable for Context-Free Languages
pp. 414
Modal Nonassociative Lambek Calculus with Assumptions: Complexity and Context-Freeness
pp. 426
Hard Counting Problems for Partial Words
pp. 439
Exact Analysis of Horspool’s and Sunday’s Pattern Matching Algorithms with Probabilistic Arithmetic Automata
pp. 451
SA-REPC – Sequence Alignment with Regular Expression Path Constraint
pp. 463
CD-Systems of Stateless Deterministic R(1)-Automata Accept All Rational Trace Languages
pp. 475
A Boundary between Universality and Non-universality in Extended Spiking Neural P Systems
pp. 488
Using Sums-of-Products for Non-standard Reasoning
pp. 500
Restarting Automata with Structured Output and Functional Generative Description
pp. 512
A Randomized Numerical Aligner (rNA)
pp. 524
Language-Based Comparison of Petri Nets with Black Tokens, Pure Names and Ordered Data
pp. 536
Verifying Complex Continuous Real-Time Systems with Coinductive CLP(R)
pp. 549
Incremental Building in Peptide Computing to Solve Hamiltonian Path Problem
pp. 561
Variable Automata over Infinite Alphabets
pp. 573
Some Minimality Results on Biresidual and Biseparable Automata
pp. 585
Extending Stochastic Context-Free Grammars for an Application in Bioinformatics
pp. 596
Chomsky-Schützenberger-Type Characterization of Multiple Context-Free Languages
pp. 608
Complexity of Guided Insertion-Deletion in RNA-Editing
Similar content
4,618
Restarting after COVID-19: A Data-driven Evaluation of Opening Scenarios
Authors:
Ashwin Aravindakshan
,
Jörn Boehnke
,
Ehsan Gholami
…
Frequency of post treatment control varies by antiretroviral therapy restart and viral load criteria
Authors:
Jesse M Fajnzylber
,
Radwa R. Sharaf
,
John N Hutchinson
…
A Hierarchy of Polynomial-Time Computable Simulations for Automata
Authors:
Kousha Etessami
See all similar
Cited by
1
Deleting Deterministic Restarting Automata with Two Windows
Authors:
František Mráz
,
Friedrich Otto
See all cited by