Filters








192,261 Hits in 4.2 sec

Connecting Partial Words and Regular Languages [chapter]

Jürgen Dassow, Florin Manea, Robert Mercaş
2012 Lecture Notes in Computer Science  
Finally, we define a hierarchy of classes of languages of partial words, by grouping together languages that can be connected in strong ways to regular languages, and derive their closure properties.  ...  We initiate a study of languages of partial words related to regular languages of full words.  ...  Motivated by the above results, that connect in a meaningful way languages of partial words to regular languages of full words, and by the theoretical in-terest of studying systematically such languages  ... 
doi:10.1007/978-3-642-30870-3_16 fatcat:mumbbpd3ljebdky6v67ydqvvpa

Regular languages of partial words

Jürgen Dassow, Florin Manea, Robert Mercaş
2014 Information Sciences  
Finally, we introduce a hierarchy of classes of languages of partial words, by grouping together languages that can be connected in various strong ways to regular languages, and derive their closure properties  ...  We initiate a study of languages of partial words related to regular languages of full words.  ...  The work of Robert Mercaş was supported by the Alexander von Humboldt Foundation and DFG grant 582014.  ... 
doi:10.1016/j.ins.2013.12.032 fatcat:zkj3g5pf2jd5padchsl56olpqi

The Orthographic depth and promotion of students with learning disabilities

