Shuffled languages—Representation and recognition
Authors:
- Martin BerglundMBMartin Berglund
- Henrik BjörklundHBHenrik Björklund
- Johanna BjörklundJBJohanna Björklund
- 1 June 2013
- journal article
- research article
- Published by Elsevier in Theoretical Computer Science
- Vol. 489-490, 1-20
Abstract
No abstract availableKeywords
This publication has 24 references indexed in Scilit:
- Recognizing Shuffled Languages2011
- The expressive power of the shuffle productInformation and Computation, 2010
- On the Shuffle Automaton Size for WordsElectronic Proceedings in Theoretical Computer Science, 2009
- Shuffle Expressions and Words with Nested DataLecture Notes in Computer Science, 2007
- Two-Variable Logic on Words with Data2006
- On Families of Graphs Having a Decidable First Order Theory with Reachability2002
- Techniques for Plan RecognitionUser Modeling and User-Adapted Interaction, 2001
- Nonfinite axiomatizability of the equational theory of shuffleActa Informatica, 1998
- Axiomatizing Shuffle and Concatenation in LanguagesInformation and Computation, 1997
- Concurrent regular expressions and their relationship to Petri netsTheoretical Computer Science, 1992