Comparing consecutive letter counts in multiple context-free languages

Florian Lehner, Christian Lindorfer

Type: Article

Publication Date: 2021-03-27

Citations: 1

DOI: https://doi.org/10.1016/j.tcs.2021.03.034

View Publication

Download PDF

Locations

arXiv (Cornell University) - View - PDF
Theoretical Computer Science - View

Similar Works

Action	Title	Year	Authors
+	Comparing consecutive letter counts in multiple context-free languages	2020	Florian Lehner Christian Lindorfer
+	Comparing consecutive letter counts in multiple context-free languages	2020	Florian Lehner Christian Lindorfer
+	Numerals and Word Sequences	2014	Roberto Casati
+	The ranking of letter pairs and single letters to match digram and single-letter frequency counts	1962	M. S. Mayzner M. E. Tresselt
+	Multiple context-free tree grammars: Lexicalization and characterization	2018	Joost Engelfriet Andreas Maletti Sebastian Maneth
+ PDF Chat	Syntactic Sensitive Complexity for Symbol-Free Sequence	2013	Cheng‐Yuan Liou Daw-Ran Liou Alex A. Simak Bo-Shiang Huang
+ PDF Chat	Detecting Regularities on Grammar-Compressed Strings	2013	I Tomohiro Wataru Matsubara Kouji Shimohira Shunsuke Inenaga Hideo Bannai Masayuki Takeda Kazuyuki Narisawa Ayumi Shinohara
+	Detecting regularities on grammar-compressed strings	2014	I Tomohiro Wataru Matsubara Kouji Shimohira Shunsuke Inenaga Hideo Bannai Masayuki Takeda Kazuyuki Narisawa Ayumi Shinohara
+	Homophonic Letter Groups - Plus One, Minus One	2020	Susan Thorpe
+ PDF Chat	Absent Subsequences in Words	2021	Maria Kosche Tore Koß Florín Manea Stefan Siemer
+	Palindromic Letter-Sequences	1974	Leslie E. Card A. Ross Eckler
+	A nonsense alphabet	1952	Edward Lear
+ PDF Chat	Using Letter Positional Probabilities to Assess Word Complexity	2024	Michael Coleman Dalvean
+	Permutations and words counted by consecutive patterns	2006	Anthony Mendes Jeffrey B. Remmel
+	Analysis of letter strings in word recognition.	1973	Robert F. Stanners Gary B. Forbach
+	Quenched LDP for words in a letter sequence	2008	Matthias Birkner Andreas Greven Franciscus den Hollander
+ PDF Chat	Sequences with constant number of return words	2008	Ľubomíra Balková Edita Pelantová Wolfgang Steiner
+ PDF Chat	Logarithmic Equal-Letter Runs for BWT of Purely Morphic Words	2022	Andrea Frosini Ilaria Mancini Simone Rinaldi Giuseppe Romana Marinella Sciortino
+ PDF Chat	Extending de Bruijn sequences to larger alphabets	2021	Verónica Becher Lucas Cortés
+ PDF Chat	Detecting palindromes, patterns and borders in regular languages	2009	Terry Anderson John A. Loftus Narad Rampersad Nicolae Sântean Jeffrey Shallit

Works That Cite This (1)

Action	Title	Year	Authors
+ PDF Chat	Self-avoiding walks and multiple context-free languages	2023	Florian Lehner Christian Lindorfer

Works Cited by This (0)

Action	Title	Year	Authors