Filters








46 Hits in 1.5 sec

A note on recurrent words

Karel Culik, Derick Wood
<span title="">1981</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/fbkexx2qg5anljkxraobuswdq4" style="color: black;">Information and Control</a> </i> &nbsp;
We introduce the notion of recurrent words in T0L systems. We prove that for an arbitrarily given T0L system G and an arbitrarily given word w it is decidable whether or not w is recurrent in G.  ...  Directly from the definition and Theorem 3.3 II Since the family of ETOL languages contains the family of T0L languages, is closed under intersection with regular sets and emptiness is decidable, Corollary  ...  Then L(G, M) the language generated by (G, M) is defined similarly. Given an MDTOL system we can associate a specific T0L scheme with it. Let (G, M) be as defined above.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0019-9958(81)90098-x">doi:10.1016/s0019-9958(81)90098-x</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/26wepkiytrb5rhihvm2dvvd5zi">fatcat:26wepkiytrb5rhihvm2dvvd5zi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20171005150356/http://publisher-connector.core.ac.uk/resourcesync/data/elsevier/pdf/f5d/aHR0cDovL2FwaS5lbHNldmllci5jb20vY29udGVudC9hcnRpY2xlL3BpaS9zMDAxOTk5NTg4MTkwMDk4eA%3D%3D.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/84/fe/84fe30270baf45b9ea5a4ccd31a40d1569d580f4.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0019-9958(81)90098-x"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Theory of L systems: From the point of view of formal language theory [chapter]

G. Rozenberg
<span title="">1974</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
Finally, the notion of determinism studied in this theory differs from the usual one studied in formal language theory.  ...  set of control words then the set of all words obtained from the words of LI by applying mappings from ~ is an ETOL language.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-06867-8_1">doi:10.1007/3-540-06867-8_1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/pymonbceyra37o37dymgntem6u">fatcat:pymonbceyra37o37dymgntem6u</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20181030042424/https://link.springer.com/content/pdf/10.1007%2F3-540-06867-8_1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/64/66/646667f058c7cd327c2d0e39eb41e5fabdef2dc9.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-06867-8_1"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Membrane Systems with External Control [chapter]

Robert Brijder, Matteo Cavaliere, Agustín Riscos-Núñez, Grzegorz Rozenberg, Dragoş Sburlan
<span title="">2006</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
In this way, using a set of control strings (a control program), one generates a set of numbers.  ...  We consider the idea of controlling the evolution of a membrane system.  ...  We denote by E(rc)T 0L the family of languages generated by E(rc)T0L systems, and by E(cf c)T 0L the family of languages generated by E(cfc)T0L systems.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/11963516_14">doi:10.1007/11963516_14</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/7ohfe3re2naefloqirpsdiyyt4">fatcat:7ohfe3re2naefloqirpsdiyyt4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20061011084410/http://wmc7.liacs.nl/proceedings/WMC7Riscos-Nunez.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/65/47/6547b42cfe01f997b3f38220c247aeed56c58a43.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/11963516_14"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

The complexity of solution sets to equations in hyperbolic groups [article]

Laura Ciobanu, Murray Elder
<span title="2020-10-25">2020</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
We show that the full set of solutions to systems of equations and inequations in a hyperbolic group, as shortlex geodesic words (or any regular set of quasigeodesic normal forms), is an EDT0L language  ...  groups with the work of computer scientists including Plandowski, Jeż, Diekert and others on PSPACE algorithms to solve equations in free monoids and groups using compression, and involves an intricate language-theoretic  ...  = {w ∈ Σ * | c 0 → L(M) w} is the corresponding E(D)T0L language.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2001.09591v4">arXiv:2001.09591v4</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/7ouhk4mlqrhh5g6ufyh2ggc6ka">fatcat:7ouhk4mlqrhh5g6ufyh2ggc6ka</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20201029195043/https://arxiv.org/pdf/2001.09591v4.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/b4/01/b40124c6aad870499d9dfd37e41343d9c6c4f61f.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2001.09591v4" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Solutions Sets to Systems of Equations in Hyperbolic Groups Are EDT0L in PSPACE

