Results 71 to 80 of about 237 (86)

Chomsky-Schützenberger Type Characterizations of Poly-Slender and Parikh Slender Context-Free Languages1 1Work supported by the Grants-in Aid for Scientific Research No. 1 0440034, Japan Society for the Promotion of Sciences and the Dirección General de Enseñanza Superior e Investigación Cientifica, SB 97-00110508

Electronic Notes in Theoretical Computer Science, 2004
Carlos Martin-Vide, Víctor Mitrana
exaly  

Semi-linearity, parikh-boundedness and tree adjunct languages

Information Processing Letters, 1983
Aravind K Joshi
exaly  

The Parikh counting functions of sparse context-free languages are quasi-polynomials

Theoretical Computer Science, 2009
Benedetto Intrigila, Stefano Varricchio   +1 more
exaly  

Parikhʼs theorem: A simple and direct automaton construction

Information Processing Letters, 2011
Javier Esparza, Pierre Ganty, Stefan Kiefer   +2 more
exaly  

Decision problems concerning thinness and slenderness of formal languages

Acta Informatica, 1998
Juha Honkala
exaly  

Parikh-bounded languages

Lecture Notes in Computer Science, 2005
Meera Blattner, Michel Latteux
exaly  

A note on Parikh maps, abstract languages, and decision problems

Information Sciences, 1985
Louis E Rosier
exaly  

Comparisons of Parikh's condition to other conditions for context-free languages

Theoretical Computer Science, 1998
exaly  

Parikh-reducing Church–Rosser representations for some classes of regular languages

Theoretical Computer Science, 2017
exaly  

Some characterizations of Parikh matrix equivalent binary words

Information Processing Letters, 2004
exaly