Expressive capacity of concatenation freeness

DOI10.1007/978-3-319-22360-5_17zbMATH Open1429.68123OpenAlexW1422000268MaRDI QIDQ2947422FDOQ2947422

Authors: Martin Kutrib, Matthias Wendlandt 

Publication date: 23 September 2015

Published in: Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-22360-5_17

Recommendations

• Concatenation-free languages
• Expressive capacity of subregular expressions
• Complexity in Union-Free Regular Languages
• Complexity in union-free regular languages
• Union-Freeness Revisited — Between Deterministic and Nondeterministic Union-Free Languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• On Decompositions of Regular Events
• Title not available (Why is that?)
• On finite monoids having only trivial subgroups
• Title not available (Why is that?)
• Dot-depth of star-free events
• Alternating finite automata and star-free languages
• Nondeterministic state complexity of star-free languages
• Roots of Star Events
• The Theory of Definite Automata
• The complexity of regular(-like) expressions
• Title not available (Why is that?)

Cited In (3)

• Expressive capacity of subregular expressions
• Concatenation-free languages
• Expressivity of some versions of APAL

This page was built for publication: Expressive capacity of concatenation freeness

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