On the computation of quotients and factors of regular languages

DOI10.1007/S11704-010-0154-8zbMATH Open1267.68137OpenAlexW2023836972MaRDI QIDQ351995FDOQ351995

Temur Kutsia, Mircea Marin

Publication date: 4 July 2013

Published in: Frontiers of Computer Science in China (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11704-010-0154-8

Recommendations

• Quotient complexity of regular languages
• Quotient complexity of bifix-, factor-, and subword-free regular languages
• Quotient complexity of bifix-, factor-, and subword-free regular languages
• Quotient complexities of atoms of regular languages
• scientific article; zbMATH DE number 3974329
• The full quotient and its closure property for regular languages
• scientific article; zbMATH DE number 2162119
• On the structure and complexity of rational sets of regular languages
• Quotient complexities of atoms in regular ideal languages
• Quotients of Context-Free Languages

zbMATH Keywords

regular languagelanguage factorizationlanguage quotient

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Title not available (Why is that?)
• Derivatives of Regular Expressions
• Partial derivatives of regular expressions and finite automaton constructions
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the decomposition of finite languages
• Title not available (Why is that?)

Cited In (4)

• A non-ambiguous decomposition of regular languages and factorizing codes
• Factorial languages with quadratically upper bounded growth functions and nonlinearly upper bounded subword complexities
• On the Quantized Dynamics of Factorial Languages
• Some properties of inclusions of multisets and contractive Boolean operators

This page was built for publication: On the computation of quotients and factors of regular languages

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