Filters








15 Hits in 1.7 sec

Inference for regular bilanguages

J. Berger, C. Pair
1978 Journal of computer and system sciences (Print)  
THE INFERENCE PROBLEM FOR REGULAR BILANGUAGJZS We have to specify what result we want to identify a regular bilanguage L.  ...  INFERENCE OF A RECOGNIZER FOR A REGULAR BILANGUAGE The problem is: given a regular bilanguage L in a(T), find a finite N-binoid S, a homomorphism h from fl(T) into S, and a subset S' of S, such that L  ... 
doi:10.1016/0022-0000(78)90052-1 fatcat:jjossmn3ojf2li4yxoukzhhb2a

Page 559 of Mathematical Reviews Vol. 58, Issue 1 [page]

1979 Mathematical Reviews  
Anca Pascu (Bucharest) Berger, J.; Pair, C. 58 #3710 Inference for regular bilanguages. J. Comput. System Sci. 16 (1978), no. 1, 100-122.  ...  For every context-free grammar, the set of de- rivation trees is a regular tree language and more generally, many structural inference algorithms for context-free languages are par- ticular cases of regular  ... 

New book

1977 Theoretical Computer Science  
Inference for regular bilanguages (C. Pair). Extensible pyogramming languages (M.A. Melkanoff). Conversational languages and ,structured interactive programming (I. Kupka).  ...  This is a textbook for undergraduate or first year graduate students in computer science who desire a self containled introduction to the theory of computation.  ... 
doi:10.1016/0304-3975(77)90060-3 fatcat:kzebff3uozgzhear7wr5guj42m

Page 600 of Mathematical Reviews Vol. 54, Issue 2 [page]

1977 Mathematical Reviews  
The author presents an inference algorithm for regular bilan- guages or tree languages, and particularly the structural descrip- tion bilanguages.  ...  Rus (Cluj) Pair, Cc, Inference for regular bilanguages. Formal languages and programming (Proc. Sem., UAM-IBM Sci. Center, Univ. Auténoma Madrid, Madrid, 1975), pp. 15-30.  ... 

Towards General Algorithms for Grammatical Inference [chapter]

Alexander Clark
2010 Lecture Notes in Computer Science  
Using this general framework, which we cast as a process of logical inference, we re-analyse Angluin's famous lstar algorithm and several recent algorithms for the inference of context-free grammars and  ...  Finally, to illustrate the advantages of this approach, we extend it to the inference of functional transductions from positive data only, and we present a new algorithm for the inference of finite state  ...  Acknowledgments I am very grateful to Shalom Lappin and Ryo Yoshinaka for comments and corrections on a draft of this paper; any remaining errors are of course my own.  ... 
doi:10.1007/978-3-642-16108-7_2 fatcat:cam7vezlnra63iewpzcp2zcyy4

Abstracts

1977 IBM Systems Journal  
Titles include: On a class of schematic languages, Inference for regular bilanguages, Extensible programming languages, Conversational languages and structured interactive programming, Some implications  ...  Part of the motivation for the analysis is to suggest reasonable stochastic models for the access path length sequence that can be conveniently utilized as input models for a simulation model of an IMS  ... 
doi:10.1147/sj.161.0076 fatcat:2wjth3asc5a25laixsjpmsridm

Towards General Algorithms for Grammatical Inference [chapter]

Alexander Clark
2010 Lecture Notes in Computer Science  
Using this general framework, which we cast as a process of logical inference, we re-analyse Angluin's famous lstar algorithm and several recent algorithms for the inference of context-free grammars and  ...  Finally, to illustrate the advantages of this approach, we extend it to the inference of functional transductions from positive data only, and we present a new algorithm for the inference of finite state  ...  Acknowledgments I am very grateful to Shalom Lappin and Ryo Yoshinaka for comments and corrections on a draft of this paper; any remaining errors are of course my own.  ... 
doi:10.1007/978-3-642-16184-1_29 fatcat:2r7y6s767vh73amtjjo74dppk4

Page 76 of IBM Systems Journal Vol. 16, Issue 1 [page]

IBM Systems Journal  
Titles include: On a class of schematic languages, Inference for regular bilanguages, Extensible programming languages, Conversational languages and structured interactive programming, Some implications  ...  Part of the motivation for the analysis is to suggest reasonable stochastic models for the access path length sequence that can be conveniently utilized as input models for a simulation model of an IMS  ... 

18. Mathematical Linguistics [chapter]

