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

##
###
Coalgebraic Semantics of Reflexive Economics (Dagstuhl Seminar 15042)

2015
*
Dagstuhl Reports
*

This report documents the program and the outcomes

doi:10.4230/dagrep.5.1.197
dblp:journals/dagstuhl-reports/AbramskyKLW15
fatcat:bfot4e2lbjh5tarbfps4qzrsmy
*of*Dagstuhl Seminar 15042 "Coalgebraic ... This structure induces a belief*hierarchy*for every*type*, thus reducing the*infinite*-dimensional regression*of*beliefs to a single-dimensional*type*. ... Recently it was shown that the*infinite**hierarchies**of*beliefs can be represented as coalgebras. ...##
###
Page 1160 of Mathematical Reviews Vol. , Issue 80C
[page]

1980
*
Mathematical Reviews
*

Sorin Istrail (lagi)
Paun, Gheorghe 80c:68058 An

*infinite**hierarchy**of**contextual**languages*with choice. Bull. Math. Soc. Sci. Math. R. S. Roumanie (N.S.) 22(70) (1978), no. 4, 425-429. ... At the end*of*the paper*some*results concerning com textual grammars with S-choice are presented, where 5 is the family*of*simple*contextual**languages*. ...##
###
Page 3749 of Mathematical Reviews Vol. , Issue 81I
[page]

1981
*
Mathematical Reviews
*

He then obtains three

*infinite**hierarchies**of**languages*which lie between the family*of*regular sets and the family*of*context-sensitive*languages*. S. Ginsburg (Los Angeles, Calif.) ... The author defines the notion*of*n-*contextual*grammars with*type*1, 2 or 3 choice. ...##
###
Page 433 of Mathematical Reviews Vol. , Issue 87a
[page]

1987
*
Mathematical Reviews
*

We show that this generates

*some*interesting classes*of*pictures. We prove the typical*hierarchy*result in this case. ... We investigate the generative capacity*of*these grammars, in com- parison with other*contextual**language*families and with families in the Chomsky*hierarchy*.” 87a:68110 Subramanian, K. G. ...##
###
Page 8125 of Mathematical Reviews Vol. , Issue 2000k
[page]

2000
*
Mathematical Reviews
*

*Some*variants

*of*this

*hierarchy*are also considered. ... Linguist., 47, Benjamins, Amsterdam, 1999, Summary: “We prove the existence

*of*an

*infinite*

*hierarchy*

*of*mildly context-sensitive families

*of*

*languages*. ...

##
###
Page 8286 of Mathematical Reviews Vol. , Issue 2001K
[page]

2001
*
Mathematical Reviews
*

In Chapter 5 the author establishes properties

*of*sev- eral families*of**contextual**languages*(including characterization theorems),*some**hierarchy*results, and relationships with families from the Chomsky ... Chapter 7 (Linguistically relevant properties) is devoted to semilinearity, the complexity*of*recogniz- ing*contextual**languages*, descriptional complexity, several*types**of*ambiguity, syntactical structures ...##
###
On external contextual grammars with subregular selection languages

2012
*
Theoretical Computer Science
*

If we consider families F n which are obtained by restriction to n states or nonterminals or productions or symbols to accept or to generate regular

doi:10.1016/j.tcs.2012.04.008
fatcat:3j33hiwdlzdslmedikad3yqyim
*languages*, we obtain four*infinite**hierarchies**of*the ... In this paper, we study the power*of*external*contextual*grammars with selection*languages*from subfamilies*of*the family*of*regular*languages*. ... Part*of*this paper was written when Florin Manea was a Research Fellow*of*the Alexander von Humboldt Foundation at the Otto-von-Guericke-Universität Magdeburg, Fakultät für Informatik, whose support is ...##
###
Page 5324 of Mathematical Reviews Vol. , Issue 82m
[page]

1982
*
Mathematical Reviews
*

They naturally induce two

