Power-separating regular languages

DOI10.1007/BF01761710zbMATH Open0287.68045OpenAlexW2088953089MaRDI QIDQ4775487FDOQ4775487

Authors: H. J. Shyr, Gabriel Thierrin 

Publication date: 1974

Published in: Mathematical Systems Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01761710

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• On finite monoids having only trivial subgroups
• A Note on Star-Free Events
• On synchronizing prefix codes

Cited In (17)

• Operations on subregular languages and nondeterministic state complexity
• Title not available (Why is that?)
• Nondeterministic state complexity of star-free languages
• Nondeterministic state complexity of star-free languages
• On the generative capacity of contextual grammars with strictly locally testable selection languages
• Closure properties of subregular languages under operations
• Relations of contextual grammars with strictly locally testable selection languages
• Left-noncounting languages
• Accepting networks of evolutionary processors with resources restricted and structure limited filters
• Strictly Locally Testable and Resources Restricted Control Languages in Tree-Controlled Grammars
• Nondeterministic operational complexity in subregular languages
• Merging two hierarchies of external contextual grammars with subregular selection
• Title not available (Why is that?)
• Determination of finite automata accepting subregular languages
• Generative capacity of contextual grammars with subregular selection languages
• Decision problems for subregular classes
• The magic number problem for subregular language families

This page was built for publication: Power-separating regular languages

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