Temat: automata - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: On regular copying languages
Autorzy:: Wang, Yang
Hunter, Tim
Powiązania:: https://bibliotekanauki.pl/articles/24201233.pdf
Data publikacji:: 2023
Wydawca:: Polska Akademia Nauk. Instytut Podstaw Informatyki PAN
Tematy:: reduplication
copying
finite-state machinery
queue automata
Opis:: This paper proposes a formal model of regular languages enriched with unbounded copying. We augment finite-state machinery with the ability to recognize copied strings by adding an unbounded memory buffer with a restricted form of first-in-first-out storage. The newly introduced computational device, finite-state buffered machines (FS-BMs), characterizes the class of regular languages and languages de-rived from them through a primitive copying operation. We name this language class regular copying languages (RCLs). We prove a pumping lemma and examine the closure properties of this language class. As suggested by previous literature (Gazdar and Pullum 1985, p.278), regular copying languages should approach the correct characteriza-tion of natural language word sets.
Źródło:: Journal of Language Modelling; 2023, 11, 1; 1--66
2299-856X
2299-8470
Pojawia się w:: Journal of Language Modelling
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 2.

Tytuł:: Extracting Subregular constraints from Regular stringsets
Autorzy:: Rogers, James
Lambert, Dakotah
Powiązania:: https://bibliotekanauki.pl/articles/103839.pdf
Data publikacji:: 2019
Wydawca:: Polska Akademia Nauk. Instytut Podstaw Informatyki PAN
Tematy:: regular languages
finite-state automata
local languages
piecewise languages
Opis:: We introduce algorithms that, given a finite-state automaton (FSA), compute a minimal set of forbidden local factors that define a Strictly Local (SL) tight approximation of the stringset recognised by the FSA and the set of forbidden piecewise factors that define a Strictly Piecewise (SP) tight approximation of that stringset, as well as a set of co-SL factors that, together with the SL and SP factors, provide a set of purely conjunctive literal constraints defining a minimal superset of the stringset recognised by the automaton. Using these, we have built computational tools that have allowed us to reproduce, by nearly purely computational means, the work of Rogers and his co-workers (Rogers et al. 2012) in which, using a mix of computational and analytical techniques, they completely characterised, with respect to the Local and Piecewise Subregular hierarchies, the constraints on the distribution of stress in human languages that are documented in the StressTyp2 database. Our focus, in this paper, is on the algorithms and the method of their application. The phonology of stress patterns is a particularly good domain of application since, as we show here, they generally fall at the very lowest levels of complexity. We discuss these phonological results here, but do not consider their consequences in depth.
Źródło:: Journal of Language Modelling; 2019, 7, 2; 143-176
2299-856X
2299-8470
Pojawia się w:: Journal of Language Modelling
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 3.

Tytuł:: Rewrite rule gram mars with multitape automata
Autorzy:: Hulden, M.
Powiązania:: https://bibliotekanauki.pl/articles/103887.pdf
Data publikacji:: 2017
Wydawca:: Polska Akademia Nauk. Instytut Podstaw Informatyki PAN
Tematy:: grammar design
multitape automata
morphology
phonology
finite-state phonology
Opis:: The majority of computational implementations of phonological and morphophonological alternations rely on composing together individual finite state transducers that represent sound changes. Standard composition algorithms do not maintain the intermediate representations between the ultimate input and output forms. These intermedia te strings, however, can be very helpful for various tasks: enriching information (indispensable for models of historical linguistics), providing new avenues to debugging complex grammars, and offering explicit alignment information between morphemes, sound segments, and tags. This paper describes a multitape automaton approach to creating full models of sequences of sound alternation that implement phonological and morphological grammars. A model and a practical implementation of multitape automata is provided together with a multitape composition algorithm tailored to the representation used In this paper. Practical use cases of the approach are illustrated through two common examples: a phonological example of a complex rewrite rule grammar where multiple rules interact and a diachronic ex ample of modeling sound change over time.
Źródło:: Journal of Language Modelling; 2017, 5, 1; 107-130
2299-856X
2299-8470
Pojawia się w:: Journal of Language Modelling
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 4.

Tytuł:: A logical approach to grammar description
Autorzy:: Clément, L.
Kirman, J.
Salvati, S.
Powiązania:: https://bibliotekanauki.pl/articles/103895.pdf
Data publikacji:: 2015
Wydawca:: Polska Akademia Nauk. Instytut Podstaw Informatyki PAN
Tematy:: grammar description
logic
Finite State Automata
logical transduction
lambda calculus
Abstract Categorial Grammars
Opis:: In the tradition of Model Theoretic Syntax, we propose a logical approach to the description of grammars. We combine in one formalism several tools that are used throughout computer science for their power of abstraction: logic and lambda calculus. We propose then a high-level formalism for describing mildly context sensitive grammars and their semantic interpretation. As we rely on the correspondence between logic and finite state automata, our method combines conciseness with effectivity. We illustrate our approach with a simple linguistic model of several interleaved linguistic phenomena involving extraction. The level of abstraction provided by logic and lambda calculus allows us not only to use this linguistic model for several languages, namely English, German, and Dutch, but also for semantic interpretation.
Źródło:: Journal of Language Modelling; 2015, 3, 1; 87-143
2299-856X
2299-8470
Pojawia się w:: Journal of Language Modelling
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Informacja

Wyszukujesz frazę "automata" wg kryterium: Temat

Źródło danych

Dostawca treści

Kolekcja

Rok wydania

Wydawca

Temat

Autor

Typ dokumentu

Język