Saied Bishara, Lawrence Jun Zhang
2019 Cogent Education  
This research examines the connection between orthographical depth of a language and phonological and morphological processing in Arabic-speaking children with learning disabilities.  ...  Bishara This research examines the connection between orthographical depth of a language and phonological and morphological processing in Arabicspeaking children with learning disabilities.  ...  The Arabic language is considered to be a regular alphabetic language-that is, there is a close connection between the graphic representation of the language (the visual aspects) and the phonemic (the  ... 
doi:10.1080/2331186x.2019.1646384 fatcat:hk4kom5qobhjhd7rl4j6tlosga

Regular languages and partial commutations

Antonio Cano, Giovanna Guaiana, Jean-Éric Pin
2013 Information and Computation  
The closure of a regular language under a [partial] commutation I has been extensively studied.  ...  We present new advances on two problems of this area: (1) When is the closure of a regular language under [partial] commutation still regular?  ...  The closure of a regular language under commutation or partial commutation has been extensively studied [37, 25, 1, 17, 18, 19] , notably in connection with regular model checking [2, 3, 9, 10] or in  ... 
doi:10.1016/j.ic.2013.07.003 fatcat:wampvguitbertjobcxfoqnkcvq

Aging and Language Production

Deborah M. Burke, Meredith A. Shafto
2004 Current Directions in Psychological Science  
Older adults experience more word-finding failures, such as tip-of-thetongue states, than young adults do, and this and other speech production failures appear to stem from difficulties in retrieving the  ...  Experimental research and older adults' reports of their own experience suggest that the ability to produce the spoken forms of familiar words declines with aging.  ...  The tip of the tongue experience: A review and evaluation. Psychological  ... 
doi:10.1111/j.0963-7214.2004.01301006.x pmid:18414600 pmcid:PMC2293308 fatcat:acigfumxybf2pol5mb3tuxcblq

Page 2153 of Mathematical Reviews Vol. , Issue 86e [page]

1986 Mathematical Reviews  
The class of K-limited-regular languages is related to the class of K-regular languages when K is a commutative ring, and when K = R,,. William R. Edwards (Lafayette, La.) 86e:68077 Yurgensen, Kh.  ...  This paper deals with K-regular automata, where K is a semi- ring, and with the languages accepted by such automata, and with the power series corresponding to such languages [cf.  ... 

Page 2951 of Mathematical Reviews Vol. , Issue 95e [page]

1995 Mathematical Reviews  
{For the entire collection see MR 95b:68022.} 95e:68108 68Q45 Birget, Jean-Camille (1-NE-CS; Lincoln, NE) Partial orders on words, minimal elements of regular languages, and state complexity.  ...  Summary: “The customary language-theoretic derivative of a word u with respect to a word v means the deletion of v from the beginning or end of u.  ... 

Semi-commutations

M. Clerbout, M. Latteux
1987 Information and Computation  
I' for every word WE R, the graph (T(S), alph(w)) is strongly connected, then f(R*) is a regular language. Proof.  ...  We prove that if.f( R) and ,f(R') are regular languages then.f( RR') is a regular language and we give a sufficient condition which ensures that .fl R*) is a regular language.  ...  sufficient condition concerning a semi-commutation,f'and a finite set F which ensures thatf(F*) is a regular language.  ... 
doi:10.1016/0890-5401(87)90040-x fatcat:bcxku52bjnhrld55pnlau7szsu

Representation of (Left) Ideal Regular Languages by Synchronizing Automata [article]

Marina Maslennikova, Emanuele Rodaro
2014 arXiv   pre-print
We characterize regular languages whose minimal deterministic finite automaton is synchronizing and possesses a reset word belonging to the recognized language.  ...  We find a precise lower bound for the reset complexity of a principal ideal languages. Also we show a strict connection between principal left ideals and synchronizing automata.  ...  acknowledges support from the Presidential Programme for young researchers, grant MK-3160.2014.1, from the Presidential Programme "Leading Scientific Schools of the Russian Federation", project no. 5161.2014.1, and  ... 
arXiv:1412.6767v1 fatcat:tc5tjufygjcyhkm4fjjn23h4xa

Representation of (Left) Ideal Regular Languages by Synchronizing Automata [chapter]

Marina Maslennikova, Emanuele Rodaro
2015 Lecture Notes in Computer Science  
We characterize regular languages whose minimal deterministic finite automaton is synchronizing and possesses a reset word belonging to the recognized language.  ...  We find a precise lower bound for the reset complexity of a principal ideal languages. Also we show a strict connection between principal left ideals and synchronizing automata.  ...  acknowledges support from the Presidential Programme for young researchers, grant MK-3160.2014.1, from the Presidential Programme "Leading Scientific Schools of the Russian Federation", project no. 5161.2014.1, and  ... 
doi:10.1007/978-3-319-20297-6_21 fatcat:swqivk7xyrfnlmzsajlvsxap7m

A theory of regular MSC languages

Jesper G. Henriksen, Madhavan Mukund, K. Narayan Kumar, Milind Sohoni, P.S. Thiagarajan
2005 Information and Computation  
We propose, accordingly, a notion of regularity for collections of MSCs and explore its basic properties.  ...  In fact, we characterize the bounded HMSC languages as the subclass of regular MSC languages that are finitely generated.  ...  We will now bring out the intimate connection between message sequence graphs and finitely generated regular MSC languages.  ... 
doi:10.1016/j.ic.2004.08.004 fatcat:omnisnjwqfcdhhyrpqqntikq54

Unambiguity in Timed Regular Languages: Automata and Logics [chapter]

Paritosh K. Pandya, Simoni S. Shah
2010 Lecture Notes in Computer Science  
Unambiguous languages (UL), originally defined by Schutzenberger using unambiguous polynomials, are a robust subclass of regular languages.  ...  A subclass of the two-way deterministic timed automata (2DTA) of Alur and Henzinger, called partially-ordered two-way deterministic automata (po2DTA) are examined and we call the languages accepted by  ...  Schwentick et al showed that UL is precisely the subclass of regular languages that can be recognized by partially-ordered two-way deterministic finite automata (po2dfa ) [STV01].  ... 
doi:10.1007/978-3-642-15297-9_14 fatcat:dqjhqbzobrbu5iz7zcr3mh6uba

Reordering Derivatives of Trace Closures of Regular Languages

Hendrik Maarand, Tarmo Uustalu, Michael Wagner
2019 International Conference on Concurrency Theory  
We also show that star-connected languages have finite uniform scattering rank.  ...  We provide syntactic derivative-like operations, defined by recursion on regular expressions, in the styles of both Brzozowski and Antimirov, for trace closures of regular languages.  ...  Acknowledgements We thank Pierre-Louis Curien, Jacques Sakarovitch, Simon Doherty, Georg Struth and Ralf Hinze for inspiring discussions, and our anonymous reviewers for the exceptionally thorough and  ... 
doi:10.4230/lipics.concur.2019.40 dblp:conf/concur/MaarandU19 fatcat:zsbue57lozbxpm3es2cef2zllm

On well quasi orders of free monoids

Lucian Ilie, Arto Salomaa
1998 Theoretical Computer Science  
It is decidable whether or not an arbitrary regular language results as a down-set from an infinite or bi-infinite word, whereas the same problem is undecidable for context-free language.  ...  We establish a number of results about the regularity and effective regularity of the down-sets, in particular, a general condition for the effective regularity of the down-set associated to an inverse  ...  Acknowledgements We thank the referee for useful comments, especially as regards notations and Lemmas 4.1 and 4.4.  ... 
doi:10.1016/s0304-3975(98)00036-x fatcat:63lqzb6fdrenpnvxm37b2ic4wa

Learning the spelling of strange words in Dutch benefits from regularized reading

Anna M. T. Bosman, Janet G. van Hell, Ludo Verhoeven
2006 Journal of Educational Psychology  
reading and regularized reading.  ...  The results reveal that more training substantially enhanced spelling performance in the long term, and repetition of the regularized word was even more effective.  ...  Loan words are the most common borrowings in the Dutch language and are often subdivided in naturalized words, bastard words, and strange words.  ... 
doi:10.1037/0022-0663.98.4.879 fatcat:ne6ryurwxvbobhxtg5c3sxtjbe
« Previous Showing results 1 — 15 out of 192,261 results