10 Hits in 3.0 sec

Parallel Hyperedge Replacement Grammars [article]

Graham Campbell
2021 arXiv   pre-print
Motivated by this, we introduce a new language class, the parallel hyperedge replacement string languages, containing all multiple context-free and ET0L languages.  ...  generated by various families of parallel hyperedge replacement grammars, laying the foundations for future work in this area.  ...  guidance, Annegret Habel and Meng-Che Ho for their helpful email discussions regarding hyperedge replacement and surface groups, respectively, and Murray Elder for introducing me to MCF languages.  ... 
arXiv:2101.02310v1 fatcat:qivtxhs2eje5vclhhnq2iohfji


2006 International Journal of Foundations of Computer Science  
For the class of P systems using inhibitors, generating families of sets of vectors of numbers, the equivalence with the family of Parikh sets of ET0L languages is presented.  ...  In case of P systems with noncooperative promoted rules even if an upper bound was not given, the inclusion of the family P sET 0L was proved.  ...  The author is very thankful to all colleagues from the Research Group on Natural Computing, University of Seville for providing a very good scientific atmosphere.  ... 
doi:10.1142/s0129054106003772 fatcat:ayaqtp7gtfeqnbkkaygtbpmk3e

Two collapsing hierarchies of subregularly tree controlled languages

Jürgen Dassow, Ralf Stiebe, Bianca Truthe
2009 Theoretical Computer Science  
belongs to a given regular language.  ...  We show that the corresponding hierarchy of tree controlled languages collapses already at the second level.  ...  Among the classical decision problems only membership is decidable for context-sensitive languages which is known to be PSPACE-complete.  ... 
doi:10.1016/j.tcs.2009.03.005 fatcat:nrevoac4wfalbhadob66gdrixi

L Systems [chapter]

Lila Kari, Grzegorz Rozenberg, Arto Salomaa
1997 Handbook of Formal Languages  
Membership, emptiness and niteness are decidable for ET0L languages, and so are the regularity and context-freeness problem for D0L languages and the D0L-ness problem for context-free languages.  ...  It was known already in 1973 that ET0L is included in the family of indexed languages, for which membership, emptiness and niteness were known to be decidable already in the 60's.  ... 
doi:10.1007/978-3-642-59136-5_5 fatcat:5evlmahr75dadkiqepxf7rqkf4

Algorithmic Problems in Group Theory (Dagstuhl Seminar 19131)

Volker Diekert, Olga Kharlampovich, Markus Lohrey, Alexei Myasnikov, Michael Wagner
2019 Dagstuhl Reports  
Note that such a notion of regular subsets is unlikely to exist for much more general wreath products K G: In order for membership in rational subsets of K G to be decidable, either K or G has to be a  ...  Is there an algorithm that, given a finite set of words v 1 , . . ., v k ∈ F (X) generating a subgroupH = v 1 , . . . , v k ≤ G, decides whether or not [G : H] < ∞?  ...  And it is not difficult to see that the Stallings graph for Im(g ∞ ) is a subgraph of Im(g n ) for some big enough n.  ... 
doi:10.4230/dagrep.9.3.83 dblp:journals/dagstuhl-reports/DiekertKLM19 fatcat:7b3cwlpo6zdsxfzhiznob5cvsi

Reference List of Indexed Articles

2001 Information Processing Letters  
Linna, The D0L-ness for context-free languages is decidable 5 (5) (1976) 149-151 242. J. Duske, R. Parchmann and H. Schumacher, A pattern representation of indexed languages 5 (5) (1976) 152-154 243.  ...  Yehudai, A note on the pumping lemma for regular languages 9 (3) (1979) 135-136 498. K.  ... 
doi:10.1016/s0020-0190(01)00177-6 fatcat:vksyqyokdzdztflaez5hlnchxy

A Logic for Document Spanners

Dominik D. Freydenberger
2018 Theory of Computing Systems  
Acknowledgements The author thanks Wim Martens for helpful comments and discussions, Benny Kimelfeld for answering questions, and the anonymous reviewers of this and the conference version for their insightful  ...  Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (, which permits unrestricted use, distribution  ...  A short language theoretic digression that provides a little more context: Every EDT0L-language is an ET0L-language, hence an indexed language (cf.  ... 
doi:10.1007/s00224-018-9874-1 fatcat:qi7zvzskxjh6fejildql4syd3m

Tree Automata [article]

Ferenc Gécseg, Magnus Steinby
2015 arXiv   pre-print
This is a reissue of the book Tree Automata by F. G\'ecseg and M. Steinby originally published in 1984 by Akad\'emiai Kiad\'o, Budapest.  ...  Hence the membership of a ΣX-tree t in the local forest Loc(R, F ) can be decided by testing for the local properties root(t) ∈ R and fork(t) ⊆ F .  ...  The devices used for producing the tree languages include regular tree grammars, ET0L tree grammars, branching tree grammars, and tree transducers.  ... 
arXiv:1509.06233v1 fatcat:ejhy6a7h2fcatcdfxv3hylresu

Comparison-Free Polyregular Functions

Nguyễn, Lê Thành Dũng (Tito), Camille Noûs, Pierre Pradic, Nikhil Bansal, Emanuela Merelli, James Worrell
We prove that a function can be obtained by composing such transducers together if and only if it is polyregular, and that k-layered SSTs (or k-marble transducers) are closed under "map" and equivalent  ...  Our motivation for studying this class comes from another characterization, which we merely mention here but prove elsewhere, based on a λ-calculus with a linear type system.  ...  Is there an algorithm taking as input a (code for a) pebble transducer which decides whether the corresponding function Σ * → Γ * is comparison-free or not?  ... 
doi:10.4230/lipics.icalp.2021.139 fatcat:vxlm5ruz5vgynlve7kkjvbxtnq

Dagstuhl Reports, Volume 9, Issue 3, March 2019, Complete Issue [article]

For example, two seconds is the threshold adopted by government agencies for risky off-road glances [1], but this threshold is based on research conducted in non-automated vehicles.  ...  Our main tool is an improvement of Chang's lemma for sparse Boolean functions.  ...  Note that such a notion of regular subsets is unlikely to exist for much more general wreath products K G: In order for membership in rational subsets of K G to be decidable, either K or G has to be a  ... 
doi:10.4230/dagrep.9.3 fatcat:2tpapmq2rfdsjpygzyvhw2l6ei