On nilpotent languages and their characterization by regular expressions

DOI10.14232/ACTACYB.19.1.2009.15MaRDI QIDQ3551114zbMATH OpenOpenAlexFDO

Authors György Gyurica

Publication date 8 April 2010

Published in Acta Cybernetica (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/7220ef8a60094bd8f8d3e506202516cfddf7e5bb

zbMATH Keywords

nilpotent languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 2143012
• On the closedness of nilpotent DR tree languages under Boolean operations
• scientific article; zbMATH DE number 5205535
• MINIMAL RECOGNIZERS AND SYNTACTIC MONOIDS OF DR TREE LANGUAGES
• Classes of tree languages and DR tree languages given by classes of semigroups

Cited in

(4)

• scientific article; zbMATH DE number 2143012 (Why is no real title available?)
• A Characterisation of Languages on Infinite Alphabets with Nominal Regular Expressions
• scientific article; zbMATH DE number 5205535 (Why is no real title available?)
• On the closedness of nilpotent DR tree languages under Boolean operations

This page was built for publication: On nilpotent languages and their characterization by regular expressions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3551114)