Laura Ciobanu, Murray Elder, Michael Wagner
<span title="2019-07-08">2019</span> <i > <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/pf6v2q6ji5h7birkbrtpdc2uhy" style="color: black;">International Colloquium on Automata, Languages and Programming</a> </i> &nbsp;
We show that the full set of solutions to systems of equations and inequations in a hyperbolic group, with or without torsion, as shortlex geodesic words, is an EDT0L language whose specification can be  ...  The present work gives an essentially optimal formal language description for all solutions in all hyperbolic groups, and an explicit and surprising low space complexity to compute them.  ...  The set R is called the rational control, the symbol c 0 the start symbol and C the extended alphabet. Space complexity for E(D)T0L Let f : N → N be a function.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4230/lipics.icalp.2019.110">doi:10.4230/lipics.icalp.2019.110</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/icalp/CiobanuE19.html">dblp:conf/icalp/CiobanuE19</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/mpfuafgod5atphn7rywzw2ogn4">fatcat:mpfuafgod5atphn7rywzw2ogn4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200709093450/https://opus.lib.uts.edu.au/bitstream/10453/133072/1/preview%20%282%29.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/87/29/8729c5c24eea8ba95c344a6fc7ac348577331908.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4230/lipics.icalp.2019.110"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Automatic Generation of Vectorized Montgomery Algorithm [article]

Lingchuan Meng
<span title="2016-09-04">2016</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
T3h T3l T1h T1l T3h T1h T2h T0h T3l T1l T2l T0l T3h T2h T1h T0h T3l T2l T1l T0l 2-way multiplication ( mm shuffle ps) T2h T2l T0h T0l T3h T3l T1h T1l T2h T0h T2l T0l T3h T1h T3l  ...  Roughly speaking, the type unification rules are similar to the type conversions in languages like C when two arguments of the operation are of different types.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1609.00999v1">arXiv:1609.00999v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/nnenh5jk6rg6vmtwrc26bzdpki">fatcat:nnenh5jk6rg6vmtwrc26bzdpki</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20191023161403/https://arxiv.org/pdf/1609.00999v1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/7e/e2/7ee25b851cd9baca6c9283e57fff11928b0253f4.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1609.00999v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Solutions sets to systems of equations in hyperbolic groups are EDT0L in PSPACE [article]

Laura Ciobanu, Murray Elder
<span title="2019-05-02">2019</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
We show that the full set of solutions to systems of equations and inequations in a hyperbolic group, with or without torsion, as shortlex geodesic words, is an EDT0L language whose specification can be  ...  The present work gives an essentially optimal formal language description for all solutions in all hyperbolic groups, and an explicit and surprising low space complexity to compute them.  ...  The set R is called the rational control, the symbol c 0 the start symbol and C the extended alphabet. 4.2. Space complexity for E(D)T0L. Let f : N → N be a function.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1902.07349v2">arXiv:1902.07349v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/lobvc4l4j5f4jhbscvawifj2ye">fatcat:lobvc4l4j5f4jhbscvawifj2ye</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200824161207/https://arxiv.org/pdf/1902.07349v2.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/d2/9c/d29cc8b8723b86c21df565364de9d8a9138655a4.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1902.07349v2" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Text Augmentation for Language Models in High Error Recognition Scenario [article]

Karel Beneš, Lukáš Burget
<span title="2020-11-11">2020</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
We examine the effect of data augmentation for training of language models for speech recognition.  ...  Additionally, we investigate into the behavior of perplexity estimated on augmented data, but conclude that it gives no better prediction of the final error rate.  ...  Finally, a control experiment with target augmentations reached approx. 0.5 % abs. improvement.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2011.06056v1">arXiv:2011.06056v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/m7vazqkotrcm5a4jifhsmbnvv4">fatcat:m7vazqkotrcm5a4jifhsmbnvv4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20201114093543/https://arxiv.org/pdf/2011.06056v1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/a9/59/a959b6a45dbb55464abcb94e6fde5f4fef236b5b.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2011.06056v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

