The chop of languages
From MaRDI portal
Publication:2358686
DOI10.1016/J.TCS.2017.02.002zbMATH Open1377.68112OpenAlexW2591138383MaRDI QIDQ2358686FDOQ2358686
Authors: Markus Holzer, Sebastian Jakobi, Martin Kutrib 
Publication date: 15 June 2017
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2017.02.002
Recommendations
Chomsky hierarchycontext-free languagesdescriptional complexityregular languagesconcatenationclosure propertieslanguage classeschop operation
Cites Work
- Title not available (Why is that?)
- Reversal-bounded multipushdown machines
- State complexity of regular languages
- Finite Automata, Digraph Connectivity, and Regular Expression Size
- Growing context-sensitive languages and Church-Rosser languages
- Title not available (Why is that?)
- On the Succinctness of Different Representations of Languages
- Transition graphs and the star-height of regular events
- Descriptional complexity -- an introductory survey
- THE PHENOMENON OF NON-RECURSIVE TRADE-OFFS
- On Goedel speed-up and succinctness of language representations
- NONDETERMINISTIC DESCRIPTIONAL COMPLEXITY OF REGULAR LANGUAGES
- Generalized periodicity and primitivity for words
- Title not available (Why is that?)
- Church-Rosser Thue systems and formal languages
- Self-assembly of strings and languages
- Title not available (Why is that?)
- Closure and decidability properties of some language classes with respect to ciliate bio-operations.
- Families of languages defined by ciliate bio-operations
- On the descriptional power of heads, counters, and pebbles
- The Church-Rosser languages are the deterministic variants of the growing context-sensitive languages
- Star height of certain families of regular events
- A helpful result for proving inherent ambiguity
- Developments in Language Theory
- Homomorphisms that preserve star height
- Minimality in template-guided recombination
- Title not available (Why is that?)
- Chop operations and expressions: descriptional complexity considerations
- Chop expressions and discrete duration calculus
Cited In (10)
- Title not available (Why is that?)
- More fragments of language.
- State complexity of overlap assembly
- Fragments of language
- State complexity of chop operations on unary and finite languages
- The chop of languages
- Site-directed insertion: language equations and decision problems
- Conjugate word blending: formal model and experimental implementation by XPCR
- Chop operations and expressions: descriptional complexity considerations
- Descriptional complexity of chop operations on unary and finite languages
This page was built for publication: The chop of languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2358686)
