On the computation of quotients and factors of regular languages
type: Item
instance of: scholarly article
title: On the computation of quotients and factors of regular languages
zbMATH Open document ID: 1267.68137
author: Mircea Marin
author: Temur Kutsia
published in: Frontiers of Computer Science in China
publication date: 2013-07-04T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 6183816
zbMATH Keywords: regular language
zbMATH Keywords: language factorization
zbMATH Keywords: language quotient
MaRDI profile type: Publication
full work available at URL: s11704-010-0154-8
OpenAlex ID: W2023836972
cites work: Derivatives of Regular Expressions
cites work: Partial derivatives of regular expressions and finite automaton constructions
cites work: Q5639639
cites work: Q3862379
cites work: Q3859267
cites work: On the decomposition of finite languages
cites work: Q4671950
DOI: 10.1007/S11704-010-0154-8
Recommended article: Q5146512
Recommended article: Quotient Complexity of Bifix-, Factor-, and Subword-free Regular Language
Recommended article: Q5740416
Recommended article: Quotient Complexities of Atoms of Regular Languages
Recommended article: Q3740264
Recommended article: The full quotient and its closure property for regular languages
Recommended article: Q4671950
Recommended article: On the Structure and Complexity of Rational Sets of Regular Languages
Recommended article: Quotient complexities of atoms in regular ideal languages
Recommended article: Quotients of Context-Free Languages
description: scientific article; zbMATH DE number 6183816