✦ LIBER ✦

Axiomatizing Shuffle and Concatenation in Languages

✍ Scribed by Stephen L Bloom; Zoltán Ésik

Book ID: 112252305
Publisher: Elsevier Science
Year: 1997
Tongue: English
Weight: 341 KB
Volume: 139
Category: Article
ISSN: 0890-5401
DOI: 10.1006/inco.1997.2665

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Shuffle languages are in P

✍ Joanna Jȩdrzejowicz; Andrzej Szepietowski 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 226 KB

In this paper we show that shu e languages are contained in one-way-NSPACE(log n) thus in P. We consider the class of shu e languages which emerges from the class of ÿnite languages through regular operations (union, concatenation, Kleene star) and shu e operations (shu e and shu e closure). For eve

Concatenation of Regular Languages and D

Concatenation of Regular Languages and Descriptional Complexity

✍ Galina Jirásková 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 573 KB

Bi-catenation and shuffle product of lan

Bi-catenation and shuffle product of languages

✍ H.J. Shyr; S.S. Yu 📂 Article 📅 1998 🏛 Springer-Verlag 🌐 English ⚖ 228 KB

Axiomatizing collective judgment sets in

Axiomatizing collective judgment sets in a minimal logical language

✍ Marc Pauly 📂 Article 📅 2007 🏛 Springer Netherlands 🌐 English ⚖ 285 KB

Axiomatics for Data Refinement in Call b

Axiomatics for Data Refinement in Call by Value Programming Languages

✍ John Power; Miki Tanaka 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 385 KB

[Lecture Notes in Computer Science] Comp

[Lecture Notes in Computer Science] Computer Science - Theory and Applications Volume 5675 || Concatenation of Regular Languages and Descriptional Complexity

✍ Frid, Anna; Morozov, Andrey; Rybalchenko, Andrey; Wagner, Klaus W. 📂 Article 📅 2009 🏛 Springer Berlin Heidelberg ⚖ 272 KB