• Deutsch
    • English
  • Publish
  • About KOBRA  
    • About us
    • Policy
    • License
    • FAQ
    • Contact
  • 🇬🇧
    • Deutsch
    • English
  • Login
Search 
  •   KOBRA
  • Fachbereiche
  • Search
  •   KOBRA
  • Fachbereiche
  • Search
JavaScript is disabled for your browser. Some features of this site may not work without it.


Diese Webseite benutzt Cookies.
COOKIE POLICY DER UNI. Close


Search

Show Advanced FiltersHide Advanced Filters

Filters

Use filters to refine the search results.

Now showing items 1-10 of 92

  • Sort Options:
  • Relevance
  • Title Asc
  • Title Desc
  • Issue Date Asc
  • Issue Date Desc
  • Results Per Page:
  • 5
  • 10
  • 20
  • 40
  • 60
  • 80
  • 100
Thumbnail

Preprint Church-Rosser groups and growing context-sensitive groups 

Kambites, Mark; Otto, Friedrich (2006)
A finitely generated group is called a Church-Rosser group (growing context-sensitive group) if it admits a finitely generated presentation for which the word problem is a Church-Rosser (growing context-sensitive) language. Although the Church-Rosser languages are incomparable to the context-free languages under set inclusion, they strictly contain the class of deterministic context-free languages. As each context-free group language is actually deterministic context-free, it follows that all context-free groups ...
Thumbnail

Preprint Degrees of Free Word-Order and Freely Rewriting Restarting Automata 

Mráz, František; Otto, Friedrich; Plátek, Martin (Universität Kassel, FB 17, Mathematik/Informatik, 2005)
In natural languages with a high degree of word-order freedom syntactic phenomena like dependencies (subordinations) or valencies do not depend on the word-order (or on the individual positions of the individual words). This means that some permutations of sentences of these languages are in some (important) sense syntactically equivalent. Here we study this phenomenon in a formal way. Various types of j-monotonicity for restarting automata can serve as parameters for the degree of word-order freedom and for the ...
Thumbnail

Preprint On the Descriptional Complexity of Simple RL-Automata 

Messerschmidt, Hartmut; Mráz, František; Otto, Friedrich; Plátek, Martin (2006)
Analysis by reduction is a method used in linguistics for checking the correctness of sentences of natural languages. This method is modelled by restarting automata. Here we study a new type of restarting automaton, the so-called t-sRL-automaton, which is an RL-automaton that is rather restricted in that it has a window of size 1 only, and that it works under a minimal acceptance condition. On the other hand, it is allowed to perform up to t rewrite (that is, delete) steps per cycle. We focus on the descriptional ...
Thumbnail

Preprint Restarting automata with restricted utilization of auxiliary symbols 

Jurdzinski, Tomasz; Otto, Friedrich (Universität Kassel, FB 17, Mathematik/Informatik, 2005)
The restarting automaton is a restricted model of computation that was introduced by Jancar et al. to model the so-called analysis by reduction, which is a technique used in linguistics to analyze sentences of natural languages. The most general models of restarting automata make use of auxiliary symbols in their rewrite operations, although this ability does not directly correspond to any aspect of the analysis by reduction. Here we put restrictions on the way in which restarting automata use auxiliary symbols, and ...
Thumbnail

Preprint Learning analysis by reduction from positive data 

Mráz, František; Otto, Friedrich; Plátek, Martin (Universität Kassel, FB 17, Mathematik/Informatik, 2005)
Analysis by reduction is a linguistically motivated method for checking correctness of a sentence. It can be modelled by restarting automata. In this paper we propose a method for learning restarting automata which are strictly locally testable (SLT-R-automata). The method is based on the concept of identification in the limit from positive examples only. Also we characterize the class of languages accepted by SLT-R-automata with respect to the Chomsky hierarchy.
Thumbnail

Preprint Shrinking restarting automata 

Jurdzinski, Tomasz; Otto, Friedrich (Universität Kassel, FB 17, Mathematik/Informatik, 2005)
Restarting automata are a restricted model of computation that was introduced by Jancar et.al. to model the so-called analysis by reduction. A computation of a restarting automaton consists of a sequence of cycles such that in each cycle the automaton performs exactly one rewrite step, which replaces a small part of the tape content by another, even shorter word. Thus, each language accepted by a restarting automaton belongs to the complexity class $CSL cap NP$. Here we consider a natural generalization of this model, ...
Thumbnail

Preprint On the Gap-Complexity of Simple RL-Automata 

Mráz, František; Otto, Friedrich; Plátek, Martin (2006)
Analysis by reduction is a method used in linguistics for checking the correctness of sentences of natural languages. This method is modelled by restarting automata. All types of restarting automata considered in the literature up to now accept at least the deterministic context-free languages. Here we introduce and study a new type of restarting automaton, the so-called t-RL-automaton, which is an RL-automaton that is rather restricted in that it has a window of size one only, and that it works under a minimal ...
Thumbnail

Preprint 5. Krypto-Tag - Workshop über Kryptographie 

Stamer, Heiko (2006)
Dieser Tagungsband enthält die gesammelten Zusammenfassungen der acht eingereichten Vorträge des 5. Krypto-Tags. Der Kryptotag ist eine zentrale Aktivität der Fachgruppe "Angewandte Kryptologie" der Gesellschaft für Informatik e.V. Er ist eine wissenschaftliche Veranstaltung im Bereich der Kryptologie und von der organisatorischen Arbeit der Fachgruppe getrennt.
Thumbnail

Buch Die Verletzlichkeit der "Informationsgesellschaft" 

Roßnagel, Alexander; Wedde, Peter; Hammer, Volker; Pordesch, Ulrich (Westdeutscher Verlag, Opladen, 2002)
Thumbnail

Technischer Report Lower Bounds for Nonforgetting Restarting Automata and CD-Systems of Restarting Automata 

Otto, Friedrich (2008-10-06)
The nonforgetting restarting automaton is a generalization of the restarting automaton that, when executing a restart operation, changes its internal state based on the current state and the actual contents of its read/write window instead of resetting it to the initial state. Another generalization of the restarting automaton is the cooperating distributed system (CD-system) of restarting automata. Here a finite system of restarting automata works together in analyzing a given sentence, where they interact based ...
  • 1
  • 2
  • 3
  • 4
  • . . .
  • 10

DSpace software copyright © 2002-2015  DuraSpace
KOBRA copyright © 2006-2018  UB Kassel
Contact Us | Send Feedback | Impressum / Datenschutz
Theme by 
Atmire NV
 

 

Browse

All of KOBRACommunities & CollectionsBy Issue Date Authors Titles Keyword (DDC)Keyword (GND)Publication type Language Open access This CommunityBy Issue Date Authors Titles Keyword (DDC)Keyword (GND)Publication type Language Open access

Discover

  • Date Issued 2009 (10) 2008 (9) 2007 (16) 2006 (18) 2005 (12) 2004 (6) 2003 (5) 2002 (6) 2001 (2) 2000 (8)
  • Publication typeArticle  (15)Book  (1)Diploma thesis  (2)Doctoral thesis  (19)Course material  (3)xmlui.type.  (
  • Keyword (DDC)000  Computer science, knowledge and systems  (3)
    004 (92)
    300  Social sciences  (1)370  Education  (1)500  Science  (1)... View More
  • Open access open access (92)

DSpace software copyright © 2002-2015  DuraSpace
KOBRA copyright © 2006-2018  UB Kassel
Contact Us | Send Feedback | Impressum / Datenschutz
Theme by 
Atmire NV