FURTHER RESULTS ON P SYSTEMS WITH PROMOTERS/INHIBITORS

DRAGOŞ SBURLAN
<span title="">2006</span> <i title="World Scientific Pub Co Pte Lt"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/yhcgkcmjlvfovferf3in5mkmpq" style="color: black;">International Journal of Foundations of Computer Science</a> </i> &nbsp;
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.  ...  Adding a number of tables yields an infinite hierarchy of subclasses of the class of T0L languages. In turn, every ET0L language can be generated by an ET0L system with only two tables.  ...  Thus in an ET0L system only words over a distinguished sub-alphabet are in the generated language. A language is said to be an ET0L language if there is an ET0L system generating it.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1142/s0129054106003772">doi:10.1142/s0129054106003772</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ayaqtp7gtfeqnbkkaygtbpmk3e">fatcat:ayaqtp7gtfeqnbkkaygtbpmk3e</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170922224602/http://www.gcn.us.es/3BWMC/bravolpdf/bravol289.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/a0/bb/a0bb85e49f3c15597f68efa15b9a7288808e3025.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1142/s0129054106003772"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> worldscientific.com </button> </a>

Efficiency, robustness and accuracy in Picky chart parsing

David M. Magerman, Carl Weir
<span title="">1992</span> <i title="Association for Computational Linguistics"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/5n6volmnonf5tn6xputi5f2t3e" style="color: black;">Proceedings of the 30th annual meeting on Association for Computational Linguistics -</a> </i> &nbsp;
Control Configuration The control for our experiments is the configuration of Picky with all three phases and with a maximum edge count of 15,000.  ...  It uses an agenda processing control mechanism with the scoring heuristics of Pearl.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.3115/981967.981973">doi:10.3115/981967.981973</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/acl/MagermanW92.html">dblp:conf/acl/MagermanW92</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/2nhiullkqbcsrj3lwgzogbqavy">fatcat:2nhiullkqbcsrj3lwgzogbqavy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20150413182306/http://www.aclweb.org/anthology/P/P92/P92-1006.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/3d/ad/3dad6f1b771585f2b734eb24ba1b492584c5841f.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.3115/981967.981973"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Main Concepts of Networks of Transformation Units with Interlinking Semantics [chapter]

Dirk Janssens, Hans-Jörg Kreowski, Grzegorz Rozenberg
<span title="">2005</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
The central syntactic notion is that of a transformation unit that encapsulates a set of rules, imports other transformation units, and regulates the use and interaction of both by means of a control condition  ...  Finally, the main result of this paper is formulated in Section 4.  ...  Analogously, grammar systems and T0L systems can be reconstructed as networks of transformation units of the given form.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-540-31847-7_19">doi:10.1007/978-3-540-31847-7_19</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/4e6fibdjrnaa7ahhawlgyaxxjq">fatcat:4e6fibdjrnaa7ahhawlgyaxxjq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170808114812/http://www.sfb637.uni-bremen.de/pubdb/repository/SFB637-A4-05-006-IA.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/5e/a9/5ea9e47edcb3dcb79cf3d3eb90c21a9120389952.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-540-31847-7_19"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

A mathematical investigation of propagating graph 0L systems

