A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is `application/pdf`

.

## Filters

##
###
The Complexity of Languages Resulting from the Concatenation Operation
[chapter]

2016
*
Lecture Notes in Computer Science
*

This covers all

doi:10.1007/978-3-319-41114-9_12
fatcat:utjgbtial5fe7gepbamtv6tk3y
*the*possible cases, and proves*the*theorem. ⊓ ⊔ Conclusions We investigated*the*state*complexity**of**languages**resulting**from**the**concatenation**operation*. ... In Section 4, we prove that*the*range*of*possible*complexities*for*the**languages**resulting**from**the**concatenation**operation*is contiguous*from*1 up to known upper bound, and we show that a linear alphabet ... A similar problem for*the*square*operation*, defined as L 2 = LL, remains open even for an exponential alphabet. ...##
###
Operational State Complexity of Deterministic Unranked Tree Automata

2010
*
Electronic Proceedings in Theoretical Computer Science
*

We consider

doi:10.4204/eptcs.31.17
fatcat:suj2shjye5fp7hwa3xbpjblmnm
*the*state*complexity**of*basic*operations*on tree*languages*recognized by deterministic unranked tree automata. ... For tree*concatenation*we establish a tight upper bound that is*of*a different order than*the*known state*complexity**of**concatenation**of*regular string*languages*. ...*The*bound is*of*a different order than*the*known state*complexity*m2 n − 2 n−1*of**concatenation**of*regular string*languages*. ...##
###
Descriptional Complexity of Deterministic Regular Expressions
[chapter]

2012
*
Lecture Notes in Computer Science
*

Then we give an overview

doi:10.1007/978-3-642-32589-2_56
fatcat:kdz6adftwjg4vbgnzs7v7tpv24
*of**the*closure properties*of*these*languages*under various*language*-theoretic*operations*and we study*the*descriptional*complexity**of*applying these*operations*. ... We study*the*descriptional*complexity**of*regular*languages*that are definable by deterministic regular expressions. ... Descriptional*Complexity**of**Operations*on DRE-Definable*Languages*We are now ready to apply previously obtained*results*to prove lower bounds on*the*descriptional*complexity**of**operations*on DREs. ...##
###
Operational State Complexity under Parikh Equivalence
[chapter]

2014
*
Lecture Notes in Computer Science
*

We investigate, under Parikh equivalence,

doi:10.1007/978-3-319-09704-6_26
fatcat:erydydok3jdllckaqg6mrqao7m
*the*state*complexity**of*some*language**operations*which preserve regularity. ...*of**the*Parikh images*of**the**languages*accepted by A and B. ... Introduction*The*investigation*of**the*state*complexity**of*regular*languages*and their*operations*is extensively reported in*the*literature (e.g., [11, 14, 15] ). ...##
###
Basic operations: Minimal syntax-semantics

2009
*
Catalan Journal of Linguistics
*

On this view, all

doi:10.5565/rev/catjl.148
fatcat:esthgvenorbptdmnfadbhh5oou
*complex*expressions are formed via*the**operation*COMBINE(A, B). But this*operation*is not primitive: COMBINE(A, B) = LABEL[*CONCATENATE*(A, B)]. ... In this programmatic paper, we articulate a minimalist conception*of*linguistic composition, syntactic and semantic, with*the*aim*of*identifying fundamental*operations*invoked by*the*human faculty*of**language*... One can also view grammatical combination in human*languages*as*the**result**of*adding a new twist-labels-to*the*more cognitively ancient*operation**of**concatenation*. ...##
###
Page 2951 of Mathematical Reviews Vol. , Issue 95e
[page]

1995
*
Mathematical Reviews
*

A mapping, F,

*from**the*set*of*all grammars into*the*set*of*all grammars is a standardizing*operation*on a class*of*recursively enumerable*languages*just in case F maps any grammar for any*language*L € ...*The*restrictions we impose on*the**operator**of**concatenation*are purely in terms*of**the*length*of**the*words to be*concatenated*.” 95e:68110 68Q45 Honkala, Juha (SF-TURK; Turku) An iteration property*of*Lindenmayerian ...##
###
Nondeterministic State Complexity of Star-Free Languages
[chapter]

2011
*
Lecture Notes in Computer Science
*

We investigate

doi:10.1007/978-3-642-22256-6_17
fatcat:hykuruuj3nh53eyx7gxbsmtfc4
*the*nondeterministic state*complexity**of*several*operations*on finite automata accepting star-free*languages*. ... This nicely complements*the**results*recently obtained in [8] for*the**operation*problem*of*star-free*languages*accepted by deterministic finite automata. ... Introduction*The**operation*problem on a*language*family is*the*question*of*cost (in terms*of*states)*of**operations*on*languages**from*this family with respect to their representations. ...##
###
State complexity of the concatenation of regular tree languages

2012
*
Theoretical Computer Science
*

We consider

