Filters








247,345 Hits in 5.0 sec

Page 8090 of Mathematical Reviews Vol. , Issue 98M [page]

1998 Mathematical Reviews  
A language having finitely many primitive roots is called a local language. The purpose of this paper is to characterize local regular languages.  ...  |Yii, Shih Shéng] (RC-CHH-AM; Taichung) A characterization of local regular languages. (English summary) Discrete Math. 184 (1998), no. 1-3, 195-203.  ... 

From Regular to Strictly Locally Testable Languages

Stefano Crespi Reghizzi, Pierluigi San Pietro
2011 Electronic Proceedings in Theoretical Computer Science  
Local languages are characterized by the value k=2 of the sliding window width in the McNaughton and Papert's infinite hierarchy of strictly locally testable languages (k-slt).  ...  Medvedev) states that every language recognized by a finite automaton is the homomorphic image of a local language, over a much larger so-called local alphabet, namely the alphabet of the edges of the  ...  Conclusion We have generalized Medvedev's homomorphic characterization of regular languages: instead of using as generator a local language over a large alphabet, which depends on the complexity of the  ... 
doi:10.4204/eptcs.63.14 fatcat:cut3qi6jdvfk3jaew3fl2xgtmq

FROM REGULAR TO STRICTLY LOCALLY TESTABLE LANGUAGES

STEFANO CRESPI REGHIZZI, PIERLUIGI SAN PIETRO
2012 International Journal of Foundations of Computer Science  
Local languages are characterized by the value k = 2 of the sliding window width in the McNaughton and Papert's infinite hierarchy of strictly locally testable languages (k-slt).  ...  Medvedev) states that every language recognized by a finite automaton is the homomorphic image of a local language, over a much larger so-called local alphabet, namely the alphabet of the edges of the  ...  Conclusion We have generalized Medvedev's homomorphic characterization of regular languages: instead of using as generator a local language over a large alphabet, which depends on the complexity of the  ... 
doi:10.1142/s0129054112400710 fatcat:wtc7q7hpj5aoxjfqqyeu6sacpy

Page 4218 of Mathematical Reviews Vol. , Issue 99f [page]

1999 Mathematical Reviews  
Summary: “We provide a characterization of the local sets (sets of trees generated by CFGs) in terms of definability in a restricted logical language, which we contrast with a similar characterization  ...  In terms of descriptive complexity, the contrast is quite profound—while the recognizable sets are characterized by a monadic second-order language, the local sets are characterized by a severely restricted  ... 

Strict LT2 : Regular :: Local : Recognizable [chapter]

James Rogers
1997 Lecture Notes in Computer Science  
S characterize the regular and context-free languages in the weak sense|they characterize the string languages.  ...  In this paper we de ne a sub-language of SnS that characterizes the local sets.  ...  Suppose G is a CFG over and the local trees in G with root A are: hA; hA 1 A 2 A 3 ii ; hA; hA 4 A 5 ii and hA; "i : We can capture the requirement that every local tree with root labeled A is one of these  ... 
doi:10.1007/bfb0052167 fatcat:runa7rk4qrblpgv5cykkxmpguu

Page 3265 of Mathematical Reviews Vol. , Issue 81H [page]

1981 Mathematical Reviews  
A. 81h:68068 A characterization of a dot-depth two analogue of generalized definite languages. Automata, languages and programming (Sixth Colloq., Graz, 1979), pp. 230-244, Lecture Notes in Comput.  ...  The aim of the paper is to characterize for R and S when there exists a rational bijection of R onto S. One such characterization is given in terms of right-linear grammars for R and S.  ... 

Computational Phonology - Part II: Grammars, Learning, and the Future

Jeffrey Heinz
2011 Language and Linguistics Compass  
Computational phonology studies sound patterns in the world's languages from a computational perspective.  ...  However, it is also informative for readers with a background in computation and the basics of phonology, and who are curious about what computational analysis offers phonological theory.  ...  SUBREGULAR HIERARCHIES The class of regular languages contains a dual hierarchy of nested regions. There is a LOCAL branch and a PIECEWISE branch.  ... 
doi:10.1111/j.1749-818x.2011.00268.x fatcat:qi2gb3fsfbawrnk2b6fjf3ey34

New Morphic Characterizations of Languages in Chomsky Hierarchy Using Insertion and Locality [chapter]

Kaoru Onodera
2009 Lecture Notes in Computer Science  
In this paper, we obtain some characterizations and representation theorems of context-free languages in Chomsky hierarchy by using insertion systems, strictly locally testable languages, and morphisms  ...  This work is supported in part by Grant-in-Aid for the Research Institute for Science and Technology of Tokyo Denki University with no.Q07J-05.  ...  The following characterizations of regular languages in terms of insertion languages and strictly locally testable languages have shown in [8] .  ... 
doi:10.1007/978-3-642-00982-2_55 fatcat:ivzh2u6bpvf45pqs3h6m5ditd4