Karel Culik, Derick Wood
<span title="">1979</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/fbkexx2qg5anljkxraobuswdq4" style="color: black;">Information and Control</a> </i> &nbsp;
Each ETOL language can be represented as a coding of a T0L language (Ehrenfeucht and Rozenberg, 1975) .  ...  The language of an XDOL system (G, O) is defined to be L(G, 0) = {x:y is in L(G) and O(y) , . x}, where A ' = C , H o r W . Finally, we need the notion of the length set of an L system.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0019-9958(79)90088-3">doi:10.1016/s0019-9958(79)90088-3</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/zka3bej26jfttnc3vjtdkbqlka">fatcat:zka3bej26jfttnc3vjtdkbqlka</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170924125502/http://publisher-connector.core.ac.uk/resourcesync/data/elsevier/pdf/152/aHR0cDovL2FwaS5lbHNldmllci5jb20vY29udGVudC9hcnRpY2xlL3BpaS9zMDAxOTk5NTg3OTkwMDg4Mw%3D%3D.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/86/2a/862adf9a312c7b3d625ef9e2b3ebaf2ff1f995e0.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0019-9958(79)90088-3"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Applications of L systems to group theory [article]

Laura Ciobanu and Murray Elder and Michal Ferov
<span title="2018-02-01">2018</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
L systems generalise context-free grammars by incorporating parallel rewriting, and generate languages such as EDT0L and ET0L that are strictly contained in the class of indexed languages.  ...  We also show the existence of EDT0L and ET0L languages of intermediate growth.  ...  Finally, (p) w n −→ m w n and w n −→ f * 2 w. From the construction of the table f 2 it follows that w n = G w hence w = G 1.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1705.02809v2">arXiv:1705.02809v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/sdzm5mq7y5hgrchlila646wwa4">fatcat:sdzm5mq7y5hgrchlila646wwa4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200916041858/https://arxiv.org/pdf/1705.02809v1.pdf" title="fulltext PDF download [not primary version]" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <span style="color: #f43e3e;">&#10033;</span> <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/b2/38/b2388b0b4c7092f470cc3345021ee42a94624a32.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1705.02809v2" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

L Systems [chapter]

Lila Kari, Grzegorz Rozenberg, Arto Salomaa
<span title="">1997</span> <i title="Springer Berlin Heidelberg"> Handbook of Formal Languages </i> &nbsp;
Finally, the language fa 3 n j n 1g [ fb n c n d n j n 1g is an EP0L language but not a CP0L language.  ...  The family ET0L is a full AFL, whereas the family T0L is an anti-AFL. Every ET0L language is generated by an ET0L system with two tables.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-59136-5_5">doi:10.1007/978-3-642-59136-5_5</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/5evlmahr75dadkiqepxf7rqkf4">fatcat:5evlmahr75dadkiqepxf7rqkf4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190307220525/http://pdfs.semanticscholar.org/dd94/db48ffe4197b954d157e2556f15cb41cd466.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/dd/94/dd94db48ffe4197b954d157e2556f15cb41cd466.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-59136-5_5"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

On coordinated selective substitutions: Towards a unified theory of grammars and machines

G. Rozenberg
<span title="">1985</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/elaf5sq7lfdxfdejhkqbtz6qoq" style="color: black;">Theoretical Computer Science</a> </i> &nbsp;
It provides a unifying framework for both grammars and machines (automata) and hence a really broad framework for formal language theory.  ...  F(PN) denotes the class of languages that are accepted by Petri nets (that is labeled marked Petri nets with final zero marking) (see, e.g., [2] ).  ...  Acceptance by both final state and empty store in A corresponds to the regular success condition (A*lOi, {A}) .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0304-3975(85)90086-6">doi:10.1016/0304-3975(85)90086-6</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ujmulz53ovhobjczqepvx7gdvu">fatcat:ujmulz53ovhobjczqepvx7gdvu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170927175949/http://publisher-connector.core.ac.uk/resourcesync/data/elsevier/pdf/579/aHR0cDovL2FwaS5lbHNldmllci5jb20vY29udGVudC9hcnRpY2xlL3BpaS8wMzA0Mzk3NTg1OTAwODY2.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/9e/ca/9ecac25c55551d2abb63eb39851ce092192e458f.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0304-3975(85)90086-6"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 46 results