Lyndon partial words and arrays with applications

DOI10.1007/978-3-031-23612-9_14zbMath1528.68334OpenAlexW4313401186MaRDI QIDQ6111445

Meenakshi Paramasivan, V. Rajkumar Dare, R. Krishna Kumari, R. Arulprakasam

Publication date: 3 August 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-23612-9_14

zbMATH Keywords

2D arrays2D Lyndon wordsLyndon partial words

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Combinatorics on words (68R15) Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 2D Lyndon words and applications
• On the action of the symmetric group on the free Lie algebra and the partition lattice
• Lyndon trees
• Partial words and a theorem of Fine and Wilf
• Lyndon words, permutations and trees.
• Simple picture processing based on finite automata and regular grammars
• Lyndon morphisms
• State complexity of partial word finite automata
• Cartesian and Lyndon trees
• Primitive partial words
• Scanning Pictures the Boustrophedon Way
• On the Language of Primitive Partial Words
• Factorizing words over an ordered alphabet
• Array automata and operations on array languages
• Minimal partial languages and automata
• The “Runs” Theorem
• Picture languages with array rewriting rules
• Computer vision. Algorithms and applications
• Free differential calculus. IV: The quotient groups of the lower central series

This page was built for publication: Lyndon partial words and arrays with applications