THE REGULARITY OF TWO-WAY NONDETERMINISTIC TREE AUTOMATA LANGUAGES

ANNE BRÜGGEMANN-KLEIN, DERICK WOOD
2002 International Journal of Foundations of Computer Science  
Our motivation for the study of these tree models is the Extensible Markup Language (XML), a metalanguage for de ning document grammars.  ...  We obtain this result by establishing regularly extended versions of a congruence on trees and of a congruence on, so called, views.  ...  We then establish the main characterization theorem of this section; namely, a tree language is regular if and only if it has nite top index and all its local views are regular string languages.  ... 
doi:10.1142/s0129054102000959 fatcat:aqzwz4yt6rdxxnuybkxblev5xi

Temporal Logic and Semidirect Products: An Effective Characterization of the Until Hierarchy

Denis Thérien, Thomas Wilke
2001 SIAM journal on computing (Print)  
by a formula of nesting depth at most k in the 'until' operator.  ...  We use this connection to obtain an algebraic characterization of the 'until' hierarchy of linear temporal logic; the k-th level of that hierarchy is comprised of all temporal properties that are expressible  ...  The second author is particularly grateful to Kramer, George, Jerry, and Elaine, and to the nice people at the Palmyra, who helped him survive a cold winter in New Jersey.  ... 
doi:10.1137/s0097539797322772 fatcat:vjfyk6w42varto7tbt3i2n6osm

Effective characterizations of tree logics

Mikolaj Bojanńzyk
2008 Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems - PODS '08  
A survey of effective characterizations of tree logics.  ...  If L is a logic, then an effective characterization for L is an algorithm, which inputs a tree automaton and replies if the recognized language can be defined by a formula in L.  ...  Regular languages. There are many equivalent definitions of regular tree languages.  ... 
doi:10.1145/1376916.1376925 dblp:conf/pods/Bojanzyk08 fatcat:vqfmtc5w7zgjte4fkejnochote

Groups whose geodesics are locally testable [article]

S. Hermiller, Derek F. Holt, Sarah Rees
2011 arXiv   pre-print
A regular set of words is (k-)locally testable if membership of a word in the set is determined by the nature of its subwords of some bounded length k.  ...  (assuming that this language is regular), starting from a shortlex automatic structure.  ...  The locally testable languages form a class lying between locally excluding and star-free regular languages.  ... 
arXiv:1111.0775v1 fatcat:62iitli2xnfgxhwpuv4sxedlze

Libor Polák (1950–2020)

Jiří Kad'ourek, Ondřej Klíma
2021 Semigroup Forum  
On algebraic theory of regular languages The first concept which Libor Polák invented in the theory of formal languages was the so-called syntactic semiring of a language.  ...  Subsequently, he found some applications of the notion of the syntactic semiring of a regular language in the paper [23] , searching for maximal solutions of a certain type of language equations.  ... 
doi:10.1007/s00233-021-10177-y fatcat:yqcyupmnmrcmrkl2q7npbptlmm

On Languages Piecewise Testable in the Strict Sense [chapter]

James Rogers, Jeffrey Heinz, Gil Bailey, Matt Edlefsen, Molly Visscher, David Wellcome, Sean Wibel
2010 Lecture Notes in Computer Science  
the grammars defined here and finite state automata as well as an algorithm for deciding whether a regular language is Strictly Piecewise.  ...  In this paper we explore the class of Strictly Piecewise languages, originally introduced to characterize long-distance phonotactic patterns by Heinz [7] as the Precedence Languages.  ...  subsequences like [ The Piecewise Testable (PT) languages [22] are a subclass of the regular languages that can describe this kind of non-local pattern.  ... 
doi:10.1007/978-3-642-14322-9_19 fatcat:rqddowzppzhrhpejykfw3l3iie

Cellular automata as models of complexity

Stephen Wolfram
1984 Nature  
As time grows, less configurations are generated. • Set of all possible configurations at each time step forms regular language. • Number of nodes in the smallest graph = Regular language complexity of  ...  initial configurations = Trivial formal language • Set of configurations after any finite number of time steps = Regular language Formal Language Theory • Set of configurations generated in the first  ...  Computation theory • For class 3 and 4: • the occurrence of a particular length n site value sequence in infinite time is undecidable. • Decidable in finite time considering initial sequence length n0=  ... 
doi:10.1038/311419a0 fatcat:kbs6fi7g5vb6dhyuuzf6bdz6xq
« Previous Showing results 1 — 15 out of 247,345 results