Trends in Linguistics  
Theorem 3.4.3 A bilanguage L is regular iff it is accepted by a regular autosegmental automaton.  ...  3.4.6 If L is a regular bilanguage and B = (S, I, O, i, F, T ) a generalized bisequential mapping, the image (L)B of L under B is also a regular bilanguage.  ... 
doi:10.1515/9783110890754.212 fatcat:3rtwoljvffhifd5np35txrtpzy

Safety Synthesis Sans Specification [article]

Roderick Bloem and Hana Chockler and Masoud Ebrahimi and Dana Fisman and Heinz Riener
2020 arXiv   pre-print
We devise a learning algorithm for this problem and show that its time and query complexity is polynomial with respect to the rank of the target language, its incompatibility measure, and the maximal length  ...  Given v ∈ Σ ∞ we use L |v for the set of words {w ∈ Γ ∞ | v⊕w ∈ L}. Henceforth, when we discuss bi-languages we assume they are over Σ × Γ. Furthermore, we consider only exhaustive bilanguages.  ...  While Corollary 4.7 proves that Alg. 1 terminates conditioned U has a finite rank, namely it is a regular language, our algorithm may terminate also for some target languages U that contain a non-regular  ... 
arXiv:2011.07630v2 fatcat:i7ctfcbaofdhbfp4w2ck4vafqm

Hierarchical phrase-based translation with weighted finite state transducers

Gonzalo Iglesias, Adrià de Gispert, Eduardo R. Banga, William Byrne
2009 Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics on - NAACL '09   unpublished
Combined with our findings for hierarchical grammars, we are able to build search-error free translation systems with state-of-the-art performance.  ...  For the first time, as far as we are aware, an SMT system combines successfully knowledge from two other research areas simultaneously: parsing, and weighted finite-state technology.  ...  notice that this regular grammar and the finite-state automaton, although outputing the same language are are not exactly identical as the unit for the regular expression is the letter and the unit for  ... 
doi:10.3115/1620754.1620817 fatcat:wt33p2f2ljgtreabx7og5mz3qy

Lost in Translanguaging?

Amira Sahbegovic
2017 unpublished
Lastly, bilanguaging does not only mean language fluidity in communication but also refers to a political process of social transformation.  ...  In this context, MEHISTO, MARSH and FRIGOLS (2008: 22) reveal that CLIL lessons need more preparation time than regular classes as teachers have to set content, language and learning goals for every  ... 
doi:10.25365/thesis.47245 fatcat:pa35hlsbufdrvcjyy5xxpikwge

Digital Learning, Discourse, and Ideology [chapter]

Sarah Hayes
2017 Encyclopedia of Educational Philosophy and Theory  
They organize conferences on a regular basis to share and further develop this knowledge.  ...  Learning with minoritized youth in this way entails forms of bilanguaging wherein European ontologies lose something of their habitability.  ...  Furthermore, the structure, culture, history, and past accomplishments of a research discipline form the foundation for identifying gaps and priority areas for researchers.  ... 
doi:10.1007/978-981-287-588-4_122 fatcat:xseqwos3kreb5obccojsgzugpa

Trace: Tennessee Research and Creative Exchange Nepantla as her Place in the Middle: Multilingualism and Multiculturalism in the Writings of Sor Juana Inés de la Cruz Recommended Citation Gomez, Nicole Lynn, "Nepantla as her Place in the Middle: Multilingualism and Multiculturalism in the Writings of Sor Juana Inés de

Doctoral Dissertations, Nicole Lynn Gomez, La
2016 unpublished
In early modern times, the tale was manipulated, inferring that the Africans' dark skin was the result of God's curse on Ham as punishment for his sin .  ...  Translation mine. nearly changed into the thing of stone they had been worshipping (508--27) 176 She suggests, then, that the devil is to blame for separating language and culture and also infers that  ...  They use phrases that would have been commonly heard in church services or learned in school but that make little sense out of context: For Sor Juana, these bilingual villancicos are a word games, or as  ... 
fatcat:fdqenyyn7nayboddpoxukcq77a

'Indican' college resiliency experiences in higher education : how discrepancy narratives in the 13th grade influence academic trajectories for Indigenous/Mexican students in a border city community college

Omar Oscar Diaz, Austin, The University Of Texas At, Austin, The University Of Texas At, Luis Urrieta
2019
"Why is the first year of college challenging for incoming students?" and "How are Indican students navigating and surviving their first year of community college?"  ...  To close friends to stayed with me, even when the boat sank, hit rock bottom, and sailed back to the top; thank you for your patience, the laughs, and hugs.  ...  Not because all my steak jokes were well done or because I tried my best to invite everyone out for weekly happy hours through obnoxious email threads, but because you let me be a part of your adventures  ... 
doi:10.26153/tsw/3305 fatcat:b4lfpuw2v5ftnb6ectn24lpan4