*infinite**hierarchies*in the families*of*regular and linear*languages*, respectively. ... .; Yehudai, Amiram A*hierarchy**of*deterministic J. Comput. System Sci. 19 (1979), no. 1, 63-78. Authors’ summary: “An*infinite**hierarchy**of*deterministic context-free*languages*is introduced. ...##
###
Page 4680 of Mathematical Reviews Vol. , Issue 83k
[page]

1983
*
Mathematical Reviews
*

We continually compare the generative capacity

*of**contextual*grammars*of*various*types*to that*of*Chomsky grammars. “The book consists*of*ten chapters. ... Paun, Gheorghe 83k:68077 *Gramatici*contextuale*. (Romanian) (*Contextual*grammars] With preface by Solomon Marcus. With an English summary. ...##
###
Page 8089 of Mathematical Reviews Vol. , Issue 98M
[page]

1998
*
Mathematical Reviews
*

In the first two sections

*of*this clearly written overview the authors consider the families %) and Ycs*of**type*0 and*type*| (context- sensitive)*languages**of*the Chomsky*hierarchy*. ... These*languages*are gen- erated by generalized finite transducers with finite-turn counters on*infinite*labeled trees. 2TC-generability*of*various*languages*(context-free*languages*,*languages*recognizable ...##
###
Page 1172 of Mathematical Reviews Vol. , Issue 84c
[page]

1984
*
Mathematical Reviews
*

The adherence

*of*a formal*language*is defined as the set*of**infinite*words all*of*whose prefixes are prefixes*of*words in the*language*in question. ... Thus, for the Chomsky*hierarchy*, there is a corresponding family*of**languages*. ...##
###
Page 758 of Mathematical Reviews Vol. , Issue 84b
[page]

1984
*
Mathematical Reviews
*

., Gdansk, 1976), 105-114, Springer, Berlin, 1976; Zbl 355:94063] as well as (

*infinite*) variants*of*Marcus*contextual*grammars [S. Marcus, Rev. Roumaine Math. ... We give relations between restricted cones*of*C(£) and ¢(£), which allow us to construct an*infinite**hierarchy**of*nonerasable context-free*languages*(L is erasable = C({L})= e“({L})).” Maurer, H. ...##
###
Page 2542 of Mathematical Reviews Vol. , Issue 83f
[page]

1983
*
Mathematical Reviews
*

As can be seen the author has indeed chosen

*some*gems*of*formal*language*theory, many*of*them having been solved only recently. ... In the first paper, another variant*of**contextual*grammar is introduced with the hope*of*finding a common approach for the former classes*of**contextual*grammars and*languages*. ...##
###
Marcus t-contextual grammars and cut hierarchies and monotonicity for restarting automata

2006
*
Theoretical Computer Science
*

In the first part

doi:10.1016/j.tcs.2006.08.027
fatcat:glgmfwxnsbcn3ivcwt7pu57fju
*of*the paper classes*of**languages*are studied that are accepted by certain*types**of*restarting automata with limited cut-index. ... The t-*contextual*grammars are generalizations*of*Marcus*contextual*grammars, which insert t contexts in each derivation step. ... As M is not in weak cyclic form,*some**of*the regular*languages*E 1 , . . . , E m are*infinite*. Say that E 1 is*infinite*. ...##
###
Page 8491 of Mathematical Reviews Vol. , Issue 2002K
[page]

2002
*
Mathematical Reviews
*

Asveld, An

*infinite*se- quence*of*full AFL-structures, each*of*which possesses an*infinite**hierarchy*(175-186); Adrian Atanasiu, Trellis*languages*(187- 198); Paolo Bottoni, Pictures, layers, double stranded ... Selivanov], A logical approach to decidability*of**hierarchies**of*regular star-free*languages*(539-550); Howard Straubing and De- nis Thérien, Regular*languages*defined by generalized first-order formulas ...
« Previous

*Showing results 1 — 15 out of 15,768 results*