Power-separating regular languages

DOI10.1007/BF01761710zbMath0287.68045OpenAlexW2088953089MaRDI QIDQ4775487

Gabriel Thierrin, H. J. Shyr

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)

Related Items

THE MAGIC NUMBER PROBLEM FOR SUBREGULAR LANGUAGE FAMILIES ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Nondeterministic operational complexity in subregular languages ⋮ Merging two hierarchies of external contextual grammars with subregular selection ⋮ Relations of contextual grammars with strictly locally testable selection languages ⋮ Strictly Locally Testable and Resources Restricted Control Languages in Tree-Controlled Grammars ⋮ Left-noncounting languages ⋮ Nondeterministic state complexity of star-free languages ⋮ Unnamed Item ⋮ Generative Capacity of Contextual Grammars with Subregular Selection Languages* ⋮ Determination of finite automata accepting subregular languages ⋮ Nondeterministic State Complexity of Star-Free Languages ⋮ Closure properties of subregular languages under operations ⋮ Accepting networks of evolutionary processors with resources restricted and structure limited filters ⋮ Operations on subregular languages and nondeterministic state complexity

Cites Work

• Unnamed Item
• Unnamed Item
• On finite monoids having only trivial subgroups
• On synchronizing prefix codes
• A Note on Star-Free Events