Structure and Complexity of Some Subregular Language Families

DOI10.1142/9789813148208_0003MaRDI QIDQ4683184zbMATH OpenOpenAlexFDO

Authors Markus Holzer, Martin Kutrib

Publication date 20 September 2018

Published in The Role of Theory in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/9789813148208_0003

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• More structural characterizations of some subregular language families by biautomata
• scientific article; zbMATH DE number 871245
• Semilinearity of families of languages
• Semilinearity of families of languages
• Studies in abstract families of languages
• Publication:4937901
• scientific article; zbMATH DE number 4189196
• On the grammatical complexity of finite languages
• scientific article; zbMATH DE number 3911734

Cited in

(11)

• Semilinearity of families of languages
• Union-complexities of Kleene plus operation
• Operational union-complexity
• The magic number problem for subregular language families
• Deciding definability by deterministic regular expressions
• Expressive capacity of subregular expressions
• Studies in abstract families of languages
• scientific article; zbMATH DE number 4189196 (Why is no real title available?)
• Union-Freeness Revisited — Between Deterministic and Nondeterministic Union-Free Languages
• Decision problems for subregular classes
• Language membership problems for subregular classes

This page was built for publication: Structure and Complexity of Some Subregular Language Families

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