Search Results

You are looking at 61 - 62 of 62 items for :

  • "combinatorics" x
  • Refine by Access: All Content x
Clear All

) can be followed either by a single root or by two roots. I refer the reader to Jansen (2010 , 215–217) for more details on the combinatorics of the morphemes in (4). Verbal suffixes and their relative linear positions are listed in (5), with (5a

Free access

of Morse–Smale graphs – that is, shapes that belong to the same secondary class are in the same primary class as well. The authors also proved that for every combinatorically possible Morse–Smale graph a smooth convex body exists. The Reeb-graph also

Open access