The chop of languages
From MaRDI portal
Publication:2358686
DOI10.1016/j.tcs.2017.02.002zbMath1377.68112OpenAlexW2591138383MaRDI QIDQ2358686
Sebastian Jakobi, Martin Kutrib, Markus Holzer
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
closure propertiescontext-free languagesregular languagesChomsky hierarchydescriptional complexityconcatenationlanguage classeschop operation
Related Items (4)
Conjugate word blending: formal model and experimental implementation by XPCR ⋮ Unnamed Item ⋮ Site-directed insertion: language equations and decision problems ⋮ State Complexity of Overlap Assembly
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On Goedel speed-up and succinctness of language representations
- Families of languages defined by ciliate bio-operations
- Self-assembly of strings and languages
- Minimality in template-guided recombination
- Reversal-bounded multipushdown machines
- Growing context-sensitive languages and Church-Rosser languages
- Closure and decidability properties of some language classes with respect to 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
- Transition graphs and the star-height of regular events
- Star height of certain families of regular events
- Generalized periodicity and primitivity for words
- Finite Automata, Digraph Connectivity, and Regular Expression Size
- Church-Rosser Thue systems and formal languages
- On the Succinctness of Different Representations of Languages
- Homomorphisms that preserve star height
- Chop Expressions and Discrete Duration Calculus
- Chop Operations and Expressions: Descriptional Complexity Considerations
- A helpful result for proving inherent ambiguity
- NONDETERMINISTIC DESCRIPTIONAL COMPLEXITY OF REGULAR LANGUAGES
- THE PHENOMENON OF NON-RECURSIVE TRADE-OFFS
- Developments in Language Theory
This page was built for publication: The chop of languages