doi:10.1016/j.tcs.2011.12.048
fatcat:sn4srx24xvdnrbkhxih6i4sdfy
*the*state*complexity**of*basic*concatenation**operations*for regular tree*languages*. ...*The*bound for sequential*concatenation**of*tree*languages*differs by an order*of*magnitude*from**the*corresponding bound for regular string*languages*. ... It turns out that, for sequential*concatenation**of*tree*languages*,*the*size blow-up*of*B differs by an order*of*magnitude*from**the*known state*complexity**of**concatenation**of*regular string*languages*[ ...##
###
State complexity of operations on two-way finite automata over a unary alphabet

2012
*
Theoretical Computer Science
*

*The*paper determines

*the*number

*of*states in two-way deterministic finite automata (2DFA) over a one-letter alphabet sufficient and in

*the*worst case necessary to represent

*the*

*results*

*of*basic

*language*-theoretic ...

*operations*on 2DFAs with a certain number

*of*states. ...

*The*authors have used computer calculations to build

*the*initial understanding

*of*

*the*state

*complexity*

*of*2DFAs. ...

##
###
Incomplete Transition Complexity of Basic Operations on Finite Languages
[chapter]

2013
*
Lecture Notes in Computer Science
*

In this paper we study

doi:10.1007/978-3-642-39274-0_31
fatcat:2tzas46rdfcvzjpaktgxsdgs2q
*the*incomplete (deterministic) state and transition*complexity*on finite*languages**of*boolean*operations*,*concatenation*, star, and reversal. ...*The*state*complexity**of*basic*operations*on finite*languages*(considering complete DFAs) has been extensively studied in*the*literature. ... Introduction Descriptional*complexity*studies*the*measures*of**complexity**of**languages*and*operations*. ...##
###
State complexity of some operations on binary regular languages

2005
*
Theoretical Computer Science
*

We investigate

doi:10.1016/j.tcs.2004.04.011
fatcat:tu6bumk2ercixn2olnzsu2ljau
*the*state*complexity**of*some*operations*on binary regular*languages*. ... In particular, we consider*the**concatenation**of**languages*represented by deterministic finite automata, and*the*reversal and complementation*of**languages*represented by nondeterministic finite automata ... Acknowledgements I would like to thank Jožko Jirásek for his help with*the*computational verification*of*some conjectures. ...##
###
The Complexity of Separation for Levels in Concatenation Hierarchies

2018
*
Foundations of Software Technology and Theoretical Computer Science
*

*The*aim

*of*this paper is to establish such

*complexity*

*results*. ... We investigate

*the*

*complexity*

*of*

*the*separation problem associated to classes

*of*regular

*languages*. ... Consider

*the*star-free

*languages*(SF): for every alphabet A, SF(A) is

*the*least set

*of*

*languages*containing all singletons {a} for a ∈ A and closed under Boolean

*operations*and

*concatenation*. ...

##
###
Complexity in Prefix-Free Regular Languages

2010
*
Electronic Proceedings in Theoretical Computer Science
*

We examine deterministic and nondeterministic state

doi:10.4204/eptcs.31.22
fatcat:m337dgahebbjtbagpbb2aqeq6y
*complexities**of*regular*operations*on prefix-free*languages*. ... We next provide*the*tight bounds on state*complexity**of*symmetric difference, and deterministic and nondeterministic state*complexity**of*difference and cyclic shift*of*prefix-free*languages*. ...*resulting**from*some*operation*. ...##
###
State complexity of unique rational operations

2009
*
Theoretical Computer Science
*

These unique

doi:10.1016/j.tcs.2009.02.035
fatcat:frlgtnelmne2vk72sy7kdndpce
*operations*can arguably be viewed as combined basic*operations*, placing this work in*the*popular area*of*state*complexity**of*combined*operations*on regular*languages*. ... For each basic*language**operation*we define its "unique" counterpart as being*the**operation*that*results*in a*language*whose words can be obtained uniquely through*the*given*operation*. ... Acknowledgements This study benefitted greatly*from*our extensive experiments that could have not been possible without*the*use*of*Grail+, carefully developed and maintained by Derick Wood, Sheng Yu, and ...##
###
Implementation of Concatenation Technique for Low Resource Text-To-Speech System Based on Marathi Talking Calculator

2018
*
The 6th Intl. Workshop on Spoken Language Technologies for Under-Resourced Languages
*

*The*average run time

*complexity*

*of*

*the*application is also calculated which is noted down to 2.64 sec.

*The*feedback and review

*of*

*the*application is also taken

*from*real end-user i.e. blind people. ... It also speaks out

*the*

*operation*which is intended to be performed.

*The*

*concatenation*synthesis technique is applied to speak out

*the*value

*of*decimal places in

*the*output number. ... Bharti Gawali Department

*of*Computer Science and IT, Dr. Babasaheb Ambedkar Marathwada University, Aurangabad for providing

*the*guidance for

*the*research. ...

« Previous

*Showing results 1 — 15 out of 76,282 results*