Expressive Capacity of Concatenation Freeness

DOI10.1007/978-3-319-22360-5_17zbMath1429.68123OpenAlexW1422000268MaRDI QIDQ2947422

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)

Related Items

Expressive capacity of subregular expressions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nondeterministic state complexity of star-free languages
• Alternating finite automata and star-free languages
• Dot-depth of star-free events
• THE COMPLEXITY OF REGULAR(-LIKE) EXPRESSIONS
• On finite monoids having only trivial subgroups
• The Theory of Definite Automata
• Roots of Star Events
• On Decompositions of Regular Events

This page was built for publication: Expressive Capacity of Concatenation Freeness