Expressive capacity of concatenation freeness

DOI10.1007/978-3-319-22360-5_17MaRDI QIDQ2947422zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

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

Cites work

• scientific article; zbMATH DE number 3293675 (Why is no real title available?)
• scientific article; zbMATH DE number 3368555 (Why is no real title available?)
• scientific article; zbMATH DE number 3189697 (Why is no real title available?)
• Alternating finite automata and star-free languages
• Dot-depth of star-free events
• Nondeterministic state complexity of star-free languages
• On Decompositions of Regular Events
• On finite monoids having only trivial subgroups
• Roots of Star Events
• The Theory of Definite Automata
• The complexity of regular(-like) expressions

Cited in

(3)

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

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)