A logical characterization of weak determinism as simultaneous application

DOI10.1007/S10849-025-09429-9MaRDI QIDQ6964769zbMATH OpenFDO

Authors Tatevik Yolyan

Publication date 4 July 2025

Published in Journal of Logic, Language and Information (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S10849-025-09429-9

zbMATH Keywords

Boolean monadic recursive schemescomputational phonologysimultaneous applicationweak determinism

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX) Computer science (68-XX)

Cites work

• A remark on finite transducers
• Abstract recursion and intrinsic complexity
• Aural pattern recognition experiments and the subregular hierarchy
• Boolean monadic recursive schemes as a logical characterization of the subsequential functions
• Elements of automata theory. Translated from the French by Reuben Thomas
• Finite-state techniques. Automata, transducers and bimachines
• scientific article; zbMATH DE number 7354705 (Why is no real title available?)
• Monadic second-order definable graph transductions: a survey
• MSO definable string transductions and two-way finite-state transducers
• On certain formal properties of grammars
• On Relations Defined by Generalized Finite Automata
• Output strictly local functions
• Sentence and word complexity
• Three models for the description of language
• Transducers with Origin Information
• Vowel harmony and subsequentiality
• Which classes of origin graphs are generated by transducers

This page was built for publication: A logical characterization of weak determinism as simultaneous application

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6964769)